./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix011_power.oepc_pso.oepc_rmo.oepc.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/mix011_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix011_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m
[2024-05-12 11:20:01,243 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-05-12 11:20:01,305 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-05-12 11:20:01,315 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-05-12 11:20:01,315 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-12 11:20:01,342 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-12 11:20:01,343 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-12 11:20:01,343 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-12 11:20:01,343 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-05-12 11:20:01,346 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-05-12 11:20:01,347 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-12 11:20:01,347 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-12 11:20:01,348 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-12 11:20:01,349 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-05-12 11:20:01,349 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-05-12 11:20:01,349 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-12 11:20:01,349 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-05-12 11:20:01,349 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-05-12 11:20:01,350 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-05-12 11:20:01,350 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-05-12 11:20:01,350 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-05-12 11:20:01,350 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-05-12 11:20:01,350 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-12 11:20:01,351 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-05-12 11:20:01,351 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-05-12 11:20:01,351 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-05-12 11:20:01,351 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-05-12 11:20:01,351 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-05-12 11:20:01,352 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-12 11:20:01,352 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-05-12 11:20:01,353 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-05-12 11:20:01,353 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-05-12 11:20:01,353 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:20:01,353 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-12 11:20:01,353 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-05-12 11:20:01,354 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-05-12 11:20:01,354 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-05-12 11:20:01,354 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-12 11:20:01,354 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-12 11:20:01,354 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-05-12 11:20:01,354 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-12 11:20:01,355 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-05-12 11:20:01,355 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-05-12 11:20:01,355 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:20:01,618 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-12 11:20:01,638 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-12 11:20:01,640 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-12 11:20:01,642 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-05-12 11:20:01,642 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-05-12 11:20:01,643 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/mix011_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-05-12 11:20:01,839 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-05-12 11:20:01,839 INFO  L274        PluginConnector]: CDTParser initialized
[2024-05-12 11:20:01,840 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i
[2024-05-12 11:20:02,966 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-05-12 11:20:03,179 INFO  L384              CDTParser]: Found 1 translation units.
[2024-05-12 11:20:03,179 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc_pso.oepc_rmo.oepc.i
[2024-05-12 11:20:03,203 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ddfa6b5/5e70fb576aad40259e6781b8091db10b/FLAG443a22af0
[2024-05-12 11:20:03,213 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4ddfa6b5/5e70fb576aad40259e6781b8091db10b
[2024-05-12 11:20:03,213 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-12 11:20:03,214 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-12 11:20:03,215 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-12 11:20:03,215 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-12 11:20:03,219 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-12 11:20:03,219 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:20:01" (1/2) ...
[2024-05-12 11:20:03,220 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1864ddcf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:20:03, skipping insertion in model container
[2024-05-12 11:20:03,220 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:20:01" (1/2) ...
[2024-05-12 11:20:03,222 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29431811 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:20:03, skipping insertion in model container
[2024-05-12 11:20:03,222 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:20:03" (2/2) ...
[2024-05-12 11:20:03,222 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1864ddcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03, skipping insertion in model container
[2024-05-12 11:20:03,222 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:20:03" (2/2) ...
[2024-05-12 11:20:03,223 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-05-12 11:20:03,313 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-05-12 11:20:03,314 INFO  L97    edCorrectnessWitness]: Location invariant before [L854-L854] (((((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__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)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))
[2024-05-12 11:20:03,315 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__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)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))
[2024-05-12 11:20:03,315 INFO  L97    edCorrectnessWitness]: Location invariant before [L853-L853] (((((((((((((((((((((! multithreaded || a$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__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)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))
[2024-05-12 11:20:03,316 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-05-12 11:20:03,316 INFO  L106   edCorrectnessWitness]: ghost_update [L849-L849] multithreaded = 1;
[2024-05-12 11:20:03,351 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-05-12 11:20:03,496 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2024-05-12 11:20:03,650 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:20:03,660 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-05-12 11:20:03,689 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/mix011_power.oepc_pso.oepc_rmo.oepc.i[969,982]
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-05-12 11:20:03,961 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:20:03,988 INFO  L206         MainTranslator]: Completed translation
[2024-05-12 11:20:03,988 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03 WrapperNode
[2024-05-12 11:20:03,989 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-12 11:20:03,989 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-12 11:20:03,990 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-12 11:20:03,990 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-12 11:20:03,995 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:20:03" (1/1) ...
[2024-05-12 11:20:04,028 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:20:03" (1/1) ...
[2024-05-12 11:20:04,193 INFO  L138                Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136
[2024-05-12 11:20:04,194 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-12 11:20:04,195 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-12 11:20:04,195 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-12 11:20:04,195 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-05-12 11:20:04,204 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,204 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,249 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,289 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:20:04,290 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,290 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,380 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,389 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,400 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,405 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,420 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-12 11:20:04,421 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-12 11:20:04,421 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-05-12 11:20:04,421 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-05-12 11:20:04,422 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (1/1) ...
[2024-05-12 11:20:04,427 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:20:04,434 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-05-12 11:20:04,449 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:20:04,468 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:20:04,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-05-12 11:20:04,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-05-12 11:20:04,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-05-12 11:20:04,480 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2024-05-12 11:20:04,481 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-12 11:20:04,481 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-12 11:20:04,481 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-12 11:20:04,481 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-12 11:20:04,481 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-05-12 11:20:04,481 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-05-12 11:20:04,482 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-05-12 11:20:04,482 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-05-12 11:20:04,482 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-05-12 11:20:04,483 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-05-12 11:20:04,483 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-05-12 11:20:04,483 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-05-12 11:20:04,483 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-05-12 11:20:04,483 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-05-12 11:20:04,484 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-12 11:20:04,484 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-12 11:20:04,484 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-12 11:20:04,485 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:20:04,622 INFO  L244             CfgBuilder]: Building ICFG
[2024-05-12 11:20:04,623 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-12 11:20:06,011 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-05-12 11:20:06,012 INFO  L293             CfgBuilder]: Performing block encoding
[2024-05-12 11:20:06,321 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-12 11:20:06,322 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-12 11:20:06,322 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:20:06 BoogieIcfgContainer
[2024-05-12 11:20:06,322 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-12 11:20:06,324 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-12 11:20:06,324 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-05-12 11:20:06,327 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-05-12 11:20:06,327 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:20:01" (1/4) ...
[2024-05-12 11:20:06,327 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bdc937 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:20:06, skipping insertion in model container
[2024-05-12 11:20:06,328 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:20:03" (2/4) ...
[2024-05-12 11:20:06,328 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bdc937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:20:06, skipping insertion in model container
[2024-05-12 11:20:06,328 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:20:03" (3/4) ...
[2024-05-12 11:20:06,328 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55bdc937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:20:06, skipping insertion in model container
[2024-05-12 11:20:06,328 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:20:06" (4/4) ...
[2024-05-12 11:20:06,329 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix011_power.oepc_pso.oepc_rmo.oepc.i
[2024-05-12 11:20:06,344 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-12 11:20:06,344 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-05-12 11:20:06,344 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-12 11:20:06,467 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-05-12 11:20:06,495 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 112 flow
[2024-05-12 11:20:06,545 INFO  L124   PetriNetUnfolderBase]: 1/47 cut-off events.
[2024-05-12 11:20:06,546 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:20:06,549 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57 conditions, 47 events. 1/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. 
[2024-05-12 11:20:06,549 INFO  L82        GeneralOperation]: Start removeDead. Operand has 59 places, 50 transitions, 112 flow
[2024-05-12 11:20:06,552 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 56 places, 47 transitions, 103 flow
[2024-05-12 11:20:06,558 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-05-12 11:20:06,562 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;@5482796a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-12 11:20:06,563 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-05-12 11:20:06,569 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-05-12 11:20:06,569 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-05-12 11:20:06,569 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:20:06,569 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:06,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:06,570 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:06,573 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:06,573 INFO  L85        PathProgramCache]: Analyzing trace with hash -1937993587, now seen corresponding path program 1 times
[2024-05-12 11:20:06,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:06,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401027573]
[2024-05-12 11:20:06,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:06,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:06,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:20:14,116 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:20:14,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:20:14,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401027573]
[2024-05-12 11:20:14,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401027573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:20:14,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:20:14,118 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:20:14,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579354489]
[2024-05-12 11:20:14,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:20:14,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:20:14,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:20:14,148 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:20:14,149 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:20:14,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50
[2024-05-12 11:20:14,253 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 103 flow. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:14,253 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:20:14,253 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50
[2024-05-12 11:20:14,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:20:15,879 INFO  L124   PetriNetUnfolderBase]: 4500/7460 cut-off events.
[2024-05-12 11:20:15,880 INFO  L125   PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES.
[2024-05-12 11:20:15,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14025 conditions, 7460 events. 4500/7460 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 50347 event pairs, 3527 based on Foata normal form. 211/7044 useless extension candidates. Maximal degree in co-relation 14010. Up to 6446 conditions per place. 
[2024-05-12 11:20:15,922 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 44 selfloop transitions, 5 changer transitions 0/61 dead transitions.
[2024-05-12 11:20:15,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 235 flow
[2024-05-12 11:20:15,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:20:15,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:20:15,931 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions.
[2024-05-12 11:20:15,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.66
[2024-05-12 11:20:15,934 INFO  L175             Difference]: Start difference. First operand has 56 places, 47 transitions, 103 flow. Second operand 3 states and 99 transitions.
[2024-05-12 11:20:15,934 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 235 flow
[2024-05-12 11:20:15,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 230 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-05-12 11:20:15,941 INFO  L231             Difference]: Finished difference. Result has 56 places, 50 transitions, 135 flow
[2024-05-12 11:20:15,942 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=56, PETRI_TRANSITIONS=50}
[2024-05-12 11:20:15,945 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places.
[2024-05-12 11:20:15,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 135 flow
[2024-05-12 11:20:15,945 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:15,945 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:15,946 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:15,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-12 11:20:15,946 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:15,947 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:15,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -1937992206, now seen corresponding path program 1 times
[2024-05-12 11:20:15,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:15,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678440632]
[2024-05-12 11:20:15,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:15,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:15,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:20:15,992 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:20:15,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:20:15,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678440632]
[2024-05-12 11:20:15,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678440632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:20:15,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:20:15,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:20:15,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523116095]
[2024-05-12 11:20:15,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:20:15,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:20:15,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:20:15,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:20:15,996 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:20:15,996 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50
[2024-05-12 11:20:15,996 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 135 flow. Second operand  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:15,996 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:20:15,996 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50
[2024-05-12 11:20:15,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:20:16,425 INFO  L124   PetriNetUnfolderBase]: 996/1926 cut-off events.
[2024-05-12 11:20:16,425 INFO  L125   PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES.
[2024-05-12 11:20:16,428 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3692 conditions, 1926 events. 996/1926 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 13082 event pairs, 655 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 3677. Up to 1277 conditions per place. 
[2024-05-12 11:20:16,434 INFO  L140   encePairwiseOnDemand]: 47/50 looper letters, 37 selfloop transitions, 3 changer transitions 0/64 dead transitions.
[2024-05-12 11:20:16,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 242 flow
[2024-05-12 11:20:16,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:20:16,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:20:16,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions.
[2024-05-12 11:20:16,436 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7666666666666667
[2024-05-12 11:20:16,436 INFO  L175             Difference]: Start difference. First operand has 56 places, 50 transitions, 135 flow. Second operand 3 states and 115 transitions.
[2024-05-12 11:20:16,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 242 flow
[2024-05-12 11:20:16,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-05-12 11:20:16,453 INFO  L231             Difference]: Finished difference. Result has 56 places, 48 transitions, 128 flow
[2024-05-12 11:20:16,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=48}
[2024-05-12 11:20:16,454 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places.
[2024-05-12 11:20:16,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 128 flow
[2024-05-12 11:20:16,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:16,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:16,455 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:16,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-12 11:20:16,455 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:16,455 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:16,455 INFO  L85        PathProgramCache]: Analyzing trace with hash 1603996427, now seen corresponding path program 1 times
[2024-05-12 11:20:16,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:16,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682259715]
[2024-05-12 11:20:16,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:16,456 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:16,527 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:20:22,470 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:20:22,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:20:22,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682259715]
[2024-05-12 11:20:22,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682259715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:20:22,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:20:22,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-12 11:20:22,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146343312]
[2024-05-12 11:20:22,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:20:22,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-05-12 11:20:22,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:20:22,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-05-12 11:20:22,475 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-05-12 11:20:22,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50
[2024-05-12 11:20:22,628 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 128 flow. Second operand  has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:20:22,628 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:20:22,628 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50
[2024-05-12 11:20:22,628 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:20:23,979 INFO  L124   PetriNetUnfolderBase]: 3821/6339 cut-off events.
[2024-05-12 11:20:23,980 INFO  L125   PetriNetUnfolderBase]: For 1436/1436 co-relation queries the response was YES.
[2024-05-12 11:20:23,990 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13266 conditions, 6339 events. 3821/6339 cut-off events. For 1436/1436 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 41124 event pairs, 2856 based on Foata normal form. 3/6096 useless extension candidates. Maximal degree in co-relation 13250. Up to 5470 conditions per place. 
[2024-05-12 11:20:24,013 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 52 selfloop transitions, 8 changer transitions 2/74 dead transitions.
[2024-05-12 11:20:24,013 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 324 flow
[2024-05-12 11:20:24,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-05-12 11:20:24,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-05-12 11:20:24,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions.
[2024-05-12 11:20:24,017 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.61
[2024-05-12 11:20:24,017 INFO  L175             Difference]: Start difference. First operand has 56 places, 48 transitions, 128 flow. Second operand 4 states and 122 transitions.
[2024-05-12 11:20:24,017 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 324 flow
[2024-05-12 11:20:24,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-05-12 11:20:24,021 INFO  L231             Difference]: Finished difference. Result has 59 places, 54 transitions, 189 flow
[2024-05-12 11:20:24,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=59, PETRI_TRANSITIONS=54}
[2024-05-12 11:20:24,022 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places.
[2024-05-12 11:20:24,022 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 189 flow
[2024-05-12 11:20:24,022 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:20:24,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:24,023 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:24,023 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-12 11:20:24,023 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:24,023 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:24,024 INFO  L85        PathProgramCache]: Analyzing trace with hash -1815717378, now seen corresponding path program 1 times
[2024-05-12 11:20:24,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:24,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113085745]
[2024-05-12 11:20:24,027 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:24,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:24,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:20:29,397 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:20:29,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:20:29,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113085745]
[2024-05-12 11:20:29,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113085745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:20:29,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:20:29,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-05-12 11:20:29,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140851766]
[2024-05-12 11:20:29,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:20:29,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-05-12 11:20:29,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:20:29,399 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-05-12 11:20:29,399 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-05-12 11:20:29,544 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50
[2024-05-12 11:20:29,545 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 189 flow. Second operand  has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:29,545 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:20:29,545 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50
[2024-05-12 11:20:29,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:20:30,872 INFO  L124   PetriNetUnfolderBase]: 3310/5618 cut-off events.
[2024-05-12 11:20:30,872 INFO  L125   PetriNetUnfolderBase]: For 2393/2393 co-relation queries the response was YES.
[2024-05-12 11:20:30,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12685 conditions, 5618 events. 3310/5618 cut-off events. For 2393/2393 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 36602 event pairs, 1988 based on Foata normal form. 5/5423 useless extension candidates. Maximal degree in co-relation 12667. Up to 4663 conditions per place. 
[2024-05-12 11:20:30,893 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 68 selfloop transitions, 18 changer transitions 0/98 dead transitions.
[2024-05-12 11:20:30,893 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 503 flow
[2024-05-12 11:20:30,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:20:30,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:20:30,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions.
[2024-05-12 11:20:30,895 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.624
[2024-05-12 11:20:30,895 INFO  L175             Difference]: Start difference. First operand has 59 places, 54 transitions, 189 flow. Second operand 5 states and 156 transitions.
[2024-05-12 11:20:30,895 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 503 flow
[2024-05-12 11:20:30,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 492 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-05-12 11:20:30,898 INFO  L231             Difference]: Finished difference. Result has 64 places, 66 transitions, 303 flow
[2024-05-12 11:20:30,898 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=178, 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=5, PETRI_FLOW=303, PETRI_PLACES=64, PETRI_TRANSITIONS=66}
[2024-05-12 11:20:30,899 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places.
[2024-05-12 11:20:30,899 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 303 flow
[2024-05-12 11:20:30,899 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:30,900 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:30,900 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:30,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-12 11:20:30,900 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:30,900 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:30,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -452662902, now seen corresponding path program 1 times
[2024-05-12 11:20:30,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:30,901 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432326122]
[2024-05-12 11:20:30,901 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:30,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:30,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:20:37,275 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:20:37,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:20:37,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432326122]
[2024-05-12 11:20:37,277 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432326122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:20:37,277 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:20:37,277 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:20:37,277 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773210098]
[2024-05-12 11:20:37,277 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:20:37,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:20:37,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:20:37,278 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:20:37,278 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:20:37,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50
[2024-05-12 11:20:37,478 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 303 flow. Second operand  has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:37,478 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:20:37,478 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50
[2024-05-12 11:20:37,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:20:39,027 INFO  L124   PetriNetUnfolderBase]: 3332/5659 cut-off events.
[2024-05-12 11:20:39,027 INFO  L125   PetriNetUnfolderBase]: For 5848/5851 co-relation queries the response was YES.
[2024-05-12 11:20:39,037 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14798 conditions, 5659 events. 3332/5659 cut-off events. For 5848/5851 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 37001 event pairs, 1717 based on Foata normal form. 7/5463 useless extension candidates. Maximal degree in co-relation 14776. Up to 4656 conditions per place. 
[2024-05-12 11:20:39,054 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 78 selfloop transitions, 22 changer transitions 0/112 dead transitions.
[2024-05-12 11:20:39,055 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 661 flow
[2024-05-12 11:20:39,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:20:39,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:20:39,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 185 transitions.
[2024-05-12 11:20:39,056 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6166666666666667
[2024-05-12 11:20:39,056 INFO  L175             Difference]: Start difference. First operand has 64 places, 66 transitions, 303 flow. Second operand 6 states and 185 transitions.
[2024-05-12 11:20:39,056 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 661 flow
[2024-05-12 11:20:39,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 112 transitions, 653 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-05-12 11:20:39,078 INFO  L231             Difference]: Finished difference. Result has 70 places, 70 transitions, 380 flow
[2024-05-12 11:20:39,078 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=380, PETRI_PLACES=70, PETRI_TRANSITIONS=70}
[2024-05-12 11:20:39,079 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 14 predicate places.
[2024-05-12 11:20:39,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 380 flow
[2024-05-12 11:20:39,079 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:20:39,079 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:39,079 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:39,079 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-05-12 11:20:39,080 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:39,080 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:39,080 INFO  L85        PathProgramCache]: Analyzing trace with hash -1147647075, now seen corresponding path program 1 times
[2024-05-12 11:20:39,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:39,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135832388]
[2024-05-12 11:20:39,080 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:39,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:39,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:20:46,248 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:20:46,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:20:46,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135832388]
[2024-05-12 11:20:46,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135832388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:20:46,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:20:46,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:20:46,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139958874]
[2024-05-12 11:20:46,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:20:46,251 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:20:46,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:20:46,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:20:46,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:20:46,459 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 50
[2024-05-12 11:20:46,460 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 380 flow. Second operand  has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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:20:46,460 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:20:46,460 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 50
[2024-05-12 11:20:46,460 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:20:48,037 INFO  L124   PetriNetUnfolderBase]: 3369/5706 cut-off events.
[2024-05-12 11:20:48,038 INFO  L125   PetriNetUnfolderBase]: For 8968/8971 co-relation queries the response was YES.
[2024-05-12 11:20:48,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16279 conditions, 5706 events. 3369/5706 cut-off events. For 8968/8971 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 37112 event pairs, 1400 based on Foata normal form. 12/5517 useless extension candidates. Maximal degree in co-relation 16254. Up to 4602 conditions per place. 
[2024-05-12 11:20:48,072 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 87 selfloop transitions, 40 changer transitions 0/139 dead transitions.
[2024-05-12 11:20:48,072 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 139 transitions, 936 flow
[2024-05-12 11:20:48,073 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:20:48,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:20:48,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 211 transitions.
[2024-05-12 11:20:48,074 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6028571428571429
[2024-05-12 11:20:48,074 INFO  L175             Difference]: Start difference. First operand has 70 places, 70 transitions, 380 flow. Second operand 7 states and 211 transitions.
[2024-05-12 11:20:48,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 139 transitions, 936 flow
[2024-05-12 11:20:48,080 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 139 transitions, 883 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-05-12 11:20:48,082 INFO  L231             Difference]: Finished difference. Result has 75 places, 88 transitions, 603 flow
[2024-05-12 11:20:48,082 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=75, PETRI_TRANSITIONS=88}
[2024-05-12 11:20:48,083 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 19 predicate places.
[2024-05-12 11:20:48,083 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 88 transitions, 603 flow
[2024-05-12 11:20:48,083 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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:20:48,083 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:20:48,084 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:20:48,084 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-05-12 11:20:48,084 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:20:48,084 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:20:48,084 INFO  L85        PathProgramCache]: Analyzing trace with hash -1557568448, now seen corresponding path program 1 times
[2024-05-12 11:20:48,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:20:48,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213791864]
[2024-05-12 11:20:48,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:20:48,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:20:48,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:21:01,479 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:21:01,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:21:01,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213791864]
[2024-05-12 11:21:01,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213791864] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:21:01,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:21:01,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:21:01,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019612611]
[2024-05-12 11:21:01,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:21:01,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:21:01,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:21:01,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:21:01,482 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:21:01,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:21:01,601 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 88 transitions, 603 flow. Second operand  has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:01,601 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:21:01,601 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:21:01,601 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:21:03,713 INFO  L124   PetriNetUnfolderBase]: 3915/6570 cut-off events.
[2024-05-12 11:21:03,713 INFO  L125   PetriNetUnfolderBase]: For 15732/15732 co-relation queries the response was YES.
[2024-05-12 11:21:03,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20745 conditions, 6570 events. 3915/6570 cut-off events. For 15732/15732 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 43055 event pairs, 1649 based on Foata normal form. 2/6344 useless extension candidates. Maximal degree in co-relation 20716. Up to 5605 conditions per place. 
[2024-05-12 11:21:03,747 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 80 selfloop transitions, 14 changer transitions 0/105 dead transitions.
[2024-05-12 11:21:03,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 105 transitions, 831 flow
[2024-05-12 11:21:03,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:21:03,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:21:03,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions.
[2024-05-12 11:21:03,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.516
[2024-05-12 11:21:03,749 INFO  L175             Difference]: Start difference. First operand has 75 places, 88 transitions, 603 flow. Second operand 5 states and 129 transitions.
[2024-05-12 11:21:03,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 105 transitions, 831 flow
[2024-05-12 11:21:03,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 105 transitions, 767 flow, removed 32 selfloop flow, removed 0 redundant places.
[2024-05-12 11:21:03,761 INFO  L231             Difference]: Finished difference. Result has 80 places, 88 transitions, 579 flow
[2024-05-12 11:21:03,761 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=579, PETRI_PLACES=80, PETRI_TRANSITIONS=88}
[2024-05-12 11:21:03,762 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 24 predicate places.
[2024-05-12 11:21:03,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 88 transitions, 579 flow
[2024-05-12 11:21:03,762 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:03,762 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:21:03,762 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:21:03,762 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-05-12 11:21:03,763 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:21:03,763 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:21:03,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -1073221409, now seen corresponding path program 1 times
[2024-05-12 11:21:03,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:21:03,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849966419]
[2024-05-12 11:21:03,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:21:03,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:21:03,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:21:19,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:21:19,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:21:19,781 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849966419]
[2024-05-12 11:21:19,781 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849966419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:21:19,781 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:21:19,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:21:19,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850166707]
[2024-05-12 11:21:19,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:21:19,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:21:19,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:21:19,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:21:19,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:21:19,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:21:19,956 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 88 transitions, 579 flow. Second operand  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:19,956 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:21:19,956 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:21:19,956 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:21:22,493 INFO  L124   PetriNetUnfolderBase]: 4590/7667 cut-off events.
[2024-05-12 11:21:22,494 INFO  L125   PetriNetUnfolderBase]: For 15975/15975 co-relation queries the response was YES.
[2024-05-12 11:21:22,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22748 conditions, 7667 events. 4590/7667 cut-off events. For 15975/15975 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 50603 event pairs, 1977 based on Foata normal form. 2/7451 useless extension candidates. Maximal degree in co-relation 22715. Up to 6537 conditions per place. 
[2024-05-12 11:21:22,539 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 89 selfloop transitions, 17 changer transitions 0/116 dead transitions.
[2024-05-12 11:21:22,539 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 116 transitions, 873 flow
[2024-05-12 11:21:22,556 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:21:22,557 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:21:22,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions.
[2024-05-12 11:21:22,557 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49666666666666665
[2024-05-12 11:21:22,557 INFO  L175             Difference]: Start difference. First operand has 80 places, 88 transitions, 579 flow. Second operand 6 states and 149 transitions.
[2024-05-12 11:21:22,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 116 transitions, 873 flow
[2024-05-12 11:21:22,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 116 transitions, 834 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-05-12 11:21:22,571 INFO  L231             Difference]: Finished difference. Result has 82 places, 91 transitions, 609 flow
[2024-05-12 11:21:22,571 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=609, PETRI_PLACES=82, PETRI_TRANSITIONS=91}
[2024-05-12 11:21:22,572 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 26 predicate places.
[2024-05-12 11:21:22,572 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 91 transitions, 609 flow
[2024-05-12 11:21:22,572 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:22,572 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:21:22,572 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:21:22,572 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-05-12 11:21:22,572 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:21:22,573 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:21:22,573 INFO  L85        PathProgramCache]: Analyzing trace with hash 1083230556, now seen corresponding path program 1 times
[2024-05-12 11:21:22,573 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:21:22,573 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310848085]
[2024-05-12 11:21:22,573 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:21:22,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:21:22,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:21:34,187 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:21:34,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:21:34,187 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310848085]
[2024-05-12 11:21:34,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310848085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:21:34,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:21:34,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:21:34,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017257137]
[2024-05-12 11:21:34,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:21:34,188 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:21:34,189 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:21:34,189 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:21:34,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:21:34,345 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:21:34,346 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 91 transitions, 609 flow. Second operand  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:34,346 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:21:34,346 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:21:34,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:21:36,657 INFO  L124   PetriNetUnfolderBase]: 4357/7272 cut-off events.
[2024-05-12 11:21:36,657 INFO  L125   PetriNetUnfolderBase]: For 19470/19479 co-relation queries the response was YES.
[2024-05-12 11:21:36,675 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 7272 events. 4357/7272 cut-off events. For 19470/19479 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 47750 event pairs, 1603 based on Foata normal form. 10/7065 useless extension candidates. Maximal degree in co-relation 22958. Up to 6116 conditions per place. 
[2024-05-12 11:21:36,700 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 91 selfloop transitions, 21 changer transitions 0/124 dead transitions.
[2024-05-12 11:21:36,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 970 flow
[2024-05-12 11:21:36,701 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:21:36,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:21:36,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions.
[2024-05-12 11:21:36,702 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.54
[2024-05-12 11:21:36,702 INFO  L175             Difference]: Start difference. First operand has 82 places, 91 transitions, 609 flow. Second operand 6 states and 162 transitions.
[2024-05-12 11:21:36,702 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 970 flow
[2024-05-12 11:21:36,716 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 929 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-05-12 11:21:36,719 INFO  L231             Difference]: Finished difference. Result has 84 places, 94 transitions, 653 flow
[2024-05-12 11:21:36,719 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=653, PETRI_PLACES=84, PETRI_TRANSITIONS=94}
[2024-05-12 11:21:36,720 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 28 predicate places.
[2024-05-12 11:21:36,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 94 transitions, 653 flow
[2024-05-12 11:21:36,720 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:36,720 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:21:36,720 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:21:36,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-05-12 11:21:36,723 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:21:36,723 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:21:36,723 INFO  L85        PathProgramCache]: Analyzing trace with hash 2120337726, now seen corresponding path program 2 times
[2024-05-12 11:21:36,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:21:36,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736256560]
[2024-05-12 11:21:36,724 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:21:36,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:21:36,777 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:21:48,159 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:21:48,160 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:21:48,160 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736256560]
[2024-05-12 11:21:48,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736256560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:21:48,160 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:21:48,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:21:48,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227579745]
[2024-05-12 11:21:48,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:21:48,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:21:48,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:21:48,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:21:48,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:21:48,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:21:48,359 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 94 transitions, 653 flow. Second operand  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:48,359 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:21:48,359 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:21:48,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:21:50,717 INFO  L124   PetriNetUnfolderBase]: 4351/7396 cut-off events.
[2024-05-12 11:21:50,717 INFO  L125   PetriNetUnfolderBase]: For 21690/21690 co-relation queries the response was YES.
[2024-05-12 11:21:50,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23436 conditions, 7396 events. 4351/7396 cut-off events. For 21690/21690 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 49957 event pairs, 1813 based on Foata normal form. 2/7170 useless extension candidates. Maximal degree in co-relation 23402. Up to 6218 conditions per place. 
[2024-05-12 11:21:50,751 INFO  L140   encePairwiseOnDemand]: 40/50 looper letters, 92 selfloop transitions, 13 changer transitions 0/117 dead transitions.
[2024-05-12 11:21:50,751 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 117 transitions, 921 flow
[2024-05-12 11:21:50,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:21:50,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:21:50,752 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions.
[2024-05-12 11:21:50,752 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5066666666666667
[2024-05-12 11:21:50,752 INFO  L175             Difference]: Start difference. First operand has 84 places, 94 transitions, 653 flow. Second operand 6 states and 152 transitions.
[2024-05-12 11:21:50,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 117 transitions, 921 flow
[2024-05-12 11:21:50,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 117 transitions, 876 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-05-12 11:21:50,768 INFO  L231             Difference]: Finished difference. Result has 87 places, 94 transitions, 642 flow
[2024-05-12 11:21:50,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=87, PETRI_TRANSITIONS=94}
[2024-05-12 11:21:50,769 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 31 predicate places.
[2024-05-12 11:21:50,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 642 flow
[2024-05-12 11:21:50,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:21:50,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:21:50,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:21:50,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-05-12 11:21:50,770 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:21:50,770 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:21:50,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 1089875933, now seen corresponding path program 1 times
[2024-05-12 11:21:50,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:21:50,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132342]
[2024-05-12 11:21:50,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:21:50,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:21:50,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:22:07,114 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:22:07,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:22:07,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132342]
[2024-05-12 11:22:07,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132342] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:22:07,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:22:07,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:22:07,115 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008958815]
[2024-05-12 11:22:07,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:22:07,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:22:07,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:22:07,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:22:07,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:22:07,339 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:22:07,340 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 642 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:07,340 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:22:07,340 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:22:07,340 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:22:09,920 INFO  L124   PetriNetUnfolderBase]: 4583/7622 cut-off events.
[2024-05-12 11:22:09,920 INFO  L125   PetriNetUnfolderBase]: For 23859/23859 co-relation queries the response was YES.
[2024-05-12 11:22:09,935 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24299 conditions, 7622 events. 4583/7622 cut-off events. For 23859/23859 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 50105 event pairs, 1887 based on Foata normal form. 4/7409 useless extension candidates. Maximal degree in co-relation 24264. Up to 6489 conditions per place. 
[2024-05-12 11:22:09,955 INFO  L140   encePairwiseOnDemand]: 40/50 looper letters, 101 selfloop transitions, 20 changer transitions 0/131 dead transitions.
[2024-05-12 11:22:09,955 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 131 transitions, 994 flow
[2024-05-12 11:22:09,956 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:22:09,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:22:09,957 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions.
[2024-05-12 11:22:09,957 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49714285714285716
[2024-05-12 11:22:09,957 INFO  L175             Difference]: Start difference. First operand has 87 places, 94 transitions, 642 flow. Second operand 7 states and 174 transitions.
[2024-05-12 11:22:09,957 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 131 transitions, 994 flow
[2024-05-12 11:22:09,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 938 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-05-12 11:22:09,973 INFO  L231             Difference]: Finished difference. Result has 88 places, 97 transitions, 664 flow
[2024-05-12 11:22:09,973 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=88, PETRI_TRANSITIONS=97}
[2024-05-12 11:22:09,974 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places.
[2024-05-12 11:22:09,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 97 transitions, 664 flow
[2024-05-12 11:22:09,974 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:09,974 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:22:09,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:22:09,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-05-12 11:22:09,975 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:22:09,975 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:22:09,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 608312111, now seen corresponding path program 1 times
[2024-05-12 11:22:09,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:22:09,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617290452]
[2024-05-12 11:22:09,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:22:09,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:22:10,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:22:21,884 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:22:21,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:22:21,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617290452]
[2024-05-12 11:22:21,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617290452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:22:21,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:22:21,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:22:21,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495562292]
[2024-05-12 11:22:21,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:22:21,885 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:22:21,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:22:21,886 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:22:21,886 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:22:22,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:22:22,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 664 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:22,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:22:22,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:22:22,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:22:24,645 INFO  L124   PetriNetUnfolderBase]: 4639/7619 cut-off events.
[2024-05-12 11:22:24,645 INFO  L125   PetriNetUnfolderBase]: For 27959/27968 co-relation queries the response was YES.
[2024-05-12 11:22:24,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25570 conditions, 7619 events. 4639/7619 cut-off events. For 27959/27968 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 49118 event pairs, 1646 based on Foata normal form. 10/7412 useless extension candidates. Maximal degree in co-relation 25535. Up to 6393 conditions per place. 
[2024-05-12 11:22:24,682 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 113 selfloop transitions, 30 changer transitions 0/153 dead transitions.
[2024-05-12 11:22:24,682 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 153 transitions, 1187 flow
[2024-05-12 11:22:24,683 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:22:24,683 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:22:24,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions.
[2024-05-12 11:22:24,684 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.515
[2024-05-12 11:22:24,684 INFO  L175             Difference]: Start difference. First operand has 88 places, 97 transitions, 664 flow. Second operand 8 states and 206 transitions.
[2024-05-12 11:22:24,684 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 153 transitions, 1187 flow
[2024-05-12 11:22:24,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 153 transitions, 1130 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-05-12 11:22:24,701 INFO  L231             Difference]: Finished difference. Result has 92 places, 108 transitions, 774 flow
[2024-05-12 11:22:24,701 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=774, PETRI_PLACES=92, PETRI_TRANSITIONS=108}
[2024-05-12 11:22:24,702 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 36 predicate places.
[2024-05-12 11:22:24,702 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 108 transitions, 774 flow
[2024-05-12 11:22:24,702 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:24,702 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:22:24,703 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:22:24,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-05-12 11:22:24,703 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:22:24,703 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:22:24,703 INFO  L85        PathProgramCache]: Analyzing trace with hash 1331879449, now seen corresponding path program 2 times
[2024-05-12 11:22:24,703 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:22:24,703 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990650589]
[2024-05-12 11:22:24,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:22:24,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:22:24,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:22:36,574 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:22:36,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:22:36,574 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990650589]
[2024-05-12 11:22:36,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990650589] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:22:36,574 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:22:36,574 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:22:36,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464755184]
[2024-05-12 11:22:36,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:22:36,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:22:36,575 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:22:36,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:22:36,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:22:36,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:22:36,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 108 transitions, 774 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:36,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:22:36,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:22:36,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:22:39,312 INFO  L124   PetriNetUnfolderBase]: 4662/7797 cut-off events.
[2024-05-12 11:22:39,312 INFO  L125   PetriNetUnfolderBase]: For 34452/34452 co-relation queries the response was YES.
[2024-05-12 11:22:39,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27553 conditions, 7797 events. 4662/7797 cut-off events. For 34452/34452 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 51712 event pairs, 1863 based on Foata normal form. 2/7579 useless extension candidates. Maximal degree in co-relation 27516. Up to 6594 conditions per place. 
[2024-05-12 11:22:39,352 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 115 selfloop transitions, 22 changer transitions 0/147 dead transitions.
[2024-05-12 11:22:39,353 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 147 transitions, 1240 flow
[2024-05-12 11:22:39,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:22:39,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:22:39,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions.
[2024-05-12 11:22:39,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:22:39,355 INFO  L175             Difference]: Start difference. First operand has 92 places, 108 transitions, 774 flow. Second operand 7 states and 175 transitions.
[2024-05-12 11:22:39,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 147 transitions, 1240 flow
[2024-05-12 11:22:39,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 147 transitions, 1198 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-05-12 11:22:39,379 INFO  L231             Difference]: Finished difference. Result has 96 places, 114 transitions, 850 flow
[2024-05-12 11:22:39,379 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=850, PETRI_PLACES=96, PETRI_TRANSITIONS=114}
[2024-05-12 11:22:39,380 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places.
[2024-05-12 11:22:39,380 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 114 transitions, 850 flow
[2024-05-12 11:22:39,380 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:39,380 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:22:39,380 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:22:39,380 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-05-12 11:22:39,380 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:22:39,381 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:22:39,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 281118949, now seen corresponding path program 3 times
[2024-05-12 11:22:39,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:22:39,381 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786570282]
[2024-05-12 11:22:39,381 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:22:39,381 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:22:39,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:22:52,192 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:22:52,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:22:52,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786570282]
[2024-05-12 11:22:52,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786570282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:22:52,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:22:52,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:22:52,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310544864]
[2024-05-12 11:22:52,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:22:52,193 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:22:52,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:22:52,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:22:52,194 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:22:52,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:22:52,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 114 transitions, 850 flow. Second operand  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:52,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:22:52,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:22:52,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:22:54,973 INFO  L124   PetriNetUnfolderBase]: 4657/7794 cut-off events.
[2024-05-12 11:22:54,973 INFO  L125   PetriNetUnfolderBase]: For 38617/38617 co-relation queries the response was YES.
[2024-05-12 11:22:54,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28088 conditions, 7794 events. 4657/7794 cut-off events. For 38617/38617 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 51736 event pairs, 1865 based on Foata normal form. 2/7575 useless extension candidates. Maximal degree in co-relation 28049. Up to 6621 conditions per place. 
[2024-05-12 11:22:55,018 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 116 selfloop transitions, 17 changer transitions 0/143 dead transitions.
[2024-05-12 11:22:55,018 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 143 transitions, 1190 flow
[2024-05-12 11:22:55,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:22:55,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:22:55,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions.
[2024-05-12 11:22:55,019 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2024-05-12 11:22:55,020 INFO  L175             Difference]: Start difference. First operand has 96 places, 114 transitions, 850 flow. Second operand 7 states and 170 transitions.
[2024-05-12 11:22:55,020 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 143 transitions, 1190 flow
[2024-05-12 11:22:55,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 143 transitions, 1137 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-05-12 11:22:55,052 INFO  L231             Difference]: Finished difference. Result has 100 places, 114 transitions, 839 flow
[2024-05-12 11:22:55,052 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=839, PETRI_PLACES=100, PETRI_TRANSITIONS=114}
[2024-05-12 11:22:55,053 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 44 predicate places.
[2024-05-12 11:22:55,053 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 114 transitions, 839 flow
[2024-05-12 11:22:55,053 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:22:55,053 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:22:55,053 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:22:55,053 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-05-12 11:22:55,053 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:22:55,054 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:22:55,054 INFO  L85        PathProgramCache]: Analyzing trace with hash -1271621690, now seen corresponding path program 1 times
[2024-05-12 11:22:55,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:22:55,054 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070753664]
[2024-05-12 11:22:55,054 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:22:55,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:22:55,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:23:12,599 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:23:12,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:23:12,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070753664]
[2024-05-12 11:23:12,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070753664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:23:12,600 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:23:12,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:23:12,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835879715]
[2024-05-12 11:23:12,600 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:23:12,600 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:23:12,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:23:12,601 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:23:12,601 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:23:12,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:23:12,717 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 114 transitions, 839 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:23:12,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:23:12,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:23:12,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:23:15,683 INFO  L124   PetriNetUnfolderBase]: 5923/9717 cut-off events.
[2024-05-12 11:23:15,684 INFO  L125   PetriNetUnfolderBase]: For 53759/53771 co-relation queries the response was YES.
[2024-05-12 11:23:15,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34921 conditions, 9717 events. 5923/9717 cut-off events. For 53759/53771 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 64400 event pairs, 2502 based on Foata normal form. 1/9418 useless extension candidates. Maximal degree in co-relation 34880. Up to 8414 conditions per place. 
[2024-05-12 11:23:15,743 INFO  L140   encePairwiseOnDemand]: 43/50 looper letters, 106 selfloop transitions, 11 changer transitions 0/132 dead transitions.
[2024-05-12 11:23:15,743 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 132 transitions, 1139 flow
[2024-05-12 11:23:15,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:23:15,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:23:15,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions.
[2024-05-12 11:23:15,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.468
[2024-05-12 11:23:15,745 INFO  L175             Difference]: Start difference. First operand has 100 places, 114 transitions, 839 flow. Second operand 5 states and 117 transitions.
[2024-05-12 11:23:15,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 132 transitions, 1139 flow
[2024-05-12 11:23:15,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 132 transitions, 1097 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-05-12 11:23:15,798 INFO  L231             Difference]: Finished difference. Result has 99 places, 117 transitions, 858 flow
[2024-05-12 11:23:15,798 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=858, PETRI_PLACES=99, PETRI_TRANSITIONS=117}
[2024-05-12 11:23:15,799 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places.
[2024-05-12 11:23:15,799 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 117 transitions, 858 flow
[2024-05-12 11:23:15,799 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:23:15,799 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:23:15,799 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:23:15,799 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-05-12 11:23:15,799 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:23:15,800 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:23:15,800 INFO  L85        PathProgramCache]: Analyzing trace with hash 1598702299, now seen corresponding path program 1 times
[2024-05-12 11:23:15,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:23:15,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742953429]
[2024-05-12 11:23:15,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:23:15,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:23:15,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:23:29,913 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:23:29,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:23:29,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742953429]
[2024-05-12 11:23:29,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742953429] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:23:29,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:23:29,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:23:29,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782157004]
[2024-05-12 11:23:29,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:23:29,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:23:29,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:23:29,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:23:29,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:23:30,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:23:30,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 117 transitions, 858 flow. Second operand  has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:23:30,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:23:30,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:23:30,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:23:32,828 INFO  L124   PetriNetUnfolderBase]: 4646/7678 cut-off events.
[2024-05-12 11:23:32,828 INFO  L125   PetriNetUnfolderBase]: For 52919/52934 co-relation queries the response was YES.
[2024-05-12 11:23:32,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29954 conditions, 7678 events. 4646/7678 cut-off events. For 52919/52934 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 50484 event pairs, 1555 based on Foata normal form. 8/7454 useless extension candidates. Maximal degree in co-relation 29912. Up to 6371 conditions per place. 
[2024-05-12 11:23:32,875 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 121 selfloop transitions, 28 changer transitions 0/167 dead transitions.
[2024-05-12 11:23:32,875 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 167 transitions, 1318 flow
[2024-05-12 11:23:32,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:23:32,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:23:32,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions.
[2024-05-12 11:23:32,877 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.535
[2024-05-12 11:23:32,877 INFO  L175             Difference]: Start difference. First operand has 99 places, 117 transitions, 858 flow. Second operand 8 states and 214 transitions.
[2024-05-12 11:23:32,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 167 transitions, 1318 flow
[2024-05-12 11:23:32,907 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 167 transitions, 1283 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-05-12 11:23:32,909 INFO  L231             Difference]: Finished difference. Result has 104 places, 120 transitions, 922 flow
[2024-05-12 11:23:32,909 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=922, PETRI_PLACES=104, PETRI_TRANSITIONS=120}
[2024-05-12 11:23:32,909 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 48 predicate places.
[2024-05-12 11:23:32,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 120 transitions, 922 flow
[2024-05-12 11:23:32,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.625) internal successors, (125), 8 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:23:32,910 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:23:32,910 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:23:32,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-05-12 11:23:32,910 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:23:32,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:23:32,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 1602511734, now seen corresponding path program 1 times
[2024-05-12 11:23:32,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:23:32,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729241526]
[2024-05-12 11:23:32,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:23:32,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:23:32,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:23:45,337 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:23:45,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:23:45,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729241526]
[2024-05-12 11:23:45,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729241526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:23:45,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:23:45,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:23:45,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584352911]
[2024-05-12 11:23:45,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:23:45,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:23:45,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:23:45,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:23:45,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:23:45,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:23:45,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 120 transitions, 922 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:23:45,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:23:45,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:23:45,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:23:48,173 INFO  L124   PetriNetUnfolderBase]: 4914/7982 cut-off events.
[2024-05-12 11:23:48,173 INFO  L125   PetriNetUnfolderBase]: For 60015/60024 co-relation queries the response was YES.
[2024-05-12 11:23:48,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32373 conditions, 7982 events. 4914/7982 cut-off events. For 60015/60024 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 51297 event pairs, 1664 based on Foata normal form. 8/7753 useless extension candidates. Maximal degree in co-relation 32330. Up to 6710 conditions per place. 
[2024-05-12 11:23:48,222 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 119 selfloop transitions, 40 changer transitions 0/170 dead transitions.
[2024-05-12 11:23:48,222 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 170 transitions, 1458 flow
[2024-05-12 11:23:48,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:23:48,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:23:48,223 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 209 transitions.
[2024-05-12 11:23:48,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5225
[2024-05-12 11:23:48,224 INFO  L175             Difference]: Start difference. First operand has 104 places, 120 transitions, 922 flow. Second operand 8 states and 209 transitions.
[2024-05-12 11:23:48,224 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 170 transitions, 1458 flow
[2024-05-12 11:23:48,256 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 170 transitions, 1385 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-05-12 11:23:48,258 INFO  L231             Difference]: Finished difference. Result has 106 places, 123 transitions, 969 flow
[2024-05-12 11:23:48,258 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=106, PETRI_TRANSITIONS=123}
[2024-05-12 11:23:48,258 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places.
[2024-05-12 11:23:48,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 123 transitions, 969 flow
[2024-05-12 11:23:48,259 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:23:48,259 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:23:48,259 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:23:48,259 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-05-12 11:23:48,259 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:23:48,259 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:23:48,260 INFO  L85        PathProgramCache]: Analyzing trace with hash -110498729, now seen corresponding path program 1 times
[2024-05-12 11:23:48,260 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:23:48,260 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961554624]
[2024-05-12 11:23:48,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:23:48,260 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:23:48,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:24:01,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:24:01,453 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:24:01,453 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961554624]
[2024-05-12 11:24:01,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961554624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:24:01,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:24:01,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:24:01,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830919939]
[2024-05-12 11:24:01,453 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:24:01,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:24:01,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:24:01,454 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:24:01,454 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:24:01,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:24:01,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 123 transitions, 969 flow. Second operand  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:24:01,670 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:24:01,670 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:24:01,670 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:24:04,505 INFO  L124   PetriNetUnfolderBase]: 5041/7909 cut-off events.
[2024-05-12 11:24:04,505 INFO  L125   PetriNetUnfolderBase]: For 67430/67439 co-relation queries the response was YES.
[2024-05-12 11:24:04,525 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33441 conditions, 7909 events. 5041/7909 cut-off events. For 67430/67439 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49195 event pairs, 1480 based on Foata normal form. 14/7781 useless extension candidates. Maximal degree in co-relation 33397. Up to 6646 conditions per place. 
[2024-05-12 11:24:04,549 INFO  L140   encePairwiseOnDemand]: 36/50 looper letters, 135 selfloop transitions, 43 changer transitions 0/189 dead transitions.
[2024-05-12 11:24:04,549 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 189 transitions, 1631 flow
[2024-05-12 11:24:04,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:24:04,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:24:04,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions.
[2024-05-12 11:24:04,551 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5222222222222223
[2024-05-12 11:24:04,551 INFO  L175             Difference]: Start difference. First operand has 106 places, 123 transitions, 969 flow. Second operand 9 states and 235 transitions.
[2024-05-12 11:24:04,551 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 189 transitions, 1631 flow
[2024-05-12 11:24:04,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 189 transitions, 1523 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-05-12 11:24:04,594 INFO  L231             Difference]: Finished difference. Result has 110 places, 134 transitions, 1066 flow
[2024-05-12 11:24:04,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1066, PETRI_PLACES=110, PETRI_TRANSITIONS=134}
[2024-05-12 11:24:04,594 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 54 predicate places.
[2024-05-12 11:24:04,594 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 134 transitions, 1066 flow
[2024-05-12 11:24:04,594 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:24:04,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:24:04,595 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:24:04,595 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-05-12 11:24:04,595 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:24:04,595 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:24:04,595 INFO  L85        PathProgramCache]: Analyzing trace with hash 1602517314, now seen corresponding path program 2 times
[2024-05-12 11:24:04,596 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:24:04,596 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142499720]
[2024-05-12 11:24:04,596 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:24:04,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:24:04,639 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:24:16,733 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:24:16,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:24:16,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142499720]
[2024-05-12 11:24:16,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142499720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:24:16,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:24:16,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:24:16,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402958512]
[2024-05-12 11:24:16,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:24:16,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:24:16,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:24:16,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:24:16,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:24:16,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:24:16,905 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 134 transitions, 1066 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:24:16,905 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:24:16,906 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:24:16,906 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:24:19,725 INFO  L124   PetriNetUnfolderBase]: 5064/7949 cut-off events.
[2024-05-12 11:24:19,726 INFO  L125   PetriNetUnfolderBase]: For 76996/77005 co-relation queries the response was YES.
[2024-05-12 11:24:19,750 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35715 conditions, 7949 events. 5064/7949 cut-off events. For 76996/77005 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 49514 event pairs, 1552 based on Foata normal form. 8/7811 useless extension candidates. Maximal degree in co-relation 35669. Up to 6898 conditions per place. 
[2024-05-12 11:24:19,778 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 130 selfloop transitions, 40 changer transitions 0/181 dead transitions.
[2024-05-12 11:24:19,779 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 181 transitions, 1630 flow
[2024-05-12 11:24:19,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:24:19,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:24:19,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions.
[2024-05-12 11:24:19,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5125
[2024-05-12 11:24:19,780 INFO  L175             Difference]: Start difference. First operand has 110 places, 134 transitions, 1066 flow. Second operand 8 states and 205 transitions.
[2024-05-12 11:24:19,780 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 181 transitions, 1630 flow
[2024-05-12 11:24:19,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 181 transitions, 1573 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-05-12 11:24:19,836 INFO  L231             Difference]: Finished difference. Result has 114 places, 137 transitions, 1130 flow
[2024-05-12 11:24:19,837 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1009, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1130, PETRI_PLACES=114, PETRI_TRANSITIONS=137}
[2024-05-12 11:24:19,837 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places.
[2024-05-12 11:24:19,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 137 transitions, 1130 flow
[2024-05-12 11:24:19,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:24:19,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:24:19,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:24:19,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-05-12 11:24:19,838 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:24:19,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:24:19,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -1661408797, now seen corresponding path program 2 times
[2024-05-12 11:24:19,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:24:19,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909607928]
[2024-05-12 11:24:19,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:24:19,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:24:19,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:24:32,004 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:24:32,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:24:32,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909607928]
[2024-05-12 11:24:32,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909607928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:24:32,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:24:32,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:24:32,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315997639]
[2024-05-12 11:24:32,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:24:32,005 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:24:32,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:24:32,005 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:24:32,005 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:24:32,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:24:32,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 137 transitions, 1130 flow. Second operand  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:24:32,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:24:32,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:24:32,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:24:35,137 INFO  L124   PetriNetUnfolderBase]: 5146/8146 cut-off events.
[2024-05-12 11:24:35,138 INFO  L125   PetriNetUnfolderBase]: For 83674/83674 co-relation queries the response was YES.
[2024-05-12 11:24:35,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36621 conditions, 8146 events. 5146/8146 cut-off events. For 83674/83674 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 51573 event pairs, 1788 based on Foata normal form. 4/8001 useless extension candidates. Maximal degree in co-relation 36573. Up to 7116 conditions per place. 
[2024-05-12 11:24:35,192 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 150 selfloop transitions, 31 changer transitions 0/192 dead transitions.
[2024-05-12 11:24:35,193 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 192 transitions, 1778 flow
[2024-05-12 11:24:35,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:24:35,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:24:35,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions.
[2024-05-12 11:24:35,194 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:24:35,194 INFO  L175             Difference]: Start difference. First operand has 114 places, 137 transitions, 1130 flow. Second operand 9 states and 225 transitions.
[2024-05-12 11:24:35,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 192 transitions, 1778 flow
[2024-05-12 11:24:35,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 192 transitions, 1704 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-05-12 11:24:35,263 INFO  L231             Difference]: Finished difference. Result has 118 places, 143 transitions, 1208 flow
[2024-05-12 11:24:35,263 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1208, PETRI_PLACES=118, PETRI_TRANSITIONS=143}
[2024-05-12 11:24:35,263 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 62 predicate places.
[2024-05-12 11:24:35,263 INFO  L495      AbstractCegarLoop]: Abstraction has has 118 places, 143 transitions, 1208 flow
[2024-05-12 11:24:35,263 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:24:35,263 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:24:35,263 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:24:35,264 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-05-12 11:24:35,264 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:24:35,264 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:24:35,264 INFO  L85        PathProgramCache]: Analyzing trace with hash 124753854, now seen corresponding path program 3 times
[2024-05-12 11:24:35,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:24:35,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399093183]
[2024-05-12 11:24:35,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:24:35,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:24:35,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:24:47,924 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:24:47,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:24:47,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399093183]
[2024-05-12 11:24:47,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399093183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:24:47,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:24:47,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:24:47,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866840203]
[2024-05-12 11:24:47,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:24:47,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:24:47,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:24:47,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:24:47,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:24:48,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:24:48,115 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 143 transitions, 1208 flow. Second operand  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:24:48,115 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:24:48,115 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:24:48,115 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:24:50,969 INFO  L124   PetriNetUnfolderBase]: 5141/8144 cut-off events.
[2024-05-12 11:24:50,970 INFO  L125   PetriNetUnfolderBase]: For 91013/91022 co-relation queries the response was YES.
[2024-05-12 11:24:50,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37120 conditions, 8144 events. 5141/8144 cut-off events. For 91013/91022 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 51684 event pairs, 1798 based on Foata normal form. 8/8001 useless extension candidates. Maximal degree in co-relation 37071. Up to 7218 conditions per place. 
[2024-05-12 11:24:51,019 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 144 selfloop transitions, 19 changer transitions 0/174 dead transitions.
[2024-05-12 11:24:51,020 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 174 transitions, 1622 flow
[2024-05-12 11:24:51,020 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:24:51,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:24:51,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions.
[2024-05-12 11:24:51,021 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49142857142857144
[2024-05-12 11:24:51,021 INFO  L175             Difference]: Start difference. First operand has 118 places, 143 transitions, 1208 flow. Second operand 7 states and 172 transitions.
[2024-05-12 11:24:51,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 174 transitions, 1622 flow
[2024-05-12 11:24:51,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 174 transitions, 1556 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-05-12 11:24:51,091 INFO  L231             Difference]: Finished difference. Result has 120 places, 143 transitions, 1188 flow
[2024-05-12 11:24:51,091 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1188, PETRI_PLACES=120, PETRI_TRANSITIONS=143}
[2024-05-12 11:24:51,091 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 64 predicate places.
[2024-05-12 11:24:51,092 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 143 transitions, 1188 flow
[2024-05-12 11:24:51,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 0 states have call successors, (0), 0 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:24:51,092 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:24:51,092 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:24:51,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-05-12 11:24:51,092 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:24:51,093 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:24:51,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 1838340609, now seen corresponding path program 3 times
[2024-05-12 11:24:51,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:24:51,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333246400]
[2024-05-12 11:24:51,093 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:24:51,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:24:51,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:25:03,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:25:03,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:25:03,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333246400]
[2024-05-12 11:25:03,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333246400] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:25:03,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:25:03,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:25:03,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13724347]
[2024-05-12 11:25:03,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:25:03,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:25:03,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:25:03,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:25:03,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:25:03,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:25:03,881 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 143 transitions, 1188 flow. Second operand  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:25:03,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:25:03,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:25:03,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:25:06,788 INFO  L124   PetriNetUnfolderBase]: 5187/8212 cut-off events.
[2024-05-12 11:25:06,788 INFO  L125   PetriNetUnfolderBase]: For 95323/95323 co-relation queries the response was YES.
[2024-05-12 11:25:06,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37410 conditions, 8212 events. 5187/8212 cut-off events. For 95323/95323 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 52042 event pairs, 1792 based on Foata normal form. 4/8065 useless extension candidates. Maximal degree in co-relation 37359. Up to 7214 conditions per place. 
[2024-05-12 11:25:06,843 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 150 selfloop transitions, 26 changer transitions 0/187 dead transitions.
[2024-05-12 11:25:06,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 187 transitions, 1776 flow
[2024-05-12 11:25:06,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:25:06,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:25:06,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions.
[2024-05-12 11:25:06,845 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:25:06,845 INFO  L175             Difference]: Start difference. First operand has 120 places, 143 transitions, 1188 flow. Second operand 8 states and 200 transitions.
[2024-05-12 11:25:06,845 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 187 transitions, 1776 flow
[2024-05-12 11:25:06,916 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 187 transitions, 1705 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-05-12 11:25:06,918 INFO  L231             Difference]: Finished difference. Result has 121 places, 146 transitions, 1221 flow
[2024-05-12 11:25:06,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1221, PETRI_PLACES=121, PETRI_TRANSITIONS=146}
[2024-05-12 11:25:06,919 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 65 predicate places.
[2024-05-12 11:25:06,919 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 1221 flow
[2024-05-12 11:25:06,919 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:25:06,919 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:25:06,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:25:06,919 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-05-12 11:25:06,920 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:25:06,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:25:06,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -601218661, now seen corresponding path program 4 times
[2024-05-12 11:25:06,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:25:06,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705507318]
[2024-05-12 11:25:06,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:25:06,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:25:06,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:25:19,953 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:25:19,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:25:19,954 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705507318]
[2024-05-12 11:25:19,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705507318] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:25:19,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:25:19,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:25:19,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342971996]
[2024-05-12 11:25:19,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:25:19,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:25:19,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:25:19,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:25:19,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:25:20,180 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:25:20,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 1221 flow. Second operand  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:25:20,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:25:20,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:25:20,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:25:23,075 INFO  L124   PetriNetUnfolderBase]: 5177/8204 cut-off events.
[2024-05-12 11:25:23,075 INFO  L125   PetriNetUnfolderBase]: For 100781/100781 co-relation queries the response was YES.
[2024-05-12 11:25:23,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37589 conditions, 8204 events. 5177/8204 cut-off events. For 100781/100781 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 52043 event pairs, 1796 based on Foata normal form. 4/8055 useless extension candidates. Maximal degree in co-relation 37537. Up to 7255 conditions per place. 
[2024-05-12 11:25:23,126 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 150 selfloop transitions, 21 changer transitions 0/182 dead transitions.
[2024-05-12 11:25:23,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 182 transitions, 1657 flow
[2024-05-12 11:25:23,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:25:23,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:25:23,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions.
[2024-05-12 11:25:23,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.485
[2024-05-12 11:25:23,128 INFO  L175             Difference]: Start difference. First operand has 121 places, 146 transitions, 1221 flow. Second operand 8 states and 194 transitions.
[2024-05-12 11:25:23,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 182 transitions, 1657 flow
[2024-05-12 11:25:23,206 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 182 transitions, 1551 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-05-12 11:25:23,208 INFO  L231             Difference]: Finished difference. Result has 123 places, 146 transitions, 1165 flow
[2024-05-12 11:25:23,208 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1165, PETRI_PLACES=123, PETRI_TRANSITIONS=146}
[2024-05-12 11:25:23,208 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 67 predicate places.
[2024-05-12 11:25:23,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 146 transitions, 1165 flow
[2024-05-12 11:25:23,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:25:23,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:25:23,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:25:23,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-05-12 11:25:23,209 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:25:23,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:25:23,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -765565625, now seen corresponding path program 1 times
[2024-05-12 11:25:23,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:25:23,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804583591]
[2024-05-12 11:25:23,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:25:23,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:25:23,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:25:42,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:25:42,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:25:42,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804583591]
[2024-05-12 11:25:42,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804583591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:25:42,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:25:42,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:25:42,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46143293]
[2024-05-12 11:25:42,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:25:42,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:25:42,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:25:42,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:25:42,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:25:42,294 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:25:42,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 146 transitions, 1165 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:25:42,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:25:42,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:25:42,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:25:45,714 INFO  L124   PetriNetUnfolderBase]: 6270/9577 cut-off events.
[2024-05-12 11:25:45,715 INFO  L125   PetriNetUnfolderBase]: For 119272/119286 co-relation queries the response was YES.
[2024-05-12 11:25:45,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43218 conditions, 9577 events. 6270/9577 cut-off events. For 119272/119286 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 57867 event pairs, 2349 based on Foata normal form. 5/9438 useless extension candidates. Maximal degree in co-relation 43165. Up to 8850 conditions per place. 
[2024-05-12 11:25:45,776 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 140 selfloop transitions, 14 changer transitions 0/171 dead transitions.
[2024-05-12 11:25:45,776 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 171 transitions, 1567 flow
[2024-05-12 11:25:45,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:25:45,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:25:45,777 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-05-12 11:25:45,777 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4633333333333333
[2024-05-12 11:25:45,777 INFO  L175             Difference]: Start difference. First operand has 123 places, 146 transitions, 1165 flow. Second operand 6 states and 139 transitions.
[2024-05-12 11:25:45,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 171 transitions, 1567 flow
[2024-05-12 11:25:45,863 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 171 transitions, 1495 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-05-12 11:25:45,865 INFO  L231             Difference]: Finished difference. Result has 121 places, 149 transitions, 1163 flow
[2024-05-12 11:25:45,865 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1163, PETRI_PLACES=121, PETRI_TRANSITIONS=149}
[2024-05-12 11:25:45,865 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 65 predicate places.
[2024-05-12 11:25:45,866 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 149 transitions, 1163 flow
[2024-05-12 11:25:45,866 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:25:45,866 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:25:45,866 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:25:45,866 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-05-12 11:25:45,866 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:25:45,866 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:25:45,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -1979837984, now seen corresponding path program 1 times
[2024-05-12 11:25:45,867 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:25:45,867 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970114893]
[2024-05-12 11:25:45,867 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:25:45,867 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:25:45,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:25:59,937 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:25:59,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:25:59,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970114893]
[2024-05-12 11:25:59,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970114893] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:25:59,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:25:59,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:25:59,937 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084833980]
[2024-05-12 11:25:59,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:25:59,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:25:59,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:25:59,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:25:59,938 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:26:00,190 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:26:00,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 149 transitions, 1163 flow. Second operand  has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:26:00,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:26:00,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:26:00,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:26:03,053 INFO  L124   PetriNetUnfolderBase]: 4945/7855 cut-off events.
[2024-05-12 11:26:03,053 INFO  L125   PetriNetUnfolderBase]: For 112191/112213 co-relation queries the response was YES.
[2024-05-12 11:26:03,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37467 conditions, 7855 events. 4945/7855 cut-off events. For 112191/112213 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 49802 event pairs, 1070 based on Foata normal form. 15/7731 useless extension candidates. Maximal degree in co-relation 37414. Up to 6603 conditions per place. 
[2024-05-12 11:26:03,108 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 156 selfloop transitions, 31 changer transitions 0/207 dead transitions.
[2024-05-12 11:26:03,109 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 207 transitions, 1846 flow
[2024-05-12 11:26:03,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:26:03,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:26:03,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 216 transitions.
[2024-05-12 11:26:03,110 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.54
[2024-05-12 11:26:03,110 INFO  L175             Difference]: Start difference. First operand has 121 places, 149 transitions, 1163 flow. Second operand 8 states and 216 transitions.
[2024-05-12 11:26:03,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 207 transitions, 1846 flow
[2024-05-12 11:26:03,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 207 transitions, 1800 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-05-12 11:26:03,203 INFO  L231             Difference]: Finished difference. Result has 126 places, 156 transitions, 1274 flow
[2024-05-12 11:26:03,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1274, PETRI_PLACES=126, PETRI_TRANSITIONS=156}
[2024-05-12 11:26:03,203 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places.
[2024-05-12 11:26:03,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 156 transitions, 1274 flow
[2024-05-12 11:26:03,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:26:03,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:26:03,204 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:26:03,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-05-12 11:26:03,204 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:26:03,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:26:03,204 INFO  L85        PathProgramCache]: Analyzing trace with hash 354154000, now seen corresponding path program 1 times
[2024-05-12 11:26:03,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:26:03,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326094129]
[2024-05-12 11:26:03,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:26:03,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:26:03,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:26:15,152 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:26:15,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:26:15,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326094129]
[2024-05-12 11:26:15,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326094129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:26:15,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:26:15,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:26:15,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735831971]
[2024-05-12 11:26:15,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:26:15,153 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:26:15,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:26:15,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:26:15,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:26:15,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:26:15,381 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 156 transitions, 1274 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:26:15,381 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:26:15,381 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:26:15,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:26:18,408 INFO  L124   PetriNetUnfolderBase]: 5251/8202 cut-off events.
[2024-05-12 11:26:18,409 INFO  L125   PetriNetUnfolderBase]: For 120902/120915 co-relation queries the response was YES.
[2024-05-12 11:26:18,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39783 conditions, 8202 events. 5251/8202 cut-off events. For 120902/120915 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 50892 event pairs, 1447 based on Foata normal form. 12/8076 useless extension candidates. Maximal degree in co-relation 39728. Up to 7010 conditions per place. 
[2024-05-12 11:26:18,471 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 160 selfloop transitions, 49 changer transitions 0/220 dead transitions.
[2024-05-12 11:26:18,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 220 transitions, 2035 flow
[2024-05-12 11:26:18,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:26:18,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:26:18,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 233 transitions.
[2024-05-12 11:26:18,473 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5177777777777778
[2024-05-12 11:26:18,473 INFO  L175             Difference]: Start difference. First operand has 126 places, 156 transitions, 1274 flow. Second operand 9 states and 233 transitions.
[2024-05-12 11:26:18,473 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 220 transitions, 2035 flow
[2024-05-12 11:26:18,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 220 transitions, 1975 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-05-12 11:26:18,578 INFO  L231             Difference]: Finished difference. Result has 132 places, 165 transitions, 1423 flow
[2024-05-12 11:26:18,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1423, PETRI_PLACES=132, PETRI_TRANSITIONS=165}
[2024-05-12 11:26:18,579 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places.
[2024-05-12 11:26:18,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 165 transitions, 1423 flow
[2024-05-12 11:26:18,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:26:18,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:26:18,579 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:26:18,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-05-12 11:26:18,579 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:26:18,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:26:18,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1979835194, now seen corresponding path program 2 times
[2024-05-12 11:26:18,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:26:18,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171583363]
[2024-05-12 11:26:18,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:26:18,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:26:18,627 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:26:31,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:26:31,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:26:31,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171583363]
[2024-05-12 11:26:31,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171583363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:26:31,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:26:31,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:26:31,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825057339]
[2024-05-12 11:26:31,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:26:31,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:26:31,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:26:31,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:26:31,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:26:31,946 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:26:31,947 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 165 transitions, 1423 flow. Second operand  has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:26:31,947 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:26:31,947 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:26:31,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:26:34,894 INFO  L124   PetriNetUnfolderBase]: 5022/7740 cut-off events.
[2024-05-12 11:26:34,894 INFO  L125   PetriNetUnfolderBase]: For 131523/131538 co-relation queries the response was YES.
[2024-05-12 11:26:34,923 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39817 conditions, 7740 events. 5022/7740 cut-off events. For 131523/131538 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 47023 event pairs, 1167 based on Foata normal form. 14/7705 useless extension candidates. Maximal degree in co-relation 39759. Up to 6766 conditions per place. 
[2024-05-12 11:26:34,950 INFO  L140   encePairwiseOnDemand]: 40/50 looper letters, 151 selfloop transitions, 51 changer transitions 0/224 dead transitions.
[2024-05-12 11:26:34,950 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 224 transitions, 2125 flow
[2024-05-12 11:26:34,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:26:34,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:26:34,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 214 transitions.
[2024-05-12 11:26:34,951 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.535
[2024-05-12 11:26:34,951 INFO  L175             Difference]: Start difference. First operand has 132 places, 165 transitions, 1423 flow. Second operand 8 states and 214 transitions.
[2024-05-12 11:26:34,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 224 transitions, 2125 flow
[2024-05-12 11:26:35,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 224 transitions, 2049 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-05-12 11:26:35,060 INFO  L231             Difference]: Finished difference. Result has 136 places, 175 transitions, 1621 flow
[2024-05-12 11:26:35,061 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1621, PETRI_PLACES=136, PETRI_TRANSITIONS=175}
[2024-05-12 11:26:35,061 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 80 predicate places.
[2024-05-12 11:26:35,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 175 transitions, 1621 flow
[2024-05-12 11:26:35,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:26:35,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:26:35,061 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:26:35,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-05-12 11:26:35,062 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:26:35,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:26:35,062 INFO  L85        PathProgramCache]: Analyzing trace with hash -1977033910, now seen corresponding path program 2 times
[2024-05-12 11:26:35,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:26:35,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209739931]
[2024-05-12 11:26:35,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:26:35,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:26:35,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:26:48,486 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:26:48,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:26:48,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209739931]
[2024-05-12 11:26:48,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209739931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:26:48,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:26:48,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:26:48,487 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965957692]
[2024-05-12 11:26:48,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:26:48,487 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:26:48,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:26:48,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:26:48,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:26:48,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:26:48,797 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 175 transitions, 1621 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:26:48,797 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:26:48,797 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:26:48,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:26:51,823 INFO  L124   PetriNetUnfolderBase]: 5315/8057 cut-off events.
[2024-05-12 11:26:51,823 INFO  L125   PetriNetUnfolderBase]: For 143950/143963 co-relation queries the response was YES.
[2024-05-12 11:26:51,856 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42656 conditions, 8057 events. 5315/8057 cut-off events. For 143950/143963 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 47894 event pairs, 1230 based on Foata normal form. 12/8020 useless extension candidates. Maximal degree in co-relation 42596. Up to 7187 conditions per place. 
[2024-05-12 11:26:51,886 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 166 selfloop transitions, 67 changer transitions 0/244 dead transitions.
[2024-05-12 11:26:51,887 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 244 transitions, 2458 flow
[2024-05-12 11:26:51,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:26:51,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:26:51,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions.
[2024-05-12 11:26:51,888 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5111111111111111
[2024-05-12 11:26:51,888 INFO  L175             Difference]: Start difference. First operand has 136 places, 175 transitions, 1621 flow. Second operand 9 states and 230 transitions.
[2024-05-12 11:26:51,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 244 transitions, 2458 flow
[2024-05-12 11:26:52,032 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 244 transitions, 2336 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-05-12 11:26:52,035 INFO  L231             Difference]: Finished difference. Result has 143 places, 191 transitions, 1894 flow
[2024-05-12 11:26:52,035 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1501, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1894, PETRI_PLACES=143, PETRI_TRANSITIONS=191}
[2024-05-12 11:26:52,035 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 87 predicate places.
[2024-05-12 11:26:52,036 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 191 transitions, 1894 flow
[2024-05-12 11:26:52,036 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:26:52,036 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:26:52,036 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:26:52,036 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-05-12 11:26:52,036 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:26:52,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:26:52,037 INFO  L85        PathProgramCache]: Analyzing trace with hash -1977038684, now seen corresponding path program 3 times
[2024-05-12 11:26:52,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:26:52,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521156441]
[2024-05-12 11:26:52,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:26:52,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:26:52,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:27:05,450 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:27:05,450 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:27:05,451 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521156441]
[2024-05-12 11:27:05,451 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521156441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:27:05,451 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:27:05,451 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:27:05,451 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139084182]
[2024-05-12 11:27:05,451 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:27:05,451 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:27:05,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:27:05,451 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:27:05,452 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:27:05,662 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50
[2024-05-12 11:27:05,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 191 transitions, 1894 flow. Second operand  has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:27:05,663 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:27:05,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50
[2024-05-12 11:27:05,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:27:08,851 INFO  L124   PetriNetUnfolderBase]: 5088/8070 cut-off events.
[2024-05-12 11:27:08,851 INFO  L125   PetriNetUnfolderBase]: For 157217/157246 co-relation queries the response was YES.
[2024-05-12 11:27:08,883 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43413 conditions, 8070 events. 5088/8070 cut-off events. For 157217/157246 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 51264 event pairs, 1384 based on Foata normal form. 16/7942 useless extension candidates. Maximal degree in co-relation 43350. Up to 6952 conditions per place. 
[2024-05-12 11:27:08,914 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 184 selfloop transitions, 26 changer transitions 0/236 dead transitions.
[2024-05-12 11:27:08,914 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 236 transitions, 2450 flow
[2024-05-12 11:27:08,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:27:08,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:27:08,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions.
[2024-05-12 11:27:08,915 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.525
[2024-05-12 11:27:08,915 INFO  L175             Difference]: Start difference. First operand has 143 places, 191 transitions, 1894 flow. Second operand 8 states and 210 transitions.
[2024-05-12 11:27:08,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 236 transitions, 2450 flow
[2024-05-12 11:27:09,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 236 transitions, 2309 flow, removed 60 selfloop flow, removed 3 redundant places.
[2024-05-12 11:27:09,049 INFO  L231             Difference]: Finished difference. Result has 148 places, 191 transitions, 1812 flow
[2024-05-12 11:27:09,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1812, PETRI_PLACES=148, PETRI_TRANSITIONS=191}
[2024-05-12 11:27:09,050 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 92 predicate places.
[2024-05-12 11:27:09,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 191 transitions, 1812 flow
[2024-05-12 11:27:09,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 15.555555555555555) internal successors, (140), 9 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:27:09,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:27:09,051 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:27:09,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-05-12 11:27:09,051 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:27:09,051 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:27:09,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1977038560, now seen corresponding path program 3 times
[2024-05-12 11:27:09,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:27:09,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950831490]
[2024-05-12 11:27:09,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:27:09,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:27:09,104 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:27:22,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:27:22,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:27:22,440 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950831490]
[2024-05-12 11:27:22,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950831490] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:27:22,440 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:27:22,440 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:27:22,440 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319936548]
[2024-05-12 11:27:22,440 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:27:22,441 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:27:22,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:27:22,441 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:27:22,441 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:27:22,707 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:27:22,707 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 191 transitions, 1812 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27:22,707 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:27:22,707 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:27:22,707 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:27:25,784 INFO  L124   PetriNetUnfolderBase]: 5357/8348 cut-off events.
[2024-05-12 11:27:25,784 INFO  L125   PetriNetUnfolderBase]: For 164778/164791 co-relation queries the response was YES.
[2024-05-12 11:27:25,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45229 conditions, 8348 events. 5357/8348 cut-off events. For 164778/164791 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 51759 event pairs, 1457 based on Foata normal form. 12/8222 useless extension candidates. Maximal degree in co-relation 45164. Up to 7265 conditions per place. 
[2024-05-12 11:27:25,843 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 185 selfloop transitions, 48 changer transitions 0/244 dead transitions.
[2024-05-12 11:27:25,843 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 244 transitions, 2468 flow
[2024-05-12 11:27:25,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:27:25,844 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:27:25,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 229 transitions.
[2024-05-12 11:27:25,844 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5088888888888888
[2024-05-12 11:27:25,844 INFO  L175             Difference]: Start difference. First operand has 148 places, 191 transitions, 1812 flow. Second operand 9 states and 229 transitions.
[2024-05-12 11:27:25,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 244 transitions, 2468 flow
[2024-05-12 11:27:25,963 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 244 transitions, 2407 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-05-12 11:27:25,966 INFO  L231             Difference]: Finished difference. Result has 151 places, 194 transitions, 1903 flow
[2024-05-12 11:27:25,966 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1903, PETRI_PLACES=151, PETRI_TRANSITIONS=194}
[2024-05-12 11:27:25,967 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 95 predicate places.
[2024-05-12 11:27:25,967 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 194 transitions, 1903 flow
[2024-05-12 11:27:25,967 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27:25,967 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:27:25,968 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:27:25,968 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-05-12 11:27:25,968 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:27:25,968 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:27:25,968 INFO  L85        PathProgramCache]: Analyzing trace with hash -1861747390, now seen corresponding path program 4 times
[2024-05-12 11:27:25,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:27:25,968 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759966176]
[2024-05-12 11:27:25,968 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:27:25,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:27:26,023 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:27:40,760 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:27:40,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:27:40,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759966176]
[2024-05-12 11:27:40,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759966176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:27:40,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:27:40,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:27:40,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760603062]
[2024-05-12 11:27:40,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:27:40,762 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:27:40,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:27:40,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:27:40,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:27:40,938 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:27:40,938 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 194 transitions, 1903 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27:40,938 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:27:40,938 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:27:40,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:27:44,277 INFO  L124   PetriNetUnfolderBase]: 5380/8382 cut-off events.
[2024-05-12 11:27:44,278 INFO  L125   PetriNetUnfolderBase]: For 173881/173894 co-relation queries the response was YES.
[2024-05-12 11:27:44,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45900 conditions, 8382 events. 5380/8382 cut-off events. For 173881/173894 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 52029 event pairs, 1450 based on Foata normal form. 12/8254 useless extension candidates. Maximal degree in co-relation 45834. Up to 7254 conditions per place. 
[2024-05-12 11:27:44,347 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 199 selfloop transitions, 53 changer transitions 0/263 dead transitions.
[2024-05-12 11:27:44,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 263 transitions, 2761 flow
[2024-05-12 11:27:44,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:27:44,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:27:44,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 262 transitions.
[2024-05-12 11:27:44,349 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.524
[2024-05-12 11:27:44,349 INFO  L175             Difference]: Start difference. First operand has 151 places, 194 transitions, 1903 flow. Second operand 10 states and 262 transitions.
[2024-05-12 11:27:44,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 263 transitions, 2761 flow
[2024-05-12 11:27:44,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 263 transitions, 2647 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-05-12 11:27:44,579 INFO  L231             Difference]: Finished difference. Result has 155 places, 197 transitions, 1952 flow
[2024-05-12 11:27:44,579 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1952, PETRI_PLACES=155, PETRI_TRANSITIONS=197}
[2024-05-12 11:27:44,579 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 99 predicate places.
[2024-05-12 11:27:44,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 197 transitions, 1952 flow
[2024-05-12 11:27:44,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27:44,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:27:44,580 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:27:44,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-05-12 11:27:44,580 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:27:44,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:27:44,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 472246516, now seen corresponding path program 1 times
[2024-05-12 11:27:44,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:27:44,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112465229]
[2024-05-12 11:27:44,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:27:44,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:27:44,640 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:27:54,597 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:27:54,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:27:54,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112465229]
[2024-05-12 11:27:54,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112465229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:27:54,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:27:54,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:27:54,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626058562]
[2024-05-12 11:27:54,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:27:54,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:27:54,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:27:54,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:27:54,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:27:54,788 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:27:54,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 197 transitions, 1952 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27:54,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:27:54,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:27:54,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:27:57,804 INFO  L124   PetriNetUnfolderBase]: 5426/8466 cut-off events.
[2024-05-12 11:27:57,804 INFO  L125   PetriNetUnfolderBase]: For 184106/184119 co-relation queries the response was YES.
[2024-05-12 11:27:57,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46583 conditions, 8466 events. 5426/8466 cut-off events. For 184106/184119 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 52671 event pairs, 1400 based on Foata normal form. 10/8334 useless extension candidates. Maximal degree in co-relation 46516. Up to 7076 conditions per place. 
[2024-05-12 11:27:57,872 INFO  L140   encePairwiseOnDemand]: 36/50 looper letters, 182 selfloop transitions, 59 changer transitions 0/252 dead transitions.
[2024-05-12 11:27:57,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 252 transitions, 2746 flow
[2024-05-12 11:27:57,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:27:57,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:27:57,874 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions.
[2024-05-12 11:27:57,874 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5425
[2024-05-12 11:27:57,874 INFO  L175             Difference]: Start difference. First operand has 155 places, 197 transitions, 1952 flow. Second operand 8 states and 217 transitions.
[2024-05-12 11:27:57,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 252 transitions, 2746 flow
[2024-05-12 11:27:58,066 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 252 transitions, 2596 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-05-12 11:27:58,068 INFO  L231             Difference]: Finished difference. Result has 155 places, 200 transitions, 1966 flow
[2024-05-12 11:27:58,069 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1802, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1966, PETRI_PLACES=155, PETRI_TRANSITIONS=200}
[2024-05-12 11:27:58,069 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 99 predicate places.
[2024-05-12 11:27:58,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 200 transitions, 1966 flow
[2024-05-12 11:27:58,069 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:27:58,070 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:27:58,070 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:27:58,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-05-12 11:27:58,070 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:27:58,070 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:27:58,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -1861569760, now seen corresponding path program 5 times
[2024-05-12 11:27:58,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:27:58,070 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911910088]
[2024-05-12 11:27:58,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:27:58,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:27:58,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:28:12,900 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:28:12,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:28:12,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911910088]
[2024-05-12 11:28:12,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911910088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:28:12,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:28:12,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:28:12,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207828882]
[2024-05-12 11:28:12,901 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:28:12,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:28:12,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:28:12,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:28:12,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:28:13,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:28:13,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 200 transitions, 1966 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:28:13,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:28:13,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:28:13,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:28:16,326 INFO  L124   PetriNetUnfolderBase]: 5449/8498 cut-off events.
[2024-05-12 11:28:16,326 INFO  L125   PetriNetUnfolderBase]: For 192897/192910 co-relation queries the response was YES.
[2024-05-12 11:28:16,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47134 conditions, 8498 events. 5449/8498 cut-off events. For 192897/192910 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 52914 event pairs, 1458 based on Foata normal form. 12/8367 useless extension candidates. Maximal degree in co-relation 47066. Up to 7427 conditions per place. 
[2024-05-12 11:28:16,393 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 199 selfloop transitions, 43 changer transitions 0/253 dead transitions.
[2024-05-12 11:28:16,394 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 253 transitions, 2646 flow
[2024-05-12 11:28:16,394 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:28:16,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:28:16,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 227 transitions.
[2024-05-12 11:28:16,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5044444444444445
[2024-05-12 11:28:16,395 INFO  L175             Difference]: Start difference. First operand has 155 places, 200 transitions, 1966 flow. Second operand 9 states and 227 transitions.
[2024-05-12 11:28:16,395 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 253 transitions, 2646 flow
[2024-05-12 11:28:16,577 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 253 transitions, 2490 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-05-12 11:28:16,580 INFO  L231             Difference]: Finished difference. Result has 158 places, 203 transitions, 1958 flow
[2024-05-12 11:28:16,580 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1958, PETRI_PLACES=158, PETRI_TRANSITIONS=203}
[2024-05-12 11:28:16,580 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 102 predicate places.
[2024-05-12 11:28:16,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 203 transitions, 1958 flow
[2024-05-12 11:28:16,581 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:28:16,581 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:28:16,581 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:28:16,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-05-12 11:28:16,581 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:28:16,581 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:28:16,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -1861569574, now seen corresponding path program 2 times
[2024-05-12 11:28:16,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:28:16,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345623597]
[2024-05-12 11:28:16,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:28:16,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:28:16,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:28:28,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:28:28,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:28:28,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345623597]
[2024-05-12 11:28:28,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345623597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:28:28,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:28:28,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:28:28,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856163074]
[2024-05-12 11:28:28,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:28:28,439 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:28:28,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:28:28,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:28:28,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:28:28,618 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:28:28,619 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 203 transitions, 1958 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:28:28,619 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:28:28,619 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:28:28,619 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:28:31,628 INFO  L124   PetriNetUnfolderBase]: 5551/8627 cut-off events.
[2024-05-12 11:28:31,628 INFO  L125   PetriNetUnfolderBase]: For 204564/204577 co-relation queries the response was YES.
[2024-05-12 11:28:31,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47974 conditions, 8627 events. 5551/8627 cut-off events. For 204564/204577 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 53553 event pairs, 1403 based on Foata normal form. 10/8500 useless extension candidates. Maximal degree in co-relation 47905. Up to 7194 conditions per place. 
[2024-05-12 11:28:31,696 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 190 selfloop transitions, 60 changer transitions 0/261 dead transitions.
[2024-05-12 11:28:31,696 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 261 transitions, 2932 flow
[2024-05-12 11:28:31,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:28:31,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:28:31,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions.
[2024-05-12 11:28:31,697 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5425
[2024-05-12 11:28:31,697 INFO  L175             Difference]: Start difference. First operand has 158 places, 203 transitions, 1958 flow. Second operand 8 states and 217 transitions.
[2024-05-12 11:28:31,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 261 transitions, 2932 flow
[2024-05-12 11:28:31,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 261 transitions, 2814 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-05-12 11:28:31,863 INFO  L231             Difference]: Finished difference. Result has 159 places, 209 transitions, 2036 flow
[2024-05-12 11:28:31,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2036, PETRI_PLACES=159, PETRI_TRANSITIONS=209}
[2024-05-12 11:28:31,863 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 103 predicate places.
[2024-05-12 11:28:31,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 209 transitions, 2036 flow
[2024-05-12 11:28:31,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:28:31,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:28:31,864 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:28:31,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-05-12 11:28:31,864 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:28:31,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:28:31,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1861563064, now seen corresponding path program 3 times
[2024-05-12 11:28:31,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:28:31,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798305210]
[2024-05-12 11:28:31,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:28:31,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:28:31,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:28:44,541 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:28:44,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:28:44,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798305210]
[2024-05-12 11:28:44,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798305210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:28:44,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:28:44,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:28:44,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958788444]
[2024-05-12 11:28:44,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:28:44,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:28:44,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:28:44,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:28:44,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:28:44,789 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:28:44,789 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 209 transitions, 2036 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:28:44,789 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:28:44,789 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:28:44,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:28:47,888 INFO  L124   PetriNetUnfolderBase]: 5541/8613 cut-off events.
[2024-05-12 11:28:47,888 INFO  L125   PetriNetUnfolderBase]: For 212267/212280 co-relation queries the response was YES.
[2024-05-12 11:28:47,921 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48251 conditions, 8613 events. 5541/8613 cut-off events. For 212267/212280 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 53426 event pairs, 1391 based on Foata normal form. 14/8491 useless extension candidates. Maximal degree in co-relation 48181. Up to 7186 conditions per place. 
[2024-05-12 11:28:47,951 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 191 selfloop transitions, 62 changer transitions 0/264 dead transitions.
[2024-05-12 11:28:47,951 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 264 transitions, 2834 flow
[2024-05-12 11:28:47,952 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:28:47,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:28:47,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 235 transitions.
[2024-05-12 11:28:47,952 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5222222222222223
[2024-05-12 11:28:47,952 INFO  L175             Difference]: Start difference. First operand has 159 places, 209 transitions, 2036 flow. Second operand 9 states and 235 transitions.
[2024-05-12 11:28:47,952 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 264 transitions, 2834 flow
[2024-05-12 11:28:48,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 264 transitions, 2711 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-05-12 11:28:48,125 INFO  L231             Difference]: Finished difference. Result has 164 places, 209 transitions, 2046 flow
[2024-05-12 11:28:48,125 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2046, PETRI_PLACES=164, PETRI_TRANSITIONS=209}
[2024-05-12 11:28:48,125 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 108 predicate places.
[2024-05-12 11:28:48,126 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 209 transitions, 2046 flow
[2024-05-12 11:28:48,126 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:28:48,126 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:28:48,126 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:28:48,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-05-12 11:28:48,126 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:28:48,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:28:48,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 442278038, now seen corresponding path program 1 times
[2024-05-12 11:28:48,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:28:48,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148785310]
[2024-05-12 11:28:48,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:28:48,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:28:48,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:29:05,283 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:29:05,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:29:05,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148785310]
[2024-05-12 11:29:05,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148785310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:29:05,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:29:05,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:29:05,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495484779]
[2024-05-12 11:29:05,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:29:05,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:29:05,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:29:05,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:29:05,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:29:05,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:29:05,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 209 transitions, 2046 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:29:05,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:29:05,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:29:05,404 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:29:08,804 INFO  L124   PetriNetUnfolderBase]: 6760/10336 cut-off events.
[2024-05-12 11:29:08,804 INFO  L125   PetriNetUnfolderBase]: For 252142/252156 co-relation queries the response was YES.
[2024-05-12 11:29:08,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55985 conditions, 10336 events. 6760/10336 cut-off events. For 252142/252156 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 63524 event pairs, 2045 based on Foata normal form. 3/10150 useless extension candidates. Maximal degree in co-relation 55914. Up to 9475 conditions per place. 
[2024-05-12 11:29:08,896 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 201 selfloop transitions, 18 changer transitions 0/245 dead transitions.
[2024-05-12 11:29:08,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 245 transitions, 2722 flow
[2024-05-12 11:29:08,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:29:08,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:29:08,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-05-12 11:29:08,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48333333333333334
[2024-05-12 11:29:08,897 INFO  L175             Difference]: Start difference. First operand has 164 places, 209 transitions, 2046 flow. Second operand 6 states and 145 transitions.
[2024-05-12 11:29:08,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 245 transitions, 2722 flow
[2024-05-12 11:29:09,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 245 transitions, 2589 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-05-12 11:29:09,094 INFO  L231             Difference]: Finished difference. Result has 163 places, 219 transitions, 2071 flow
[2024-05-12 11:29:09,094 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2071, PETRI_PLACES=163, PETRI_TRANSITIONS=219}
[2024-05-12 11:29:09,095 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 107 predicate places.
[2024-05-12 11:29:09,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 219 transitions, 2071 flow
[2024-05-12 11:29:09,095 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:29:09,095 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:29:09,095 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:29:09,095 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-05-12 11:29:09,095 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:29:09,096 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:29:09,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -1457908280, now seen corresponding path program 4 times
[2024-05-12 11:29:09,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:29:09,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283728601]
[2024-05-12 11:29:09,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:29:09,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:29:09,141 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:29:21,798 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:29:21,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:29:21,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283728601]
[2024-05-12 11:29:21,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283728601] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:29:21,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:29:21,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:29:21,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473056585]
[2024-05-12 11:29:21,798 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:29:21,798 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:29:21,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:29:21,799 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:29:21,799 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:29:22,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:29:22,048 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 219 transitions, 2071 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:29:22,048 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:29:22,048 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:29:22,048 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:29:25,349 INFO  L124   PetriNetUnfolderBase]: 5688/8921 cut-off events.
[2024-05-12 11:29:25,349 INFO  L125   PetriNetUnfolderBase]: For 238832/238861 co-relation queries the response was YES.
[2024-05-12 11:29:25,390 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50486 conditions, 8921 events. 5688/8921 cut-off events. For 238832/238861 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 56417 event pairs, 1750 based on Foata normal form. 10/8770 useless extension candidates. Maximal degree in co-relation 50413. Up to 7909 conditions per place. 
[2024-05-12 11:29:25,426 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 224 selfloop transitions, 23 changer transitions 0/261 dead transitions.
[2024-05-12 11:29:25,426 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 261 transitions, 2716 flow
[2024-05-12 11:29:25,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:29:25,427 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:29:25,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions.
[2024-05-12 11:29:25,427 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4925
[2024-05-12 11:29:25,427 INFO  L175             Difference]: Start difference. First operand has 163 places, 219 transitions, 2071 flow. Second operand 8 states and 197 transitions.
[2024-05-12 11:29:25,427 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 261 transitions, 2716 flow
[2024-05-12 11:29:25,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 261 transitions, 2678 flow, removed 18 selfloop flow, removed 1 redundant places.
[2024-05-12 11:29:25,668 INFO  L231             Difference]: Finished difference. Result has 170 places, 222 transitions, 2130 flow
[2024-05-12 11:29:25,669 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2130, PETRI_PLACES=170, PETRI_TRANSITIONS=222}
[2024-05-12 11:29:25,669 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 114 predicate places.
[2024-05-12 11:29:25,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 222 transitions, 2130 flow
[2024-05-12 11:29:25,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:29:25,669 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:29:25,669 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:29:25,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-05-12 11:29:25,670 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:29:25,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:29:25,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 1153985058, now seen corresponding path program 5 times
[2024-05-12 11:29:25,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:29:25,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088655451]
[2024-05-12 11:29:25,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:29:25,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:29:25,713 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:29:37,576 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:29:37,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:29:37,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088655451]
[2024-05-12 11:29:37,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088655451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:29:37,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:29:37,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:29:37,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145803341]
[2024-05-12 11:29:37,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:29:37,577 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:29:37,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:29:37,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:29:37,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:29:37,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:29:37,770 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 222 transitions, 2130 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:29:37,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:29:37,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:29:37,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:29:41,172 INFO  L124   PetriNetUnfolderBase]: 5734/8988 cut-off events.
[2024-05-12 11:29:41,172 INFO  L125   PetriNetUnfolderBase]: For 250953/250978 co-relation queries the response was YES.
[2024-05-12 11:29:41,214 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51298 conditions, 8988 events. 5734/8988 cut-off events. For 250953/250978 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 56845 event pairs, 1744 based on Foata normal form. 10/8839 useless extension candidates. Maximal degree in co-relation 51222. Up to 7824 conditions per place. 
[2024-05-12 11:29:41,248 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 220 selfloop transitions, 35 changer transitions 0/269 dead transitions.
[2024-05-12 11:29:41,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 269 transitions, 2957 flow
[2024-05-12 11:29:41,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:29:41,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:29:41,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 205 transitions.
[2024-05-12 11:29:41,249 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5125
[2024-05-12 11:29:41,249 INFO  L175             Difference]: Start difference. First operand has 170 places, 222 transitions, 2130 flow. Second operand 8 states and 205 transitions.
[2024-05-12 11:29:41,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 269 transitions, 2957 flow
[2024-05-12 11:29:41,519 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 269 transitions, 2893 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-05-12 11:29:41,522 INFO  L231             Difference]: Finished difference. Result has 172 places, 225 transitions, 2187 flow
[2024-05-12 11:29:41,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2187, PETRI_PLACES=172, PETRI_TRANSITIONS=225}
[2024-05-12 11:29:41,523 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 116 predicate places.
[2024-05-12 11:29:41,523 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 225 transitions, 2187 flow
[2024-05-12 11:29:41,523 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:29:41,523 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:29:41,523 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:29:41,523 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-05-12 11:29:41,523 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:29:41,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:29:41,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 1153978548, now seen corresponding path program 6 times
[2024-05-12 11:29:41,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:29:41,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823330887]
[2024-05-12 11:29:41,524 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:29:41,524 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:29:41,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:29:53,303 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:29:53,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:29:53,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823330887]
[2024-05-12 11:29:53,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823330887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:29:53,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:29:53,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:29:53,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785845662]
[2024-05-12 11:29:53,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:29:53,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:29:53,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:29:53,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:29:53,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:29:53,518 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:29:53,519 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 225 transitions, 2187 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:29:53,519 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:29:53,519 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:29:53,519 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:29:56,736 INFO  L124   PetriNetUnfolderBase]: 5724/8968 cut-off events.
[2024-05-12 11:29:56,737 INFO  L125   PetriNetUnfolderBase]: For 258731/258756 co-relation queries the response was YES.
[2024-05-12 11:29:56,781 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51424 conditions, 8968 events. 5724/8968 cut-off events. For 258731/258756 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 56624 event pairs, 1731 based on Foata normal form. 10/8820 useless extension candidates. Maximal degree in co-relation 51347. Up to 7816 conditions per place. 
[2024-05-12 11:29:56,819 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 217 selfloop transitions, 36 changer transitions 0/267 dead transitions.
[2024-05-12 11:29:56,819 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 267 transitions, 2825 flow
[2024-05-12 11:29:56,819 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:29:56,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:29:56,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions.
[2024-05-12 11:29:56,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.505
[2024-05-12 11:29:56,820 INFO  L175             Difference]: Start difference. First operand has 172 places, 225 transitions, 2187 flow. Second operand 8 states and 202 transitions.
[2024-05-12 11:29:56,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 267 transitions, 2825 flow
[2024-05-12 11:29:57,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 267 transitions, 2682 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-05-12 11:29:57,103 INFO  L231             Difference]: Finished difference. Result has 174 places, 225 transitions, 2124 flow
[2024-05-12 11:29:57,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2124, PETRI_PLACES=174, PETRI_TRANSITIONS=225}
[2024-05-12 11:29:57,104 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 118 predicate places.
[2024-05-12 11:29:57,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 225 transitions, 2124 flow
[2024-05-12 11:29:57,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:29:57,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:29:57,104 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:29:57,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-05-12 11:29:57,104 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:29:57,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:29:57,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 1153978362, now seen corresponding path program 6 times
[2024-05-12 11:29:57,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:29:57,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309209064]
[2024-05-12 11:29:57,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:29:57,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:29:57,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:30:11,456 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:30:11,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:30:11,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309209064]
[2024-05-12 11:30:11,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309209064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:30:11,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:30:11,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:30:11,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783182669]
[2024-05-12 11:30:11,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:30:11,456 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:30:11,457 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:30:11,457 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:30:11,457 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:30:11,677 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:30:11,678 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 225 transitions, 2124 flow. Second operand  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:30:11,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:30:11,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:30:11,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:30:15,300 INFO  L124   PetriNetUnfolderBase]: 5719/8982 cut-off events.
[2024-05-12 11:30:15,300 INFO  L125   PetriNetUnfolderBase]: For 265016/265041 co-relation queries the response was YES.
[2024-05-12 11:30:15,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51319 conditions, 8982 events. 5719/8982 cut-off events. For 265016/265041 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 56836 event pairs, 1757 based on Foata normal form. 8/8826 useless extension candidates. Maximal degree in co-relation 51241. Up to 7991 conditions per place. 
[2024-05-12 11:30:15,376 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 228 selfloop transitions, 22 changer transitions 0/264 dead transitions.
[2024-05-12 11:30:15,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 264 transitions, 2744 flow
[2024-05-12 11:30:15,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:30:15,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:30:15,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 196 transitions.
[2024-05-12 11:30:15,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49
[2024-05-12 11:30:15,377 INFO  L175             Difference]: Start difference. First operand has 174 places, 225 transitions, 2124 flow. Second operand 8 states and 196 transitions.
[2024-05-12 11:30:15,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 264 transitions, 2744 flow
[2024-05-12 11:30:15,665 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 264 transitions, 2603 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-05-12 11:30:15,668 INFO  L231             Difference]: Finished difference. Result has 174 places, 225 transitions, 2035 flow
[2024-05-12 11:30:15,668 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1983, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2035, PETRI_PLACES=174, PETRI_TRANSITIONS=225}
[2024-05-12 11:30:15,668 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 118 predicate places.
[2024-05-12 11:30:15,668 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 225 transitions, 2035 flow
[2024-05-12 11:30:15,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 0 states have call successors, (0), 0 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:30:15,669 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:30:15,669 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:30:15,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-05-12 11:30:15,669 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:30:15,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:30:15,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 2037253700, now seen corresponding path program 2 times
[2024-05-12 11:30:15,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:30:15,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099191276]
[2024-05-12 11:30:15,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:30:15,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:30:15,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:30:33,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:30:33,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:30:33,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099191276]
[2024-05-12 11:30:33,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099191276] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:30:33,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:30:33,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:30:33,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210310835]
[2024-05-12 11:30:33,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:30:33,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:30:33,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:30:33,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:30:33,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:30:33,380 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:30:33,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 225 transitions, 2035 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:30:33,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:30:33,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:30:33,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:30:37,074 INFO  L124   PetriNetUnfolderBase]: 6871/10620 cut-off events.
[2024-05-12 11:30:37,074 INFO  L125   PetriNetUnfolderBase]: For 305951/305971 co-relation queries the response was YES.
[2024-05-12 11:30:37,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57595 conditions, 10620 events. 6871/10620 cut-off events. For 305951/305971 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 66428 event pairs, 2369 based on Foata normal form. 5/10433 useless extension candidates. Maximal degree in co-relation 57516. Up to 9673 conditions per place. 
[2024-05-12 11:30:37,174 INFO  L140   encePairwiseOnDemand]: 41/50 looper letters, 203 selfloop transitions, 13 changer transitions 0/242 dead transitions.
[2024-05-12 11:30:37,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 242 transitions, 2515 flow
[2024-05-12 11:30:37,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:30:37,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:30:37,175 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions.
[2024-05-12 11:30:37,175 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-05-12 11:30:37,175 INFO  L175             Difference]: Start difference. First operand has 174 places, 225 transitions, 2035 flow. Second operand 6 states and 135 transitions.
[2024-05-12 11:30:37,175 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 242 transitions, 2515 flow
[2024-05-12 11:30:37,495 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 242 transitions, 2430 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-05-12 11:30:37,498 INFO  L231             Difference]: Finished difference. Result has 173 places, 225 transitions, 1982 flow
[2024-05-12 11:30:37,498 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1950, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1982, PETRI_PLACES=173, PETRI_TRANSITIONS=225}
[2024-05-12 11:30:37,498 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 117 predicate places.
[2024-05-12 11:30:37,498 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 225 transitions, 1982 flow
[2024-05-12 11:30:37,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:30:37,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:30:37,499 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:30:37,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-05-12 11:30:37,499 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:30:37,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:30:37,499 INFO  L85        PathProgramCache]: Analyzing trace with hash 873357243, now seen corresponding path program 1 times
[2024-05-12 11:30:37,499 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:30:37,499 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282121057]
[2024-05-12 11:30:37,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:30:37,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:30:37,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:30:56,923 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:30:56,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:30:56,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282121057]
[2024-05-12 11:30:56,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282121057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:30:56,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:30:56,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:30:56,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446769967]
[2024-05-12 11:30:56,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:30:56,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:30:56,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:30:56,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:30:56,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:30:57,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:30:57,088 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 225 transitions, 1982 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:30:57,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:30:57,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:30:57,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:31:00,849 INFO  L124   PetriNetUnfolderBase]: 6888/10651 cut-off events.
[2024-05-12 11:31:00,849 INFO  L125   PetriNetUnfolderBase]: For 317966/317986 co-relation queries the response was YES.
[2024-05-12 11:31:00,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57863 conditions, 10651 events. 6888/10651 cut-off events. For 317966/317986 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 66598 event pairs, 2351 based on Foata normal form. 5/10462 useless extension candidates. Maximal degree in co-relation 57783. Up to 9659 conditions per place. 
[2024-05-12 11:31:00,946 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 205 selfloop transitions, 24 changer transitions 0/255 dead transitions.
[2024-05-12 11:31:00,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 255 transitions, 2662 flow
[2024-05-12 11:31:00,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:31:00,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:31:00,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions.
[2024-05-12 11:31:00,949 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4766666666666667
[2024-05-12 11:31:00,949 INFO  L175             Difference]: Start difference. First operand has 173 places, 225 transitions, 1982 flow. Second operand 6 states and 143 transitions.
[2024-05-12 11:31:00,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 255 transitions, 2662 flow
[2024-05-12 11:31:01,286 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 255 transitions, 2613 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-05-12 11:31:01,289 INFO  L231             Difference]: Finished difference. Result has 174 places, 231 transitions, 2062 flow
[2024-05-12 11:31:01,290 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2062, PETRI_PLACES=174, PETRI_TRANSITIONS=231}
[2024-05-12 11:31:01,290 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 118 predicate places.
[2024-05-12 11:31:01,290 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 231 transitions, 2062 flow
[2024-05-12 11:31:01,290 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:31:01,290 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:31:01,290 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:31:01,290 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-05-12 11:31:01,290 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:31:01,291 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:31:01,291 INFO  L85        PathProgramCache]: Analyzing trace with hash 2075691003, now seen corresponding path program 2 times
[2024-05-12 11:31:01,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:31:01,291 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556592347]
[2024-05-12 11:31:01,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:31:01,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:31:01,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:31:21,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:31:21,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:31:21,403 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556592347]
[2024-05-12 11:31:21,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556592347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:31:21,403 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:31:21,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:31:21,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186096017]
[2024-05-12 11:31:21,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:31:21,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:31:21,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:31:21,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:31:21,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:31:21,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:31:21,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 231 transitions, 2062 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:31:21,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:31:21,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:31:21,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:31:25,483 INFO  L124   PetriNetUnfolderBase]: 6885/10648 cut-off events.
[2024-05-12 11:31:25,483 INFO  L125   PetriNetUnfolderBase]: For 331405/331434 co-relation queries the response was YES.
[2024-05-12 11:31:25,531 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58631 conditions, 10648 events. 6885/10648 cut-off events. For 331405/331434 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 66647 event pairs, 2350 based on Foata normal form. 11/10464 useless extension candidates. Maximal degree in co-relation 58551. Up to 9656 conditions per place. 
[2024-05-12 11:31:25,571 INFO  L140   encePairwiseOnDemand]: 42/50 looper letters, 201 selfloop transitions, 24 changer transitions 0/251 dead transitions.
[2024-05-12 11:31:25,571 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 251 transitions, 2576 flow
[2024-05-12 11:31:25,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:31:25,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:31:25,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-05-12 11:31:25,572 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4633333333333333
[2024-05-12 11:31:25,573 INFO  L175             Difference]: Start difference. First operand has 174 places, 231 transitions, 2062 flow. Second operand 6 states and 139 transitions.
[2024-05-12 11:31:25,573 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 251 transitions, 2576 flow
[2024-05-12 11:31:25,914 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 251 transitions, 2515 flow, removed 24 selfloop flow, removed 2 redundant places.
[2024-05-12 11:31:25,917 INFO  L231             Difference]: Finished difference. Result has 178 places, 231 transitions, 2056 flow
[2024-05-12 11:31:25,918 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2056, PETRI_PLACES=178, PETRI_TRANSITIONS=231}
[2024-05-12 11:31:25,918 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 122 predicate places.
[2024-05-12 11:31:25,918 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 231 transitions, 2056 flow
[2024-05-12 11:31:25,918 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:31:25,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:31:25,918 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:31:25,918 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-05-12 11:31:25,918 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:31:25,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:31:25,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 1163490619, now seen corresponding path program 1 times
[2024-05-12 11:31:25,919 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:31:25,919 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526703493]
[2024-05-12 11:31:25,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:31:25,919 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:31:25,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:31:44,302 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:31:44,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:31:44,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526703493]
[2024-05-12 11:31:44,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526703493] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:31:44,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:31:44,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:31:44,302 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750372523]
[2024-05-12 11:31:44,302 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:31:44,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:31:44,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:31:44,303 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:31:44,303 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:31:44,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50
[2024-05-12 11:31:44,524 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 231 transitions, 2056 flow. Second operand  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:31:44,525 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:31:44,525 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50
[2024-05-12 11:31:44,525 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:31:48,505 INFO  L124   PetriNetUnfolderBase]: 6691/10399 cut-off events.
[2024-05-12 11:31:48,505 INFO  L125   PetriNetUnfolderBase]: For 342618/342658 co-relation queries the response was YES.
[2024-05-12 11:31:48,561 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57929 conditions, 10399 events. 6691/10399 cut-off events. For 342618/342658 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 65338 event pairs, 2070 based on Foata normal form. 4/10191 useless extension candidates. Maximal degree in co-relation 57847. Up to 9282 conditions per place. 
[2024-05-12 11:31:48,601 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 241 selfloop transitions, 32 changer transitions 0/288 dead transitions.
[2024-05-12 11:31:48,602 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 288 transitions, 2816 flow
[2024-05-12 11:31:48,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:31:48,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:31:48,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions.
[2024-05-12 11:31:48,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47555555555555556
[2024-05-12 11:31:48,603 INFO  L175             Difference]: Start difference. First operand has 178 places, 231 transitions, 2056 flow. Second operand 9 states and 214 transitions.
[2024-05-12 11:31:48,603 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 288 transitions, 2816 flow
[2024-05-12 11:31:48,993 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 288 transitions, 2741 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-05-12 11:31:48,996 INFO  L231             Difference]: Finished difference. Result has 182 places, 238 transitions, 2139 flow
[2024-05-12 11:31:48,997 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1981, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2139, PETRI_PLACES=182, PETRI_TRANSITIONS=238}
[2024-05-12 11:31:48,997 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 126 predicate places.
[2024-05-12 11:31:48,997 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 238 transitions, 2139 flow
[2024-05-12 11:31:49,000 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 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:31:49,000 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:31:49,001 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:31:49,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-05-12 11:31:49,001 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:31:49,001 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:31:49,001 INFO  L85        PathProgramCache]: Analyzing trace with hash -1908004469, now seen corresponding path program 1 times
[2024-05-12 11:31:49,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:31:49,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713153098]
[2024-05-12 11:31:49,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:31:49,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:31:49,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:32:04,307 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:32:04,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:32:04,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713153098]
[2024-05-12 11:32:04,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713153098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:32:04,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:32:04,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:32:04,308 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082330968]
[2024-05-12 11:32:04,308 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:32:04,308 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:32:04,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:32:04,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:32:04,309 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:32:04,627 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:32:04,627 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 238 transitions, 2139 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:32:04,627 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:32:04,627 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:32:04,627 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:32:08,534 INFO  L124   PetriNetUnfolderBase]: 6345/9647 cut-off events.
[2024-05-12 11:32:08,534 INFO  L125   PetriNetUnfolderBase]: For 350906/350939 co-relation queries the response was YES.
[2024-05-12 11:32:08,586 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56946 conditions, 9647 events. 6345/9647 cut-off events. For 350906/350939 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 58517 event pairs, 1110 based on Foata normal form. 10/9566 useless extension candidates. Maximal degree in co-relation 56863. Up to 7964 conditions per place. 
[2024-05-12 11:32:08,624 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 198 selfloop transitions, 102 changer transitions 0/317 dead transitions.
[2024-05-12 11:32:08,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 317 transitions, 3297 flow
[2024-05-12 11:32:08,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:32:08,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:32:08,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions.
[2024-05-12 11:32:08,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.522
[2024-05-12 11:32:08,625 INFO  L175             Difference]: Start difference. First operand has 182 places, 238 transitions, 2139 flow. Second operand 10 states and 261 transitions.
[2024-05-12 11:32:08,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 317 transitions, 3297 flow
[2024-05-12 11:32:09,036 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 317 transitions, 3200 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-05-12 11:32:09,039 INFO  L231             Difference]: Finished difference. Result has 188 places, 247 transitions, 2476 flow
[2024-05-12 11:32:09,039 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2476, PETRI_PLACES=188, PETRI_TRANSITIONS=247}
[2024-05-12 11:32:09,040 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 132 predicate places.
[2024-05-12 11:32:09,040 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 247 transitions, 2476 flow
[2024-05-12 11:32:09,040 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:32:09,040 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:32:09,040 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:32:09,040 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-05-12 11:32:09,040 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:32:09,041 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:32:09,041 INFO  L85        PathProgramCache]: Analyzing trace with hash -1245347657, now seen corresponding path program 2 times
[2024-05-12 11:32:09,041 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:32:09,041 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102853333]
[2024-05-12 11:32:09,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:32:09,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:32:09,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:32:23,670 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:32:23,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:32:23,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102853333]
[2024-05-12 11:32:23,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102853333] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:32:23,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:32:23,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:32:23,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088323017]
[2024-05-12 11:32:23,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:32:23,671 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:32:23,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:32:23,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:32:23,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:32:24,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:32:24,069 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 247 transitions, 2476 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:32:24,069 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:32:24,069 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:32:24,069 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:32:28,107 INFO  L124   PetriNetUnfolderBase]: 6433/9777 cut-off events.
[2024-05-12 11:32:28,107 INFO  L125   PetriNetUnfolderBase]: For 376486/376519 co-relation queries the response was YES.
[2024-05-12 11:32:28,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59875 conditions, 9777 events. 6433/9777 cut-off events. For 376486/376519 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 59405 event pairs, 1416 based on Foata normal form. 10/9696 useless extension candidates. Maximal degree in co-relation 59789. Up to 8388 conditions per place. 
[2024-05-12 11:32:28,205 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 205 selfloop transitions, 100 changer transitions 0/322 dead transitions.
[2024-05-12 11:32:28,206 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 322 transitions, 3607 flow
[2024-05-12 11:32:28,206 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:32:28,206 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:32:28,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 261 transitions.
[2024-05-12 11:32:28,207 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.522
[2024-05-12 11:32:28,207 INFO  L175             Difference]: Start difference. First operand has 188 places, 247 transitions, 2476 flow. Second operand 10 states and 261 transitions.
[2024-05-12 11:32:28,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 322 transitions, 3607 flow
[2024-05-12 11:32:28,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 322 transitions, 3423 flow, removed 62 selfloop flow, removed 4 redundant places.
[2024-05-12 11:32:28,690 INFO  L231             Difference]: Finished difference. Result has 194 places, 254 transitions, 2641 flow
[2024-05-12 11:32:28,690 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2641, PETRI_PLACES=194, PETRI_TRANSITIONS=254}
[2024-05-12 11:32:28,691 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 138 predicate places.
[2024-05-12 11:32:28,691 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 254 transitions, 2641 flow
[2024-05-12 11:32:28,691 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:32:28,691 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:32:28,691 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:32:28,692 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-05-12 11:32:28,692 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:32:28,692 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:32:28,692 INFO  L85        PathProgramCache]: Analyzing trace with hash -1245343937, now seen corresponding path program 3 times
[2024-05-12 11:32:28,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:32:28,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015490286]
[2024-05-12 11:32:28,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:32:28,693 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:32:28,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:32:43,393 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:32:43,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:32:43,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015490286]
[2024-05-12 11:32:43,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015490286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:32:43,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:32:43,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:32:43,394 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213741126]
[2024-05-12 11:32:43,394 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:32:43,394 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:32:43,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:32:43,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:32:43,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:32:43,760 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:32:43,760 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 254 transitions, 2641 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:32:43,760 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:32:43,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:32:43,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:32:47,727 INFO  L124   PetriNetUnfolderBase]: 6425/9765 cut-off events.
[2024-05-12 11:32:47,727 INFO  L125   PetriNetUnfolderBase]: For 386101/386134 co-relation queries the response was YES.
[2024-05-12 11:32:47,777 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60111 conditions, 9765 events. 6425/9765 cut-off events. For 386101/386134 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 59293 event pairs, 1423 based on Foata normal form. 10/9684 useless extension candidates. Maximal degree in co-relation 60023. Up to 8469 conditions per place. 
[2024-05-12 11:32:47,817 INFO  L140   encePairwiseOnDemand]: 39/50 looper letters, 206 selfloop transitions, 96 changer transitions 0/319 dead transitions.
[2024-05-12 11:32:47,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 319 transitions, 3459 flow
[2024-05-12 11:32:47,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:32:47,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:32:47,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 257 transitions.
[2024-05-12 11:32:47,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.514
[2024-05-12 11:32:47,819 INFO  L175             Difference]: Start difference. First operand has 194 places, 254 transitions, 2641 flow. Second operand 10 states and 257 transitions.
[2024-05-12 11:32:47,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 319 transitions, 3459 flow
[2024-05-12 11:32:48,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 319 transitions, 3298 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-05-12 11:32:48,297 INFO  L231             Difference]: Finished difference. Result has 199 places, 254 transitions, 2680 flow
[2024-05-12 11:32:48,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2480, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2680, PETRI_PLACES=199, PETRI_TRANSITIONS=254}
[2024-05-12 11:32:48,298 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 143 predicate places.
[2024-05-12 11:32:48,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 254 transitions, 2680 flow
[2024-05-12 11:32:48,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:32:48,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:32:48,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:32:48,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-05-12 11:32:48,298 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:32:48,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:32:48,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -1245343782, now seen corresponding path program 1 times
[2024-05-12 11:32:48,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:32:48,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887900590]
[2024-05-12 11:32:48,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:32:48,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:32:48,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:33:02,707 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:33:02,707 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:33:02,707 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887900590]
[2024-05-12 11:33:02,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887900590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:33:02,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:33:02,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:33:02,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847799416]
[2024-05-12 11:33:02,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:33:02,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:33:02,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:33:02,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:33:02,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:33:03,021 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:33:03,022 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 254 transitions, 2680 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:33:03,022 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:33:03,022 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:33:03,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:33:07,012 INFO  L124   PetriNetUnfolderBase]: 6478/9899 cut-off events.
[2024-05-12 11:33:07,013 INFO  L125   PetriNetUnfolderBase]: For 401170/401203 co-relation queries the response was YES.
[2024-05-12 11:33:07,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61265 conditions, 9899 events. 6478/9899 cut-off events. For 401170/401203 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 60940 event pairs, 1272 based on Foata normal form. 10/9800 useless extension candidates. Maximal degree in co-relation 61175. Up to 7797 conditions per place. 
[2024-05-12 11:33:07,116 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 197 selfloop transitions, 122 changer transitions 0/336 dead transitions.
[2024-05-12 11:33:07,116 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 336 transitions, 4054 flow
[2024-05-12 11:33:07,117 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:33:07,117 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:33:07,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 268 transitions.
[2024-05-12 11:33:07,117 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.536
[2024-05-12 11:33:07,117 INFO  L175             Difference]: Start difference. First operand has 199 places, 254 transitions, 2680 flow. Second operand 10 states and 268 transitions.
[2024-05-12 11:33:07,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 336 transitions, 4054 flow
[2024-05-12 11:33:07,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 336 transitions, 3838 flow, removed 7 selfloop flow, removed 9 redundant places.
[2024-05-12 11:33:07,513 INFO  L231             Difference]: Finished difference. Result has 201 places, 263 transitions, 2934 flow
[2024-05-12 11:33:07,514 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2934, PETRI_PLACES=201, PETRI_TRANSITIONS=263}
[2024-05-12 11:33:07,514 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 145 predicate places.
[2024-05-12 11:33:07,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 263 transitions, 2934 flow
[2024-05-12 11:33:07,514 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:33:07,514 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:33:07,514 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:33:07,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-05-12 11:33:07,514 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:33:07,515 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:33:07,515 INFO  L85        PathProgramCache]: Analyzing trace with hash -1158502242, now seen corresponding path program 2 times
[2024-05-12 11:33:07,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:33:07,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270972277]
[2024-05-12 11:33:07,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:33:07,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:33:07,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:33:21,912 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:33:21,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:33:21,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270972277]
[2024-05-12 11:33:21,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270972277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:33:21,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:33:21,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:33:21,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521954381]
[2024-05-12 11:33:21,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:33:21,913 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:33:21,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:33:21,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:33:21,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:33:22,094 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:33:22,095 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 263 transitions, 2934 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:33:22,095 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:33:22,095 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:33:22,095 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:33:26,185 INFO  L124   PetriNetUnfolderBase]: 6549/10236 cut-off events.
[2024-05-12 11:33:26,186 INFO  L125   PetriNetUnfolderBase]: For 423633/423674 co-relation queries the response was YES.
[2024-05-12 11:33:26,244 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64441 conditions, 10236 events. 6549/10236 cut-off events. For 423633/423674 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 65330 event pairs, 1547 based on Foata normal form. 10/10045 useless extension candidates. Maximal degree in co-relation 64349. Up to 8458 conditions per place. 
[2024-05-12 11:33:26,286 INFO  L140   encePairwiseOnDemand]: 35/50 looper letters, 239 selfloop transitions, 71 changer transitions 0/327 dead transitions.
[2024-05-12 11:33:26,286 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 327 transitions, 3806 flow
[2024-05-12 11:33:26,287 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:33:26,287 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:33:26,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 258 transitions.
[2024-05-12 11:33:26,288 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.516
[2024-05-12 11:33:26,288 INFO  L175             Difference]: Start difference. First operand has 201 places, 263 transitions, 2934 flow. Second operand 10 states and 258 transitions.
[2024-05-12 11:33:26,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 327 transitions, 3806 flow
[2024-05-12 11:33:26,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 327 transitions, 3708 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-05-12 11:33:26,826 INFO  L231             Difference]: Finished difference. Result has 206 places, 266 transitions, 3048 flow
[2024-05-12 11:33:26,826 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2840, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3048, PETRI_PLACES=206, PETRI_TRANSITIONS=266}
[2024-05-12 11:33:26,826 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 150 predicate places.
[2024-05-12 11:33:26,827 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 266 transitions, 3048 flow
[2024-05-12 11:33:26,827 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:33:26,827 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:33:26,827 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:33:26,827 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-05-12 11:33:26,827 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:33:26,828 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:33:26,828 INFO  L85        PathProgramCache]: Analyzing trace with hash -1158507977, now seen corresponding path program 4 times
[2024-05-12 11:33:26,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:33:26,828 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327509706]
[2024-05-12 11:33:26,828 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:33:26,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:33:26,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:33:40,966 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:33:40,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:33:40,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327509706]
[2024-05-12 11:33:40,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327509706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:33:40,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:33:40,966 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:33:40,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946038991]
[2024-05-12 11:33:40,966 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:33:40,966 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:33:40,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:33:40,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:33:40,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:33:41,217 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:33:41,217 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 266 transitions, 3048 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:33:41,217 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:33:41,217 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:33:41,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:33:45,415 INFO  L124   PetriNetUnfolderBase]: 6563/10043 cut-off events.
[2024-05-12 11:33:45,415 INFO  L125   PetriNetUnfolderBase]: For 438414/438447 co-relation queries the response was YES.
[2024-05-12 11:33:45,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64851 conditions, 10043 events. 6563/10043 cut-off events. For 438414/438447 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 61602 event pairs, 1363 based on Foata normal form. 6/9925 useless extension candidates. Maximal degree in co-relation 64757. Up to 8854 conditions per place. 
[2024-05-12 11:33:45,517 INFO  L140   encePairwiseOnDemand]: 38/50 looper letters, 239 selfloop transitions, 67 changer transitions 0/323 dead transitions.
[2024-05-12 11:33:45,517 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 323 transitions, 3884 flow
[2024-05-12 11:33:45,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:33:45,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:33:45,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions.
[2024-05-12 11:33:45,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5133333333333333
[2024-05-12 11:33:45,518 INFO  L175             Difference]: Start difference. First operand has 206 places, 266 transitions, 3048 flow. Second operand 9 states and 231 transitions.
[2024-05-12 11:33:45,518 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 323 transitions, 3884 flow
[2024-05-12 11:33:46,189 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 323 transitions, 3706 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-05-12 11:33:46,193 INFO  L231             Difference]: Finished difference. Result has 207 places, 268 transitions, 3050 flow
[2024-05-12 11:33:46,193 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=2870, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3050, PETRI_PLACES=207, PETRI_TRANSITIONS=268}
[2024-05-12 11:33:46,193 INFO  L281   CegarLoopForPetriNet]: 56 programPoint places, 151 predicate places.
[2024-05-12 11:33:46,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 268 transitions, 3050 flow
[2024-05-12 11:33:46,194 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:33:46,194 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:33:46,194 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:33:46,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-05-12 11:33:46,194 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:33:46,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:33:46,195 INFO  L85        PathProgramCache]: Analyzing trace with hash -1158507822, now seen corresponding path program 3 times
[2024-05-12 11:33:46,195 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:33:46,195 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35287514]
[2024-05-12 11:33:46,195 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:33:46,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:33:46,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:34:00,936 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:34:00,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:34:00,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35287514]
[2024-05-12 11:34:00,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35287514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:34:00,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:34:00,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:34:00,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189899438]
[2024-05-12 11:34:00,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:34:00,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:34:00,937 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:34:00,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:34:00,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:34:01,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50
[2024-05-12 11:34:01,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 268 transitions, 3050 flow. Second operand  has 10 states, 10 states have (on average 14.5) internal successors, (145), 10 states have internal predecessors, (145), 0 states have call successors, (0), 0 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:34:01,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:34:01,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50
[2024-05-12 11:34:01,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:34:05,448 INFO  L124   PetriNetUnfolderBase]: 6632/10111 cut-off events.
[2024-05-12 11:34:05,448 INFO  L125   PetriNetUnfolderBase]: For 454442/454475 co-relation queries the response was YES.
[2024-05-12 11:34:05,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65477 conditions, 10111 events. 6632/10111 cut-off events. For 454442/454475 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 62234 event pairs, 1294 based on Foata normal form. 10/10020 useless extension candidates. Maximal degree in co-relation 65382. Up to 8366 conditions per place. 
[2024-05-12 11:34:05,562 INFO  L140   encePairwiseOnDemand]: 37/50 looper letters, 220 selfloop transitions, 110 changer transitions 0/347 dead transitions.
[2024-05-12 11:34:05,562 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 347 transitions, 4319 flow
[2024-05-12 11:34:05,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:34:05,563 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:34:05,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 265 transitions.
[2024-05-12 11:34:05,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.53
[2024-05-12 11:34:05,564 INFO  L175             Difference]: Start difference. First operand has 207 places, 268 transitions, 3050 flow. Second operand 10 states and 265 transitions.
[2024-05-12 11:34:05,564 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 347 transitions, 4319 flow
Killed by 15