./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix015.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
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/mix015.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 14:37:19,192 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:37:19,256 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:37:19,261 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:37:19,261 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:37:19,284 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:37:19,285 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:37:19,285 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:37:19,286 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:37:19,292 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 14:37:19,292 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:37:19,293 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:37:19,293 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:37:19,293 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 14:37:19,294 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 14:37:19,294 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:37:19,294 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:37:19,294 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 14:37:19,294 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 14:37:19,294 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 14:37:19,295 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 14:37:19,295 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:37:19,295 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:37:19,296 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:37:19,296 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 14:37:19,296 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 14:37:19,296 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 14:37:19,297 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 14:37:19,297 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:37:19,297 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 14:37:19,298 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:37:19,298 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 14:37:19,299 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:37:19,299 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:37:19,299 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:37:19,299 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:37:19,299 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 14:37:19,300 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:37:19,300 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:37:19,300 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:37:19,300 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:37:19,301 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:37:19,301 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:37:19,301 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 14:37:19,517 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:37:19,548 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:37:19,550 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:37:19,551 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:37:19,552 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 14:37:19,552 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix015.opt.yml/witness.yml
[2024-06-14 14:37:19,740 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 14:37:19,740 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 14:37:19,741 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.opt.i
[2024-06-14 14:37:20,723 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:37:21,034 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 14:37:21,035 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.opt.i
[2024-06-14 14:37:21,046 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d05278c/bbba2dcc6a164c43b178f7984b9ff1b5/FLAGc6c13922f
[2024-06-14 14:37:21,057 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9d05278c/bbba2dcc6a164c43b178f7984b9ff1b5
[2024-06-14 14:37:21,057 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:37:21,058 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:37:21,059 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:37:21,059 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:37:21,062 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:37:21,063 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:37:19" (1/2) ...
[2024-06-14 14:37:21,064 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77fac8d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:21, skipping insertion in model container
[2024-06-14 14:37:21,064 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:37:19" (1/2) ...
[2024-06-14 14:37:21,065 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e672516 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:37:21, skipping insertion in model container
[2024-06-14 14:37:21,065 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:37:21" (2/2) ...
[2024-06-14 14:37:21,065 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77fac8d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21, skipping insertion in model container
[2024-06-14 14:37:21,065 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:37:21" (2/2) ...
[2024-06-14 14:37:21,066 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:37:21,151 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:37:21,152 INFO  L97    edCorrectnessWitness]: Location invariant before [L858-L858] ((((((((((((((((((((((! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )x) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)
[2024-06-14 14:37:21,153 INFO  L97    edCorrectnessWitness]: Location invariant before [L859-L859] ((((((((((((((((((((((! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )x) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)
[2024-06-14 14:37:21,154 INFO  L97    edCorrectnessWitness]: Location invariant before [L856-L856] ((((((((((((((((((((((! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p2_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )x) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)
[2024-06-14 14:37:21,154 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:37:21,155 INFO  L106   edCorrectnessWitness]: ghost_update [L854-L854] multithreaded = 1;
[2024-06-14 14:37:21,195 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:37:21,515 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:37:21,524 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 14:37:21,955 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:37:21,992 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 14:37:21,992 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21 WrapperNode
[2024-06-14 14:37:21,992 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:37:21,994 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:37:21,994 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:37:21,994 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:37:21,999 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,039 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,152 INFO  L138                Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151
[2024-06-14 14:37:22,152 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:37:22,153 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:37:22,153 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:37:22,153 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:37:22,162 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,162 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,193 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,253 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 14:37:22,253 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,253 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,299 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,302 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,324 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,331 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,367 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:37:22,368 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:37:22,368 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:37:22,369 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:37:22,369 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (1/1) ...
[2024-06-14 14:37:22,373 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:37:22,381 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:37:22,393 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 14:37:22,412 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 14:37:22,423 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:37:22,424 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:37:22,424 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:37:22,424 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:37:22,424 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:37:22,424 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:37:22,425 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 14:37:22,425 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 14:37:22,425 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:37:22,425 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:37:22,425 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:37:22,426 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:37:22,427 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 14:37:22,553 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 14:37:22,555 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:37:24,093 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:37:24,095 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 14:37:24,519 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:37:24,519 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:37:24,520 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:37:24 BoogieIcfgContainer
[2024-06-14 14:37:24,521 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:37:24,523 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:37:24,523 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:37:24,525 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:37:24,525 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:37:19" (1/4) ...
[2024-06-14 14:37:24,527 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d3a0c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:37:24, skipping insertion in model container
[2024-06-14 14:37:24,527 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:37:21" (2/4) ...
[2024-06-14 14:37:24,528 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d3a0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:37:24, skipping insertion in model container
[2024-06-14 14:37:24,528 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:37:21" (3/4) ...
[2024-06-14 14:37:24,528 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d3a0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:37:24, skipping insertion in model container
[2024-06-14 14:37:24,528 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:37:24" (4/4) ...
[2024-06-14 14:37:24,529 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix015.opt.i
[2024-06-14 14:37:24,542 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:37:24,543 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 14:37:24,543 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:37:24,661 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:37:24,698 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow
[2024-06-14 14:37:24,779 INFO  L124   PetriNetUnfolderBase]: 0/41 cut-off events.
[2024-06-14 14:37:24,779 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:37:24,782 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 14:37:24,782 INFO  L82        GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow
[2024-06-14 14:37:24,786 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow
[2024-06-14 14:37:24,799 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:37:24,807 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;@2ca698da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:37:24,807 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 14:37:24,839 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:37:24,839 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 14:37:24,840 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:37:24,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:24,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:24,841 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:37:24,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:24,845 INFO  L85        PathProgramCache]: Analyzing trace with hash -408876045, now seen corresponding path program 1 times
[2024-06-14 14:37:24,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:24,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265841329]
[2024-06-14 14:37:24,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:24,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:25,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:37:32,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:37:32,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:37:32,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265841329]
[2024-06-14 14:37:32,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265841329] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:37:32,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:37:32,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:37:32,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436901022]
[2024-06-14 14:37:32,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:37:32,411 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:37:32,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:37:32,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:37:32,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:37:32,542 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44
[2024-06-14 14:37:32,544 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:32,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:37:32,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44
[2024-06-14 14:37:32,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:37:33,502 INFO  L124   PetriNetUnfolderBase]: 1116/1773 cut-off events.
[2024-06-14 14:37:33,503 INFO  L125   PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES.
[2024-06-14 14:37:33,508 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3526 conditions, 1773 events. 1116/1773 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9247 event pairs, 765 based on Foata normal form. 1/1693 useless extension candidates. Maximal degree in co-relation 3511. Up to 1676 conditions per place. 
[2024-06-14 14:37:33,516 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 33 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-06-14 14:37:33,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 179 flow
[2024-06-14 14:37:33,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 14:37:33,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:37:33,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2024-06-14 14:37:33,525 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6212121212121212
[2024-06-14 14:37:33,526 INFO  L175             Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 82 transitions.
[2024-06-14 14:37:33,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 179 flow
[2024-06-14 14:37:33,529 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 14:37:33,530 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow
[2024-06-14 14:37:33,532 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-14 14:37:33,534 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places.
[2024-06-14 14:37:33,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow
[2024-06-14 14:37:33,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:33,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:33,535 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:33,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:37:33,535 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:37:33,536 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:33,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -2087833902, now seen corresponding path program 1 times
[2024-06-14 14:37:33,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:33,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006848399]
[2024-06-14 14:37:33,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:33,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:33,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:37:39,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:37:39,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:37:39,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006848399]
[2024-06-14 14:37:39,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006848399] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:37:39,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:37:39,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:37:39,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747221220]
[2024-06-14 14:37:39,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:37:39,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:37:39,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:37:39,553 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:37:39,553 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:37:39,673 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-14 14:37:39,674 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:39,674 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:37:39,674 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-14 14:37:39,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:37:40,685 INFO  L124   PetriNetUnfolderBase]: 1280/1969 cut-off events.
[2024-06-14 14:37:40,686 INFO  L125   PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES.
[2024-06-14 14:37:40,689 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4492 conditions, 1969 events. 1280/1969 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9959 event pairs, 750 based on Foata normal form. 3/1949 useless extension candidates. Maximal degree in co-relation 4477. Up to 1897 conditions per place. 
[2024-06-14 14:37:40,695 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-14 14:37:40,695 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow
[2024-06-14 14:37:40,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 14:37:40,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:37:40,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions.
[2024-06-14 14:37:40,697 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5852272727272727
[2024-06-14 14:37:40,697 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions.
[2024-06-14 14:37:40,698 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow
[2024-06-14 14:37:40,698 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:37:40,699 INFO  L231             Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow
[2024-06-14 14:37:40,699 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41}
[2024-06-14 14:37:40,700 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2024-06-14 14:37:40,700 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow
[2024-06-14 14:37:40,700 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:40,701 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:40,701 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:40,701 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:37:40,701 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:37:40,701 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:40,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -298340792, now seen corresponding path program 1 times
[2024-06-14 14:37:40,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:40,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797540815]
[2024-06-14 14:37:40,702 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:40,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:40,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:37:46,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:37:46,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:37:46,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797540815]
[2024-06-14 14:37:46,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797540815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:37:46,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:37:46,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 14:37:46,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982951915]
[2024-06-14 14:37:46,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:37:46,856 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 14:37:46,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:37:46,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 14:37:46,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-14 14:37:46,977 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:37:46,977 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:46,977 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:37:46,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:37:46,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:37:48,244 INFO  L124   PetriNetUnfolderBase]: 1558/2372 cut-off events.
[2024-06-14 14:37:48,245 INFO  L125   PetriNetUnfolderBase]: For 1303/1303 co-relation queries the response was YES.
[2024-06-14 14:37:48,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5990 conditions, 2372 events. 1558/2372 cut-off events. For 1303/1303 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11847 event pairs, 839 based on Foata normal form. 3/2362 useless extension candidates. Maximal degree in co-relation 5973. Up to 2286 conditions per place. 
[2024-06-14 14:37:48,257 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 10 changer transitions 0/65 dead transitions.
[2024-06-14 14:37:48,257 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 328 flow
[2024-06-14 14:37:48,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:37:48,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:37:48,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions.
[2024-06-14 14:37:48,272 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5545454545454546
[2024-06-14 14:37:48,273 INFO  L175             Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 122 transitions.
[2024-06-14 14:37:48,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 328 flow
[2024-06-14 14:37:48,275 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 314 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 14:37:48,277 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 178 flow
[2024-06-14 14:37:48,277 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-06-14 14:37:48,278 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places.
[2024-06-14 14:37:48,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow
[2024-06-14 14:37:48,278 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:48,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:48,279 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:48,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:37:48,279 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:37:48,279 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:48,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -658629199, now seen corresponding path program 1 times
[2024-06-14 14:37:48,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:48,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461370119]
[2024-06-14 14:37:48,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:48,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:48,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:37:54,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:37:54,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:37:54,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461370119]
[2024-06-14 14:37:54,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461370119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:37:54,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:37:54,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:37:54,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380392087]
[2024-06-14 14:37:54,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:37:54,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:37:54,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:37:54,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:37:54,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:37:54,489 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:37:54,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:54,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:37:54,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:37:54,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:37:55,802 INFO  L124   PetriNetUnfolderBase]: 1552/2376 cut-off events.
[2024-06-14 14:37:55,803 INFO  L125   PetriNetUnfolderBase]: For 2422/2422 co-relation queries the response was YES.
[2024-06-14 14:37:55,806 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6564 conditions, 2376 events. 1552/2376 cut-off events. For 2422/2422 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11950 event pairs, 697 based on Foata normal form. 3/2373 useless extension candidates. Maximal degree in co-relation 6546. Up to 2262 conditions per place. 
[2024-06-14 14:37:55,840 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 56 selfloop transitions, 13 changer transitions 0/75 dead transitions.
[2024-06-14 14:37:55,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 406 flow
[2024-06-14 14:37:55,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:37:55,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:37:55,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions.
[2024-06-14 14:37:55,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5454545454545454
[2024-06-14 14:37:55,842 INFO  L175             Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 6 states and 144 transitions.
[2024-06-14 14:37:55,843 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 406 flow
[2024-06-14 14:37:55,844 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 382 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:37:55,845 INFO  L231             Difference]: Finished difference. Result has 54 places, 47 transitions, 214 flow
[2024-06-14 14:37:55,845 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=47}
[2024-06-14 14:37:55,846 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places.
[2024-06-14 14:37:55,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 214 flow
[2024-06-14 14:37:55,846 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:37:55,846 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:37:55,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:37:55,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:37:55,847 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:37:55,847 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:37:55,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 848621293, now seen corresponding path program 1 times
[2024-06-14 14:37:55,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:37:55,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66323209]
[2024-06-14 14:37:55,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:37:55,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:37:55,892 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:38:10,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:38:10,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:38:10,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66323209]
[2024-06-14 14:38:10,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66323209] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:38:10,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:38:10,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:38:10,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857946780]
[2024-06-14 14:38:10,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:38:10,043 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:38:10,043 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:38:10,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:38:10,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:38:10,229 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:38:10,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 214 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:10,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:38:10,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:38:10,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:38:11,592 INFO  L124   PetriNetUnfolderBase]: 1495/2423 cut-off events.
[2024-06-14 14:38:11,592 INFO  L125   PetriNetUnfolderBase]: For 3673/3673 co-relation queries the response was YES.
[2024-06-14 14:38:11,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7040 conditions, 2423 events. 1495/2423 cut-off events. For 3673/3673 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12825 event pairs, 734 based on Foata normal form. 4/2418 useless extension candidates. Maximal degree in co-relation 7021. Up to 2212 conditions per place. 
[2024-06-14 14:38:11,605 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 46 selfloop transitions, 8 changer transitions 0/62 dead transitions.
[2024-06-14 14:38:11,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 368 flow
[2024-06-14 14:38:11,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:38:11,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:38:11,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions.
[2024-06-14 14:38:11,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4909090909090909
[2024-06-14 14:38:11,607 INFO  L175             Difference]: Start difference. First operand has 54 places, 47 transitions, 214 flow. Second operand 5 states and 108 transitions.
[2024-06-14 14:38:11,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 368 flow
[2024-06-14 14:38:11,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 334 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 14:38:11,609 INFO  L231             Difference]: Finished difference. Result has 55 places, 50 transitions, 226 flow
[2024-06-14 14:38:11,610 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=55, PETRI_TRANSITIONS=50}
[2024-06-14 14:38:11,610 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places.
[2024-06-14 14:38:11,610 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 226 flow
[2024-06-14 14:38:11,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:11,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:38:11,611 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:38:11,611 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:38:11,611 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:38:11,611 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:38:11,612 INFO  L85        PathProgramCache]: Analyzing trace with hash -1629841760, now seen corresponding path program 1 times
[2024-06-14 14:38:11,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:38:11,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024494914]
[2024-06-14 14:38:11,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:38:11,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:38:11,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:38:21,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:38:21,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:38:21,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024494914]
[2024-06-14 14:38:21,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024494914] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:38:21,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:38:21,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:38:21,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692427859]
[2024-06-14 14:38:21,468 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:38:21,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:38:21,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:38:21,469 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:38:21,469 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:38:21,625 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:38:21,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 226 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:21,626 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:38:21,627 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:38:21,627 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:38:23,258 INFO  L124   PetriNetUnfolderBase]: 1746/2689 cut-off events.
[2024-06-14 14:38:23,258 INFO  L125   PetriNetUnfolderBase]: For 5952/5952 co-relation queries the response was YES.
[2024-06-14 14:38:23,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8556 conditions, 2689 events. 1746/2689 cut-off events. For 5952/5952 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13492 event pairs, 828 based on Foata normal form. 4/2689 useless extension candidates. Maximal degree in co-relation 8535. Up to 2516 conditions per place. 
[2024-06-14 14:38:23,270 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 56 selfloop transitions, 16 changer transitions 0/79 dead transitions.
[2024-06-14 14:38:23,270 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 486 flow
[2024-06-14 14:38:23,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:38:23,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:38:23,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions.
[2024-06-14 14:38:23,272 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4962121212121212
[2024-06-14 14:38:23,272 INFO  L175             Difference]: Start difference. First operand has 55 places, 50 transitions, 226 flow. Second operand 6 states and 131 transitions.
[2024-06-14 14:38:23,272 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 486 flow
[2024-06-14 14:38:23,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 464 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-14 14:38:23,275 INFO  L231             Difference]: Finished difference. Result has 58 places, 56 transitions, 290 flow
[2024-06-14 14:38:23,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=290, PETRI_PLACES=58, PETRI_TRANSITIONS=56}
[2024-06-14 14:38:23,275 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places.
[2024-06-14 14:38:23,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 290 flow
[2024-06-14 14:38:23,276 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:23,276 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:38:23,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:38:23,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:38:23,276 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:38:23,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:38:23,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 540390830, now seen corresponding path program 2 times
[2024-06-14 14:38:23,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:38:23,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373315273]
[2024-06-14 14:38:23,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:38:23,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:38:23,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:38:38,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:38:38,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:38:38,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373315273]
[2024-06-14 14:38:38,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373315273] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:38:38,767 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:38:38,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:38:38,768 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638342074]
[2024-06-14 14:38:38,768 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:38:38,768 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:38:38,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:38:38,769 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:38:38,769 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:38:38,949 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:38:38,950 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 290 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:38,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:38:38,950 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:38:38,950 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:38:40,390 INFO  L124   PetriNetUnfolderBase]: 1736/2677 cut-off events.
[2024-06-14 14:38:40,390 INFO  L125   PetriNetUnfolderBase]: For 8114/8126 co-relation queries the response was YES.
[2024-06-14 14:38:40,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9146 conditions, 2677 events. 1736/2677 cut-off events. For 8114/8126 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13466 event pairs, 827 based on Foata normal form. 14/2688 useless extension candidates. Maximal degree in co-relation 9124. Up to 2508 conditions per place. 
[2024-06-14 14:38:40,402 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 50 selfloop transitions, 16 changer transitions 0/73 dead transitions.
[2024-06-14 14:38:40,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 464 flow
[2024-06-14 14:38:40,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:38:40,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:38:40,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions.
[2024-06-14 14:38:40,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4734848484848485
[2024-06-14 14:38:40,404 INFO  L175             Difference]: Start difference. First operand has 58 places, 56 transitions, 290 flow. Second operand 6 states and 125 transitions.
[2024-06-14 14:38:40,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 464 flow
[2024-06-14 14:38:40,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 432 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-14 14:38:40,408 INFO  L231             Difference]: Finished difference. Result has 62 places, 56 transitions, 298 flow
[2024-06-14 14:38:40,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=62, PETRI_TRANSITIONS=56}
[2024-06-14 14:38:40,409 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places.
[2024-06-14 14:38:40,409 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 298 flow
[2024-06-14 14:38:40,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:40,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:38:40,410 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:38:40,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:38:40,410 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:38:40,410 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:38:40,410 INFO  L85        PathProgramCache]: Analyzing trace with hash 1315049636, now seen corresponding path program 1 times
[2024-06-14 14:38:40,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:38:40,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764198037]
[2024-06-14 14:38:40,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:38:40,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:38:40,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:38:47,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:38:47,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:38:47,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764198037]
[2024-06-14 14:38:47,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764198037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:38:47,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:38:47,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:38:47,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468488647]
[2024-06-14 14:38:47,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:38:47,095 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:38:47,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:38:47,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:38:47,096 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:38:47,247 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:38:47,247 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 298 flow. Second operand  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:47,247 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:38:47,248 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:38:47,248 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:38:48,722 INFO  L124   PetriNetUnfolderBase]: 1823/2760 cut-off events.
[2024-06-14 14:38:48,722 INFO  L125   PetriNetUnfolderBase]: For 9787/9787 co-relation queries the response was YES.
[2024-06-14 14:38:48,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9682 conditions, 2760 events. 1823/2760 cut-off events. For 9787/9787 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13539 event pairs, 592 based on Foata normal form. 6/2764 useless extension candidates. Maximal degree in co-relation 9658. Up to 2610 conditions per place. 
[2024-06-14 14:38:48,734 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 77 selfloop transitions, 18 changer transitions 0/100 dead transitions.
[2024-06-14 14:38:48,735 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 100 transitions, 614 flow
[2024-06-14 14:38:48,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:38:48,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:38:48,737 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions.
[2024-06-14 14:38:48,738 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5028409090909091
[2024-06-14 14:38:48,738 INFO  L175             Difference]: Start difference. First operand has 62 places, 56 transitions, 298 flow. Second operand 8 states and 177 transitions.
[2024-06-14 14:38:48,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 100 transitions, 614 flow
[2024-06-14 14:38:48,743 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 100 transitions, 574 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-14 14:38:48,744 INFO  L231             Difference]: Finished difference. Result has 65 places, 60 transitions, 335 flow
[2024-06-14 14:38:48,744 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=335, PETRI_PLACES=65, PETRI_TRANSITIONS=60}
[2024-06-14 14:38:48,745 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2024-06-14 14:38:48,745 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 335 flow
[2024-06-14 14:38:48,745 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:38:48,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:38:48,746 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:38:48,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:38:48,746 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:38:48,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:38:48,746 INFO  L85        PathProgramCache]: Analyzing trace with hash 864632944, now seen corresponding path program 1 times
[2024-06-14 14:38:48,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:38:48,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443528710]
[2024-06-14 14:38:48,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:38:48,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:38:48,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:39:03,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:39:03,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:39:03,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443528710]
[2024-06-14 14:39:03,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443528710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:39:03,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:39:03,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:39:03,682 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665913321]
[2024-06-14 14:39:03,682 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:39:03,683 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:39:03,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:39:03,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:39:03,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:39:03,829 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:39:03,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 335 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:03,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:39:03,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:39:03,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:39:05,397 INFO  L124   PetriNetUnfolderBase]: 1845/2796 cut-off events.
[2024-06-14 14:39:05,397 INFO  L125   PetriNetUnfolderBase]: For 12657/12657 co-relation queries the response was YES.
[2024-06-14 14:39:05,401 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10394 conditions, 2796 events. 1845/2796 cut-off events. For 12657/12657 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13746 event pairs, 635 based on Foata normal form. 4/2796 useless extension candidates. Maximal degree in co-relation 10369. Up to 2586 conditions per place. 
[2024-06-14 14:39:05,408 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 68 selfloop transitions, 24 changer transitions 0/97 dead transitions.
[2024-06-14 14:39:05,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 97 transitions, 679 flow
[2024-06-14 14:39:05,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:39:05,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:39:05,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions.
[2024-06-14 14:39:05,410 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4772727272727273
[2024-06-14 14:39:05,410 INFO  L175             Difference]: Start difference. First operand has 65 places, 60 transitions, 335 flow. Second operand 7 states and 147 transitions.
[2024-06-14 14:39:05,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 97 transitions, 679 flow
[2024-06-14 14:39:05,415 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 97 transitions, 628 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-14 14:39:05,416 INFO  L231             Difference]: Finished difference. Result has 67 places, 66 transitions, 398 flow
[2024-06-14 14:39:05,416 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=398, PETRI_PLACES=67, PETRI_TRANSITIONS=66}
[2024-06-14 14:39:05,417 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places.
[2024-06-14 14:39:05,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 398 flow
[2024-06-14 14:39:05,417 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:05,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:39:05,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:39:05,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:39:05,417 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:39:05,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:39:05,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 864639454, now seen corresponding path program 2 times
[2024-06-14 14:39:05,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:39:05,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062889955]
[2024-06-14 14:39:05,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:39:05,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:39:05,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:39:19,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:39:19,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:39:19,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062889955]
[2024-06-14 14:39:19,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062889955] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:39:19,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:39:19,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:39:19,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607595773]
[2024-06-14 14:39:19,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:39:19,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:39:19,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:39:19,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:39:19,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:39:20,046 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:39:20,047 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 398 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:20,047 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:39:20,047 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:39:20,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:39:21,655 INFO  L124   PetriNetUnfolderBase]: 1867/2828 cut-off events.
[2024-06-14 14:39:21,655 INFO  L125   PetriNetUnfolderBase]: For 15919/15919 co-relation queries the response was YES.
[2024-06-14 14:39:21,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11133 conditions, 2828 events. 1867/2828 cut-off events. For 15919/15919 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13938 event pairs, 635 based on Foata normal form. 4/2828 useless extension candidates. Maximal degree in co-relation 11106. Up to 2605 conditions per place. 
[2024-06-14 14:39:21,666 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 66 selfloop transitions, 26 changer transitions 0/97 dead transitions.
[2024-06-14 14:39:21,666 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 718 flow
[2024-06-14 14:39:21,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:39:21,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:39:21,667 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-14 14:39:21,668 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4707792207792208
[2024-06-14 14:39:21,668 INFO  L175             Difference]: Start difference. First operand has 67 places, 66 transitions, 398 flow. Second operand 7 states and 145 transitions.
[2024-06-14 14:39:21,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 718 flow
[2024-06-14 14:39:21,674 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 672 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-14 14:39:21,675 INFO  L231             Difference]: Finished difference. Result has 71 places, 69 transitions, 444 flow
[2024-06-14 14:39:21,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=71, PETRI_TRANSITIONS=69}
[2024-06-14 14:39:21,676 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 26 predicate places.
[2024-06-14 14:39:21,676 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 444 flow
[2024-06-14 14:39:21,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:21,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:39:21,676 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:39:21,676 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:39:21,677 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:39:21,677 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:39:21,677 INFO  L85        PathProgramCache]: Analyzing trace with hash -427752004, now seen corresponding path program 3 times
[2024-06-14 14:39:21,677 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:39:21,677 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715656449]
[2024-06-14 14:39:21,677 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:39:21,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:39:21,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:39:36,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:39:36,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:39:36,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715656449]
[2024-06-14 14:39:36,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715656449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:39:36,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:39:36,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:39:36,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149760355]
[2024-06-14 14:39:36,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:39:36,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:39:36,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:39:36,976 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:39:36,976 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:39:37,133 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:39:37,133 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 444 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:37,133 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:39:37,134 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:39:37,134 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:39:39,025 INFO  L124   PetriNetUnfolderBase]: 1857/2817 cut-off events.
[2024-06-14 14:39:39,025 INFO  L125   PetriNetUnfolderBase]: For 18464/18476 co-relation queries the response was YES.
[2024-06-14 14:39:39,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11369 conditions, 2817 events. 1857/2817 cut-off events. For 18464/18476 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13806 event pairs, 646 based on Foata normal form. 11/2825 useless extension candidates. Maximal degree in co-relation 11340. Up to 2597 conditions per place. 
[2024-06-14 14:39:39,070 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 60 selfloop transitions, 26 changer transitions 0/91 dead transitions.
[2024-06-14 14:39:39,071 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 670 flow
[2024-06-14 14:39:39,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:39:39,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:39:39,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-14 14:39:39,072 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4512987012987013
[2024-06-14 14:39:39,072 INFO  L175             Difference]: Start difference. First operand has 71 places, 69 transitions, 444 flow. Second operand 7 states and 139 transitions.
[2024-06-14 14:39:39,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 670 flow
[2024-06-14 14:39:39,080 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 91 transitions, 606 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-14 14:39:39,082 INFO  L231             Difference]: Finished difference. Result has 74 places, 69 transitions, 440 flow
[2024-06-14 14:39:39,082 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=74, PETRI_TRANSITIONS=69}
[2024-06-14 14:39:39,082 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places.
[2024-06-14 14:39:39,082 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 440 flow
[2024-06-14 14:39:39,083 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:39,083 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:39:39,083 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:39:39,083 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:39:39,083 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:39:39,083 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:39:39,083 INFO  L85        PathProgramCache]: Analyzing trace with hash 1101122644, now seen corresponding path program 1 times
[2024-06-14 14:39:39,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:39:39,084 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047446766]
[2024-06-14 14:39:39,084 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:39:39,084 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:39:39,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:39:53,223 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:39:53,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:39:53,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047446766]
[2024-06-14 14:39:53,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047446766] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:39:53,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:39:53,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:39:53,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098769595]
[2024-06-14 14:39:53,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:39:53,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:39:53,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:39:53,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:39:53,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:39:53,398 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:39:53,399 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 440 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:53,399 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:39:53,399 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:39:53,399 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:39:54,769 INFO  L124   PetriNetUnfolderBase]: 1532/2459 cut-off events.
[2024-06-14 14:39:54,769 INFO  L125   PetriNetUnfolderBase]: For 17615/17615 co-relation queries the response was YES.
[2024-06-14 14:39:54,774 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 2459 events. 1532/2459 cut-off events. For 17615/17615 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12830 event pairs, 547 based on Foata normal form. 4/2440 useless extension candidates. Maximal degree in co-relation 9839. Up to 2219 conditions per place. 
[2024-06-14 14:39:54,781 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 70 selfloop transitions, 13 changer transitions 0/94 dead transitions.
[2024-06-14 14:39:54,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 699 flow
[2024-06-14 14:39:54,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:39:54,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:39:54,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-14 14:39:54,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4675324675324675
[2024-06-14 14:39:54,782 INFO  L175             Difference]: Start difference. First operand has 74 places, 69 transitions, 440 flow. Second operand 7 states and 144 transitions.
[2024-06-14 14:39:54,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 699 flow
[2024-06-14 14:39:54,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 94 transitions, 618 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 14:39:54,793 INFO  L231             Difference]: Finished difference. Result has 75 places, 74 transitions, 445 flow
[2024-06-14 14:39:54,793 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=75, PETRI_TRANSITIONS=74}
[2024-06-14 14:39:54,794 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places.
[2024-06-14 14:39:54,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 445 flow
[2024-06-14 14:39:54,794 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:39:54,794 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:39:54,795 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:39:54,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:39:54,795 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:39:54,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:39:54,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -33405023, now seen corresponding path program 1 times
[2024-06-14 14:39:54,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:39:54,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476991614]
[2024-06-14 14:39:54,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:39:54,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:39:54,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:40:10,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:40:10,370 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:40:10,370 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476991614]
[2024-06-14 14:40:10,370 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476991614] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:40:10,370 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:40:10,370 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:40:10,370 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892728216]
[2024-06-14 14:40:10,370 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:40:10,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:40:10,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:40:10,372 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:40:10,372 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:40:10,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-14 14:40:10,478 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 445 flow. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:40:10,478 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:40:10,478 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-14 14:40:10,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:40:11,614 INFO  L124   PetriNetUnfolderBase]: 1428/2353 cut-off events.
[2024-06-14 14:40:11,614 INFO  L125   PetriNetUnfolderBase]: For 19904/19904 co-relation queries the response was YES.
[2024-06-14 14:40:11,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9936 conditions, 2353 events. 1428/2353 cut-off events. For 19904/19904 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12668 event pairs, 556 based on Foata normal form. 1/2352 useless extension candidates. Maximal degree in co-relation 9904. Up to 2130 conditions per place. 
[2024-06-14 14:40:11,639 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 64 selfloop transitions, 8 changer transitions 0/85 dead transitions.
[2024-06-14 14:40:11,648 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 631 flow
[2024-06-14 14:40:11,648 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:40:11,648 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:40:11,649 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions.
[2024-06-14 14:40:11,649 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4818181818181818
[2024-06-14 14:40:11,649 INFO  L175             Difference]: Start difference. First operand has 75 places, 74 transitions, 445 flow. Second operand 5 states and 106 transitions.
[2024-06-14 14:40:11,650 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 631 flow
[2024-06-14 14:40:11,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 85 transitions, 590 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 14:40:11,671 INFO  L231             Difference]: Finished difference. Result has 76 places, 77 transitions, 454 flow
[2024-06-14 14:40:11,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=454, PETRI_PLACES=76, PETRI_TRANSITIONS=77}
[2024-06-14 14:40:11,672 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places.
[2024-06-14 14:40:11,673 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 454 flow
[2024-06-14 14:40:11,673 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:40:11,673 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:40:11,673 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:40:11,673 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:40:11,673 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:40:11,674 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:40:11,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 1379464191, now seen corresponding path program 1 times
[2024-06-14 14:40:11,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:40:11,674 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852715526]
[2024-06-14 14:40:11,674 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:40:11,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:40:11,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:40:27,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:40:27,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:40:27,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852715526]
[2024-06-14 14:40:27,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852715526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:40:27,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:40:27,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:40:27,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814175446]
[2024-06-14 14:40:27,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:40:27,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:40:27,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:40:27,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:40:27,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:40:27,933 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:40:27,934 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 454 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:40:27,934 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:40:27,934 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:40:27,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:40:29,671 INFO  L124   PetriNetUnfolderBase]: 1868/2826 cut-off events.
[2024-06-14 14:40:29,672 INFO  L125   PetriNetUnfolderBase]: For 27080/27082 co-relation queries the response was YES.
[2024-06-14 14:40:29,676 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12562 conditions, 2826 events. 1868/2826 cut-off events. For 27080/27082 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13809 event pairs, 588 based on Foata normal form. 4/2827 useless extension candidates. Maximal degree in co-relation 12529. Up to 2531 conditions per place. 
[2024-06-14 14:40:29,709 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 79 selfloop transitions, 37 changer transitions 0/121 dead transitions.
[2024-06-14 14:40:29,709 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 902 flow
[2024-06-14 14:40:29,711 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:40:29,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:40:29,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-14 14:40:29,713 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48011363636363635
[2024-06-14 14:40:29,713 INFO  L175             Difference]: Start difference. First operand has 76 places, 77 transitions, 454 flow. Second operand 8 states and 169 transitions.
[2024-06-14 14:40:29,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 902 flow
[2024-06-14 14:40:29,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 121 transitions, 874 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-14 14:40:29,728 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 578 flow
[2024-06-14 14:40:29,728 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=578, PETRI_PLACES=81, PETRI_TRANSITIONS=83}
[2024-06-14 14:40:29,729 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places.
[2024-06-14 14:40:29,729 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 578 flow
[2024-06-14 14:40:29,729 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:40:29,729 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:40:29,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:40:29,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:40:29,730 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:40:29,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:40:29,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 1379613921, now seen corresponding path program 2 times
[2024-06-14 14:40:29,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:40:29,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732823941]
[2024-06-14 14:40:29,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:40:29,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:40:29,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:40:45,297 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:40:45,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:40:45,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732823941]
[2024-06-14 14:40:45,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732823941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:40:45,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:40:45,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:40:45,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381278763]
[2024-06-14 14:40:45,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:40:45,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:40:45,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:40:45,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:40:45,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:40:45,459 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:40:45,460 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 578 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:40:45,460 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:40:45,460 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:40:45,460 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:40:47,286 INFO  L124   PetriNetUnfolderBase]: 1890/2858 cut-off events.
[2024-06-14 14:40:47,287 INFO  L125   PetriNetUnfolderBase]: For 31658/31660 co-relation queries the response was YES.
[2024-06-14 14:40:47,291 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13459 conditions, 2858 events. 1890/2858 cut-off events. For 31658/31660 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14013 event pairs, 588 based on Foata normal form. 4/2859 useless extension candidates. Maximal degree in co-relation 13425. Up to 2550 conditions per place. 
[2024-06-14 14:40:47,299 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 78 selfloop transitions, 38 changer transitions 0/121 dead transitions.
[2024-06-14 14:40:47,299 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 121 transitions, 996 flow
[2024-06-14 14:40:47,301 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:40:47,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:40:47,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-14 14:40:47,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4744318181818182
[2024-06-14 14:40:47,302 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 578 flow. Second operand 8 states and 167 transitions.
[2024-06-14 14:40:47,302 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 121 transitions, 996 flow
[2024-06-14 14:40:47,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 121 transitions, 917 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-14 14:40:47,324 INFO  L231             Difference]: Finished difference. Result has 85 places, 86 transitions, 621 flow
[2024-06-14 14:40:47,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=621, PETRI_PLACES=85, PETRI_TRANSITIONS=86}
[2024-06-14 14:40:47,325 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places.
[2024-06-14 14:40:47,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 621 flow
[2024-06-14 14:40:47,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:40:47,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:40:47,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:40:47,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:40:47,326 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:40:47,327 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:40:47,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 1034020779, now seen corresponding path program 3 times
[2024-06-14 14:40:47,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:40:47,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715492693]
[2024-06-14 14:40:47,327 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:40:47,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:40:47,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:41:03,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:41:03,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:41:03,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715492693]
[2024-06-14 14:41:03,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715492693] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:41:03,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:41:03,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:41:03,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489868604]
[2024-06-14 14:41:03,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:41:03,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:41:03,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:41:03,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:41:03,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:41:03,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:41:03,910 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 621 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:41:03,910 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:41:03,910 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:41:03,910 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:41:05,598 INFO  L124   PetriNetUnfolderBase]: 1912/2890 cut-off events.
[2024-06-14 14:41:05,599 INFO  L125   PetriNetUnfolderBase]: For 35264/35266 co-relation queries the response was YES.
[2024-06-14 14:41:05,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13829 conditions, 2890 events. 1912/2890 cut-off events. For 35264/35266 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14130 event pairs, 593 based on Foata normal form. 4/2891 useless extension candidates. Maximal degree in co-relation 13793. Up to 2569 conditions per place. 
[2024-06-14 14:41:05,612 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 76 selfloop transitions, 40 changer transitions 0/121 dead transitions.
[2024-06-14 14:41:05,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 121 transitions, 1033 flow
[2024-06-14 14:41:05,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:41:05,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:41:05,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-14 14:41:05,618 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46875
[2024-06-14 14:41:05,618 INFO  L175             Difference]: Start difference. First operand has 85 places, 86 transitions, 621 flow. Second operand 8 states and 165 transitions.
[2024-06-14 14:41:05,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 121 transitions, 1033 flow
[2024-06-14 14:41:05,650 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 121 transitions, 955 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-14 14:41:05,652 INFO  L231             Difference]: Finished difference. Result has 88 places, 89 transitions, 667 flow
[2024-06-14 14:41:05,652 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=667, PETRI_PLACES=88, PETRI_TRANSITIONS=89}
[2024-06-14 14:41:05,653 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places.
[2024-06-14 14:41:05,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 667 flow
[2024-06-14 14:41:05,653 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:41:05,653 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:41:05,654 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:41:05,654 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:41:05,654 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:41:05,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:41:05,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -375408755, now seen corresponding path program 4 times
[2024-06-14 14:41:05,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:41:05,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441023995]
[2024-06-14 14:41:05,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:41:05,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:41:05,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:41:21,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:41:21,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:41:21,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441023995]
[2024-06-14 14:41:21,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441023995] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:41:21,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:41:21,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:41:21,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779900580]
[2024-06-14 14:41:21,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:41:21,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:41:21,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:41:21,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:41:21,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:41:22,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:41:22,129 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 667 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:41:22,129 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:41:22,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:41:22,129 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:41:24,166 INFO  L124   PetriNetUnfolderBase]: 1902/2885 cut-off events.
[2024-06-14 14:41:24,166 INFO  L125   PetriNetUnfolderBase]: For 38897/38905 co-relation queries the response was YES.
[2024-06-14 14:41:24,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13961 conditions, 2885 events. 1902/2885 cut-off events. For 38897/38905 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14132 event pairs, 616 based on Foata normal form. 7/2889 useless extension candidates. Maximal degree in co-relation 13924. Up to 2561 conditions per place. 
[2024-06-14 14:41:24,180 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 71 selfloop transitions, 40 changer transitions 0/116 dead transitions.
[2024-06-14 14:41:24,180 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 116 transitions, 963 flow
[2024-06-14 14:41:24,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:41:24,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:41:24,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 14:41:24,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45170454545454547
[2024-06-14 14:41:24,182 INFO  L175             Difference]: Start difference. First operand has 88 places, 89 transitions, 667 flow. Second operand 8 states and 159 transitions.
[2024-06-14 14:41:24,182 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 116 transitions, 963 flow
[2024-06-14 14:41:24,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 872 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 14:41:24,208 INFO  L231             Difference]: Finished difference. Result has 91 places, 89 transitions, 664 flow
[2024-06-14 14:41:24,208 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=91, PETRI_TRANSITIONS=89}
[2024-06-14 14:41:24,209 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places.
[2024-06-14 14:41:24,209 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 664 flow
[2024-06-14 14:41:24,209 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:41:24,209 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:41:24,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:41:24,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:41:24,210 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:41:24,210 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:41:24,210 INFO  L85        PathProgramCache]: Analyzing trace with hash -1035554129, now seen corresponding path program 1 times
[2024-06-14 14:41:24,210 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:41:24,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811512158]
[2024-06-14 14:41:24,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:41:24,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:41:24,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:41:42,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:41:42,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:41:42,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811512158]
[2024-06-14 14:41:42,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811512158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:41:42,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:41:42,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:41:42,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756860527]
[2024-06-14 14:41:42,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:41:42,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:41:42,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:41:42,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:41:42,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:41:42,902 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-14 14:41:42,902 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 664 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:41:42,902 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:41:42,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-14 14:41:42,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:41:44,048 INFO  L124   PetriNetUnfolderBase]: 1453/2404 cut-off events.
[2024-06-14 14:41:44,048 INFO  L125   PetriNetUnfolderBase]: For 34899/34899 co-relation queries the response was YES.
[2024-06-14 14:41:44,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11684 conditions, 2404 events. 1453/2404 cut-off events. For 34899/34899 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12962 event pairs, 532 based on Foata normal form. 2/2400 useless extension candidates. Maximal degree in co-relation 11646. Up to 2133 conditions per place. 
[2024-06-14 14:41:44,059 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 74 selfloop transitions, 11 changer transitions 0/102 dead transitions.
[2024-06-14 14:41:44,059 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 102 transitions, 884 flow
[2024-06-14 14:41:44,059 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:41:44,059 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:41:44,060 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions.
[2024-06-14 14:41:44,060 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4696969696969697
[2024-06-14 14:41:44,060 INFO  L175             Difference]: Start difference. First operand has 91 places, 89 transitions, 664 flow. Second operand 6 states and 124 transitions.
[2024-06-14 14:41:44,060 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 102 transitions, 884 flow
[2024-06-14 14:41:44,075 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 102 transitions, 749 flow, removed 2 selfloop flow, removed 10 redundant places.
[2024-06-14 14:41:44,076 INFO  L231             Difference]: Finished difference. Result has 87 places, 92 transitions, 589 flow
[2024-06-14 14:41:44,076 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=87, PETRI_TRANSITIONS=92}
[2024-06-14 14:41:44,076 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places.
[2024-06-14 14:41:44,076 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 589 flow
[2024-06-14 14:41:44,077 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:41:44,077 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:41:44,077 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:41:44,077 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:41:44,077 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:41:44,077 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:41:44,078 INFO  L85        PathProgramCache]: Analyzing trace with hash -186286177, now seen corresponding path program 1 times
[2024-06-14 14:41:44,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:41:44,078 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537221282]
[2024-06-14 14:41:44,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:41:44,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:41:44,109 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:42:01,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-06-14 14:42:01,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:42:01,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537221282]
[2024-06-14 14:42:01,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537221282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:42:01,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:42:01,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:42:01,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184259127]
[2024-06-14 14:42:01,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:42:01,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:42:01,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:42:01,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:42:01,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:42:01,501 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:42:01,501 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 92 transitions, 589 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:01,501 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:42:01,501 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:42:01,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:42:03,317 INFO  L124   PetriNetUnfolderBase]: 1915/2909 cut-off events.
[2024-06-14 14:42:03,317 INFO  L125   PetriNetUnfolderBase]: For 45296/45296 co-relation queries the response was YES.
[2024-06-14 14:42:03,323 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14489 conditions, 2909 events. 1915/2909 cut-off events. For 45296/45296 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14329 event pairs, 627 based on Foata normal form. 4/2911 useless extension candidates. Maximal degree in co-relation 14451. Up to 2758 conditions per place. 
[2024-06-14 14:42:03,331 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 110 selfloop transitions, 20 changer transitions 0/135 dead transitions.
[2024-06-14 14:42:03,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 135 transitions, 989 flow
[2024-06-14 14:42:03,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:42:03,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:42:03,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 14:42:03,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-14 14:42:03,354 INFO  L175             Difference]: Start difference. First operand has 87 places, 92 transitions, 589 flow. Second operand 9 states and 179 transitions.
[2024-06-14 14:42:03,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 135 transitions, 989 flow
[2024-06-14 14:42:03,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 135 transitions, 951 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 14:42:03,386 INFO  L231             Difference]: Finished difference. Result has 92 places, 95 transitions, 641 flow
[2024-06-14 14:42:03,386 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=641, PETRI_PLACES=92, PETRI_TRANSITIONS=95}
[2024-06-14 14:42:03,387 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places.
[2024-06-14 14:42:03,387 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 95 transitions, 641 flow
[2024-06-14 14:42:03,387 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:03,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:42:03,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:42:03,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:42:03,387 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:42:03,388 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:42:03,388 INFO  L85        PathProgramCache]: Analyzing trace with hash -186281527, now seen corresponding path program 2 times
[2024-06-14 14:42:03,388 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:42:03,388 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292474064]
[2024-06-14 14:42:03,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:42:03,389 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:42:03,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:42:19,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:42:19,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:42:19,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292474064]
[2024-06-14 14:42:19,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292474064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:42:19,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:42:19,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:42:19,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622683293]
[2024-06-14 14:42:19,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:42:19,793 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:42:19,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:42:19,794 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:42:19,794 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:42:19,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:42:19,993 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 95 transitions, 641 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:19,993 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:42:19,993 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:42:19,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:42:21,878 INFO  L124   PetriNetUnfolderBase]: 1937/2944 cut-off events.
[2024-06-14 14:42:21,879 INFO  L125   PetriNetUnfolderBase]: For 50359/50361 co-relation queries the response was YES.
[2024-06-14 14:42:21,886 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15236 conditions, 2944 events. 1937/2944 cut-off events. For 50359/50361 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14554 event pairs, 543 based on Foata normal form. 4/2945 useless extension candidates. Maximal degree in co-relation 15197. Up to 2508 conditions per place. 
[2024-06-14 14:42:21,895 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 88 selfloop transitions, 51 changer transitions 0/144 dead transitions.
[2024-06-14 14:42:21,895 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 144 transitions, 1191 flow
[2024-06-14 14:42:21,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:42:21,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:42:21,898 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-14 14:42:21,899 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4772727272727273
[2024-06-14 14:42:21,899 INFO  L175             Difference]: Start difference. First operand has 92 places, 95 transitions, 641 flow. Second operand 9 states and 189 transitions.
[2024-06-14 14:42:21,899 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 144 transitions, 1191 flow
[2024-06-14 14:42:21,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 144 transitions, 1125 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-14 14:42:21,925 INFO  L231             Difference]: Finished difference. Result has 94 places, 101 transitions, 775 flow
[2024-06-14 14:42:21,926 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=775, PETRI_PLACES=94, PETRI_TRANSITIONS=101}
[2024-06-14 14:42:21,926 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places.
[2024-06-14 14:42:21,926 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 101 transitions, 775 flow
[2024-06-14 14:42:21,926 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:21,926 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:42:21,926 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:42:21,927 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:42:21,927 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:42:21,927 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:42:21,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -557487113, now seen corresponding path program 3 times
[2024-06-14 14:42:21,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:42:21,927 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459966773]
[2024-06-14 14:42:21,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:42:21,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:42:21,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:42:38,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:42:38,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:42:38,531 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459966773]
[2024-06-14 14:42:38,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459966773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:42:38,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:42:38,532 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:42:38,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868320887]
[2024-06-14 14:42:38,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:42:38,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:42:38,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:42:38,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:42:38,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:42:38,758 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:42:38,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 101 transitions, 775 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:38,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:42:38,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:42:38,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:42:40,575 INFO  L124   PetriNetUnfolderBase]: 1959/2986 cut-off events.
[2024-06-14 14:42:40,575 INFO  L125   PetriNetUnfolderBase]: For 56992/56994 co-relation queries the response was YES.
[2024-06-14 14:42:40,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16099 conditions, 2986 events. 1959/2986 cut-off events. For 56992/56994 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14817 event pairs, 548 based on Foata normal form. 4/2987 useless extension candidates. Maximal degree in co-relation 16059. Up to 2527 conditions per place. 
[2024-06-14 14:42:40,608 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 87 selfloop transitions, 52 changer transitions 0/144 dead transitions.
[2024-06-14 14:42:40,608 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 144 transitions, 1285 flow
[2024-06-14 14:42:40,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:42:40,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:42:40,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions.
[2024-06-14 14:42:40,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-14 14:42:40,614 INFO  L175             Difference]: Start difference. First operand has 94 places, 101 transitions, 775 flow. Second operand 9 states and 187 transitions.
[2024-06-14 14:42:40,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 144 transitions, 1285 flow
[2024-06-14 14:42:40,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 144 transitions, 1190 flow, removed 26 selfloop flow, removed 5 redundant places.
[2024-06-14 14:42:40,644 INFO  L231             Difference]: Finished difference. Result has 98 places, 104 transitions, 840 flow
[2024-06-14 14:42:40,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=98, PETRI_TRANSITIONS=104}
[2024-06-14 14:42:40,645 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places.
[2024-06-14 14:42:40,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 840 flow
[2024-06-14 14:42:40,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:40,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:42:40,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:42:40,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:42:40,646 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:42:40,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:42:40,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1990120853, now seen corresponding path program 1 times
[2024-06-14 14:42:40,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:42:40,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427056567]
[2024-06-14 14:42:40,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:42:40,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:42:40,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:42:56,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:42:56,629 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:42:56,629 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427056567]
[2024-06-14 14:42:56,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427056567] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:42:56,629 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:42:56,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:42:56,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649416863]
[2024-06-14 14:42:56,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:42:56,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:42:56,630 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:42:56,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:42:56,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:42:56,779 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:42:56,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 840 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:56,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:42:56,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:42:56,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:42:58,622 INFO  L124   PetriNetUnfolderBase]: 1859/2896 cut-off events.
[2024-06-14 14:42:58,623 INFO  L125   PetriNetUnfolderBase]: For 62078/62082 co-relation queries the response was YES.
[2024-06-14 14:42:58,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16069 conditions, 2896 events. 1859/2896 cut-off events. For 62078/62082 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14917 event pairs, 603 based on Foata normal form. 6/2899 useless extension candidates. Maximal degree in co-relation 16027. Up to 2647 conditions per place. 
[2024-06-14 14:42:58,657 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 104 selfloop transitions, 23 changer transitions 0/137 dead transitions.
[2024-06-14 14:42:58,658 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 137 transitions, 1221 flow
[2024-06-14 14:42:58,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:42:58,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:42:58,662 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-14 14:42:58,662 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2024-06-14 14:42:58,662 INFO  L175             Difference]: Start difference. First operand has 98 places, 104 transitions, 840 flow. Second operand 8 states and 163 transitions.
[2024-06-14 14:42:58,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 137 transitions, 1221 flow
[2024-06-14 14:42:58,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 137 transitions, 1111 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 14:42:58,711 INFO  L231             Difference]: Finished difference. Result has 101 places, 109 transitions, 848 flow
[2024-06-14 14:42:58,711 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=848, PETRI_PLACES=101, PETRI_TRANSITIONS=109}
[2024-06-14 14:42:58,711 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places.
[2024-06-14 14:42:58,711 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 848 flow
[2024-06-14 14:42:58,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:42:58,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:42:58,712 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:42:58,712 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:42:58,712 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:42:58,713 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:42:58,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 1989874589, now seen corresponding path program 4 times
[2024-06-14 14:42:58,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:42:58,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061392737]
[2024-06-14 14:42:58,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:42:58,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:42:58,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:43:16,020 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:43:16,020 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:43:16,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061392737]
[2024-06-14 14:43:16,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061392737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:43:16,020 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:43:16,020 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:43:16,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846702224]
[2024-06-14 14:43:16,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:43:16,024 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:43:16,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:43:16,024 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:43:16,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:43:16,217 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:43:16,217 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 848 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:43:16,217 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:43:16,217 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:43:16,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:43:18,099 INFO  L124   PetriNetUnfolderBase]: 1998/3065 cut-off events.
[2024-06-14 14:43:18,099 INFO  L125   PetriNetUnfolderBase]: For 67784/67786 co-relation queries the response was YES.
[2024-06-14 14:43:18,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17179 conditions, 3065 events. 1998/3065 cut-off events. For 67784/67786 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15420 event pairs, 573 based on Foata normal form. 4/3066 useless extension candidates. Maximal degree in co-relation 17135. Up to 2573 conditions per place. 
[2024-06-14 14:43:18,117 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 88 selfloop transitions, 56 changer transitions 0/149 dead transitions.
[2024-06-14 14:43:18,118 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 149 transitions, 1373 flow
[2024-06-14 14:43:18,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:43:18,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:43:18,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-14 14:43:18,121 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4671717171717172
[2024-06-14 14:43:18,121 INFO  L175             Difference]: Start difference. First operand has 101 places, 109 transitions, 848 flow. Second operand 9 states and 185 transitions.
[2024-06-14 14:43:18,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 149 transitions, 1373 flow
[2024-06-14 14:43:18,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 149 transitions, 1302 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-14 14:43:18,156 INFO  L231             Difference]: Finished difference. Result has 105 places, 112 transitions, 940 flow
[2024-06-14 14:43:18,156 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=105, PETRI_TRANSITIONS=112}
[2024-06-14 14:43:18,157 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places.
[2024-06-14 14:43:18,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 940 flow
[2024-06-14 14:43:18,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:43:18,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:43:18,157 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:43:18,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:43:18,158 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:43:18,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:43:18,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1127230392, now seen corresponding path program 1 times
[2024-06-14 14:43:18,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:43:18,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550010857]
[2024-06-14 14:43:18,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:43:18,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:43:18,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:43:34,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:43:34,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:43:34,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550010857]
[2024-06-14 14:43:34,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550010857] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:43:34,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:43:34,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:43:34,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224708258]
[2024-06-14 14:43:34,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:43:34,409 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:43:34,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:43:34,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:43:34,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:43:34,630 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:43:34,630 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 940 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-06-14 14:43:34,630 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:43:34,630 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:43:34,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:43:36,069 INFO  L124   PetriNetUnfolderBase]: 1740/2774 cut-off events.
[2024-06-14 14:43:36,069 INFO  L125   PetriNetUnfolderBase]: For 72881/72886 co-relation queries the response was YES.
[2024-06-14 14:43:36,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16510 conditions, 2774 events. 1740/2774 cut-off events. For 72881/72886 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14690 event pairs, 586 based on Foata normal form. 1/2757 useless extension candidates. Maximal degree in co-relation 16465. Up to 2549 conditions per place. 
[2024-06-14 14:43:36,093 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 103 selfloop transitions, 11 changer transitions 0/130 dead transitions.
[2024-06-14 14:43:36,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 130 transitions, 1234 flow
[2024-06-14 14:43:36,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:43:36,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:43:36,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions.
[2024-06-14 14:43:36,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4696969696969697
[2024-06-14 14:43:36,095 INFO  L175             Difference]: Start difference. First operand has 105 places, 112 transitions, 940 flow. Second operand 6 states and 124 transitions.
[2024-06-14 14:43:36,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 130 transitions, 1234 flow
[2024-06-14 14:43:36,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 130 transitions, 1119 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-14 14:43:36,156 INFO  L231             Difference]: Finished difference. Result has 105 places, 115 transitions, 887 flow
[2024-06-14 14:43:36,156 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=887, PETRI_PLACES=105, PETRI_TRANSITIONS=115}
[2024-06-14 14:43:36,156 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places.
[2024-06-14 14:43:36,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 887 flow
[2024-06-14 14:43:36,157 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-06-14 14:43:36,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:43:36,157 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:43:36,157 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:43:36,157 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:43:36,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:43:36,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1606474995, now seen corresponding path program 2 times
[2024-06-14 14:43:36,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:43:36,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140309289]
[2024-06-14 14:43:36,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:43:36,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:43:36,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:43:51,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:43:51,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:43:51,783 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140309289]
[2024-06-14 14:43:51,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140309289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:43:51,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:43:51,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:43:51,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958232725]
[2024-06-14 14:43:51,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:43:51,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:43:51,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:43:51,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:43:51,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:43:52,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:43:52,012 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 115 transitions, 887 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:43:52,012 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:43:52,012 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:43:52,012 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:43:53,652 INFO  L124   PetriNetUnfolderBase]: 1914/2990 cut-off events.
[2024-06-14 14:43:53,652 INFO  L125   PetriNetUnfolderBase]: For 78934/78942 co-relation queries the response was YES.
[2024-06-14 14:43:53,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17575 conditions, 2990 events. 1914/2990 cut-off events. For 78934/78942 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15465 event pairs, 608 based on Foata normal form. 10/2990 useless extension candidates. Maximal degree in co-relation 17529. Up to 2725 conditions per place. 
[2024-06-14 14:43:53,678 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 108 selfloop transitions, 29 changer transitions 0/147 dead transitions.
[2024-06-14 14:43:53,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 1308 flow
[2024-06-14 14:43:53,681 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:43:53,681 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:43:53,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 14:43:53,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45170454545454547
[2024-06-14 14:43:53,682 INFO  L175             Difference]: Start difference. First operand has 105 places, 115 transitions, 887 flow. Second operand 8 states and 159 transitions.
[2024-06-14 14:43:53,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 1308 flow
[2024-06-14 14:43:53,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 147 transitions, 1268 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 14:43:53,743 INFO  L231             Difference]: Finished difference. Result has 110 places, 123 transitions, 1015 flow
[2024-06-14 14:43:53,744 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=847, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1015, PETRI_PLACES=110, PETRI_TRANSITIONS=123}
[2024-06-14 14:43:53,744 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places.
[2024-06-14 14:43:53,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 1015 flow
[2024-06-14 14:43:53,745 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:43:53,745 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:43:53,745 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:43:53,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:43:53,746 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:43:53,746 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:43:53,746 INFO  L85        PathProgramCache]: Analyzing trace with hash -357704889, now seen corresponding path program 3 times
[2024-06-14 14:43:53,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:43:53,747 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542324132]
[2024-06-14 14:43:53,747 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:43:53,747 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:43:53,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:44:09,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:44:09,168 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:44:09,168 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542324132]
[2024-06-14 14:44:09,168 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542324132] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:44:09,168 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:44:09,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:44:09,168 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382501453]
[2024-06-14 14:44:09,168 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:44:09,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:44:09,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:44:09,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:44:09,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:44:09,352 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:44:09,353 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 1015 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:44:09,353 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:44:09,353 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:44:09,353 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:44:11,125 INFO  L124   PetriNetUnfolderBase]: 1931/3017 cut-off events.
[2024-06-14 14:44:11,125 INFO  L125   PetriNetUnfolderBase]: For 86639/86647 co-relation queries the response was YES.
[2024-06-14 14:44:11,135 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18386 conditions, 3017 events. 1931/3017 cut-off events. For 86639/86647 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15642 event pairs, 579 based on Foata normal form. 10/3003 useless extension candidates. Maximal degree in co-relation 18338. Up to 2669 conditions per place. 
[2024-06-14 14:44:11,152 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 108 selfloop transitions, 36 changer transitions 0/154 dead transitions.
[2024-06-14 14:44:11,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 154 transitions, 1547 flow
[2024-06-14 14:44:11,155 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:44:11,155 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:44:11,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-14 14:44:11,156 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4602272727272727
[2024-06-14 14:44:11,156 INFO  L175             Difference]: Start difference. First operand has 110 places, 123 transitions, 1015 flow. Second operand 8 states and 162 transitions.
[2024-06-14 14:44:11,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 154 transitions, 1547 flow
[2024-06-14 14:44:11,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 154 transitions, 1480 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-14 14:44:11,198 INFO  L231             Difference]: Finished difference. Result has 115 places, 127 transitions, 1115 flow
[2024-06-14 14:44:11,199 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1115, PETRI_PLACES=115, PETRI_TRANSITIONS=127}
[2024-06-14 14:44:11,199 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places.
[2024-06-14 14:44:11,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 127 transitions, 1115 flow
[2024-06-14 14:44:11,200 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:44:11,200 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:44:11,200 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:44:11,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:44:11,200 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:44:11,201 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:44:11,201 INFO  L85        PathProgramCache]: Analyzing trace with hash 1321375125, now seen corresponding path program 4 times
[2024-06-14 14:44:11,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:44:11,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639090452]
[2024-06-14 14:44:11,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:44:11,202 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:44:11,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:44:26,969 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:44:26,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:44:26,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639090452]
[2024-06-14 14:44:26,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639090452] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:44:26,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:44:26,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:44:26,970 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282385165]
[2024-06-14 14:44:26,970 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:44:26,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:44:26,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:44:26,971 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:44:26,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:44:27,183 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:44:27,183 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 127 transitions, 1115 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:44:27,183 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:44:27,183 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:44:27,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:44:28,835 INFO  L124   PetriNetUnfolderBase]: 1923/3005 cut-off events.
[2024-06-14 14:44:28,836 INFO  L125   PetriNetUnfolderBase]: For 91471/91479 co-relation queries the response was YES.
[2024-06-14 14:44:28,844 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18225 conditions, 3005 events. 1923/3005 cut-off events. For 91471/91479 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15610 event pairs, 618 based on Foata normal form. 10/2991 useless extension candidates. Maximal degree in co-relation 18176. Up to 2740 conditions per place. 
[2024-06-14 14:44:28,854 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 113 selfloop transitions, 28 changer transitions 0/151 dead transitions.
[2024-06-14 14:44:28,854 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 151 transitions, 1457 flow
[2024-06-14 14:44:28,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:44:28,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:44:28,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-14 14:44:28,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-14 14:44:28,858 INFO  L175             Difference]: Start difference. First operand has 115 places, 127 transitions, 1115 flow. Second operand 8 states and 160 transitions.
[2024-06-14 14:44:28,858 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 151 transitions, 1457 flow
[2024-06-14 14:44:28,903 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 151 transitions, 1359 flow, removed 33 selfloop flow, removed 4 redundant places.
[2024-06-14 14:44:28,906 INFO  L231             Difference]: Finished difference. Result has 119 places, 127 transitions, 1080 flow
[2024-06-14 14:44:28,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1080, PETRI_PLACES=119, PETRI_TRANSITIONS=127}
[2024-06-14 14:44:28,906 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places.
[2024-06-14 14:44:28,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 1080 flow
[2024-06-14 14:44:28,907 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:44:28,907 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:44:28,907 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:44:28,907 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:44:28,907 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:44:28,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:44:28,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 1321128861, now seen corresponding path program 5 times
[2024-06-14 14:44:28,908 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:44:28,908 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004506062]
[2024-06-14 14:44:28,908 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:44:28,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:44:28,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:44:46,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:44:46,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:44:46,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004506062]
[2024-06-14 14:44:46,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004506062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:44:46,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:44:46,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:44:46,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464265513]
[2024-06-14 14:44:46,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:44:46,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:44:46,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:44:46,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:44:46,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:44:46,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:44:46,981 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 1080 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:44:46,981 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:44:46,981 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:44:46,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:44:49,078 INFO  L124   PetriNetUnfolderBase]: 2030/3114 cut-off events.
[2024-06-14 14:44:49,078 INFO  L125   PetriNetUnfolderBase]: For 95355/95361 co-relation queries the response was YES.
[2024-06-14 14:44:49,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18756 conditions, 3114 events. 2030/3114 cut-off events. For 95355/95361 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15631 event pairs, 578 based on Foata normal form. 5/3115 useless extension candidates. Maximal degree in co-relation 18705. Up to 2621 conditions per place. 
[2024-06-14 14:44:49,098 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 93 selfloop transitions, 60 changer transitions 0/158 dead transitions.
[2024-06-14 14:44:49,098 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 158 transitions, 1470 flow
[2024-06-14 14:44:49,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:44:49,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:44:49,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 14:44:49,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-14 14:44:49,101 INFO  L175             Difference]: Start difference. First operand has 119 places, 127 transitions, 1080 flow. Second operand 9 states and 179 transitions.
[2024-06-14 14:44:49,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 158 transitions, 1470 flow
[2024-06-14 14:44:49,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 158 transitions, 1353 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-14 14:44:49,155 INFO  L231             Difference]: Finished difference. Result has 119 places, 127 transitions, 1091 flow
[2024-06-14 14:44:49,155 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1091, PETRI_PLACES=119, PETRI_TRANSITIONS=127}
[2024-06-14 14:44:49,168 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places.
[2024-06-14 14:44:49,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 1091 flow
[2024-06-14 14:44:49,169 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:44:49,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:44:49,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:44:49,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:44:49,169 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:44:49,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:44:49,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -2037421184, now seen corresponding path program 2 times
[2024-06-14 14:44:49,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:44:49,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168621752]
[2024-06-14 14:44:49,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:44:49,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:44:49,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:45:05,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:45:05,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:45:05,468 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168621752]
[2024-06-14 14:45:05,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168621752] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:45:05,468 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:45:05,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:45:05,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436816779]
[2024-06-14 14:45:05,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:45:05,469 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:45:05,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:45:05,470 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:45:05,470 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:45:05,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:45:05,602 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 1091 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-06-14 14:45:05,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:45:05,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:45:05,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:45:07,100 INFO  L124   PetriNetUnfolderBase]: 1764/2821 cut-off events.
[2024-06-14 14:45:07,101 INFO  L125   PetriNetUnfolderBase]: For 99908/99921 co-relation queries the response was YES.
[2024-06-14 14:45:07,112 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17949 conditions, 2821 events. 1764/2821 cut-off events. For 99908/99921 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15023 event pairs, 596 based on Foata normal form. 7/2809 useless extension candidates. Maximal degree in co-relation 17899. Up to 2583 conditions per place. 
[2024-06-14 14:45:07,124 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 107 selfloop transitions, 16 changer transitions 0/139 dead transitions.
[2024-06-14 14:45:07,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 139 transitions, 1397 flow
[2024-06-14 14:45:07,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:45:07,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:45:07,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions.
[2024-06-14 14:45:07,126 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-14 14:45:07,126 INFO  L175             Difference]: Start difference. First operand has 119 places, 127 transitions, 1091 flow. Second operand 6 states and 120 transitions.
[2024-06-14 14:45:07,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 139 transitions, 1397 flow
[2024-06-14 14:45:07,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 139 transitions, 1198 flow, removed 4 selfloop flow, removed 10 redundant places.
[2024-06-14 14:45:07,200 INFO  L231             Difference]: Finished difference. Result has 115 places, 130 transitions, 974 flow
[2024-06-14 14:45:07,200 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=115, PETRI_TRANSITIONS=130}
[2024-06-14 14:45:07,203 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places.
[2024-06-14 14:45:07,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 130 transitions, 974 flow
[2024-06-14 14:45:07,203 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-06-14 14:45:07,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:45:07,203 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:45:07,203 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:45:07,203 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:45:07,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:45:07,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -2043127168, now seen corresponding path program 1 times
[2024-06-14 14:45:07,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:45:07,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027757532]
[2024-06-14 14:45:07,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:45:07,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:45:07,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:45:24,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:45:24,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:45:24,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027757532]
[2024-06-14 14:45:24,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027757532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:45:24,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:45:24,296 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:45:24,296 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016148426]
[2024-06-14 14:45:24,296 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:45:24,296 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:45:24,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:45:24,297 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:45:24,297 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:45:24,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:45:24,480 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 130 transitions, 974 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-06-14 14:45:24,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:45:24,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:45:24,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:45:25,675 INFO  L124   PetriNetUnfolderBase]: 1691/2746 cut-off events.
[2024-06-14 14:45:25,675 INFO  L125   PetriNetUnfolderBase]: For 89534/89534 co-relation queries the response was YES.
[2024-06-14 14:45:25,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16628 conditions, 2746 events. 1691/2746 cut-off events. For 89534/89534 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14708 event pairs, 504 based on Foata normal form. 2/2739 useless extension candidates. Maximal degree in co-relation 16577. Up to 2487 conditions per place. 
[2024-06-14 14:45:25,696 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 124 selfloop transitions, 11 changer transitions 0/146 dead transitions.
[2024-06-14 14:45:25,697 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 146 transitions, 1312 flow
[2024-06-14 14:45:25,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:45:25,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:45:25,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 14:45:25,700 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4621212121212121
[2024-06-14 14:45:25,701 INFO  L175             Difference]: Start difference. First operand has 115 places, 130 transitions, 974 flow. Second operand 6 states and 122 transitions.
[2024-06-14 14:45:25,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 146 transitions, 1312 flow
[2024-06-14 14:45:25,761 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 146 transitions, 1252 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-14 14:45:25,763 INFO  L231             Difference]: Finished difference. Result has 117 places, 133 transitions, 982 flow
[2024-06-14 14:45:25,764 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=982, PETRI_PLACES=117, PETRI_TRANSITIONS=133}
[2024-06-14 14:45:25,764 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 72 predicate places.
[2024-06-14 14:45:25,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 133 transitions, 982 flow
[2024-06-14 14:45:25,764 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-06-14 14:45:25,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:45:25,764 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:45:25,765 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:45:25,765 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:45:25,765 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:45:25,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -2037413248, now seen corresponding path program 2 times
[2024-06-14 14:45:25,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:45:25,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607143690]
[2024-06-14 14:45:25,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:45:25,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:45:25,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:45:43,036 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:45:43,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:45:43,037 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607143690]
[2024-06-14 14:45:43,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607143690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:45:43,037 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:45:43,037 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:45:43,037 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89114251]
[2024-06-14 14:45:43,037 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:45:43,038 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:45:43,038 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:45:43,038 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:45:43,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:45:43,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:45:43,163 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 133 transitions, 982 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-06-14 14:45:43,163 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:45:43,163 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:45:43,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:45:44,359 INFO  L124   PetriNetUnfolderBase]: 1693/2752 cut-off events.
[2024-06-14 14:45:44,360 INFO  L125   PetriNetUnfolderBase]: For 94581/94583 co-relation queries the response was YES.
[2024-06-14 14:45:44,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17077 conditions, 2752 events. 1693/2752 cut-off events. For 94581/94583 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14762 event pairs, 508 based on Foata normal form. 4/2747 useless extension candidates. Maximal degree in co-relation 17025. Up to 2481 conditions per place. 
[2024-06-14 14:45:44,385 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 120 selfloop transitions, 16 changer transitions 0/147 dead transitions.
[2024-06-14 14:45:44,386 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 147 transitions, 1324 flow
[2024-06-14 14:45:44,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:45:44,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:45:44,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-14 14:45:44,387 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4621212121212121
[2024-06-14 14:45:44,387 INFO  L175             Difference]: Start difference. First operand has 117 places, 133 transitions, 982 flow. Second operand 6 states and 122 transitions.
[2024-06-14 14:45:44,387 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 147 transitions, 1324 flow
[2024-06-14 14:45:44,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 147 transitions, 1278 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-14 14:45:44,480 INFO  L231             Difference]: Finished difference. Result has 119 places, 136 transitions, 1020 flow
[2024-06-14 14:45:44,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1020, PETRI_PLACES=119, PETRI_TRANSITIONS=136}
[2024-06-14 14:45:44,481 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places.
[2024-06-14 14:45:44,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 136 transitions, 1020 flow
[2024-06-14 14:45:44,481 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-06-14 14:45:44,481 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:45:44,482 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:45:44,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:45:44,482 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:45:44,482 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:45:44,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 19521667, now seen corresponding path program 1 times
[2024-06-14 14:45:44,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:45:44,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198250810]
[2024-06-14 14:45:44,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:45:44,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:45:44,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:45:58,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:45:58,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:45:58,697 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198250810]
[2024-06-14 14:45:58,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198250810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:45:58,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:45:58,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:45:58,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330965422]
[2024-06-14 14:45:58,697 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:45:58,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:45:58,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:45:58,698 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:45:58,698 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:45:58,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:45:58,924 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 136 transitions, 1020 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:45:58,924 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:45:58,924 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:45:58,924 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:46:00,831 INFO  L124   PetriNetUnfolderBase]: 2056/3155 cut-off events.
[2024-06-14 14:46:00,832 INFO  L125   PetriNetUnfolderBase]: For 120271/120273 co-relation queries the response was YES.
[2024-06-14 14:46:00,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20403 conditions, 3155 events. 2056/3155 cut-off events. For 120271/120273 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15840 event pairs, 579 based on Foata normal form. 4/3156 useless extension candidates. Maximal degree in co-relation 20350. Up to 2870 conditions per place. 
[2024-06-14 14:46:00,852 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 130 selfloop transitions, 41 changer transitions 0/176 dead transitions.
[2024-06-14 14:46:00,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 176 transitions, 1508 flow
[2024-06-14 14:46:00,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:46:00,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:46:00,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-14 14:46:00,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494949494949495
[2024-06-14 14:46:00,855 INFO  L175             Difference]: Start difference. First operand has 119 places, 136 transitions, 1020 flow. Second operand 9 states and 178 transitions.
[2024-06-14 14:46:00,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 176 transitions, 1508 flow
[2024-06-14 14:46:00,901 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 176 transitions, 1446 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-14 14:46:00,903 INFO  L231             Difference]: Finished difference. Result has 125 places, 141 transitions, 1113 flow
[2024-06-14 14:46:00,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1113, PETRI_PLACES=125, PETRI_TRANSITIONS=141}
[2024-06-14 14:46:00,903 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 80 predicate places.
[2024-06-14 14:46:00,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 141 transitions, 1113 flow
[2024-06-14 14:46:00,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:00,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:46:00,904 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:46:00,904 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:46:00,904 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:46:00,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:46:00,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 850788956, now seen corresponding path program 1 times
[2024-06-14 14:46:00,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:46:00,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752751283]
[2024-06-14 14:46:00,905 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:46:00,905 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:46:00,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:46:18,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-06-14 14:46:18,275 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:46:18,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752751283]
[2024-06-14 14:46:18,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752751283] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:46:18,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:46:18,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:46:18,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301003]
[2024-06-14 14:46:18,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:46:18,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:46:18,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:46:18,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:46:18,281 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:46:18,432 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:46:18,432 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 141 transitions, 1113 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:18,433 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:46:18,433 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:46:18,433 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:46:19,908 INFO  L124   PetriNetUnfolderBase]: 1915/3001 cut-off events.
[2024-06-14 14:46:19,908 INFO  L125   PetriNetUnfolderBase]: For 126482/126482 co-relation queries the response was YES.
[2024-06-14 14:46:19,917 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20584 conditions, 3001 events. 1915/3001 cut-off events. For 126482/126482 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15506 event pairs, 567 based on Foata normal form. 1/2986 useless extension candidates. Maximal degree in co-relation 20529. Up to 2813 conditions per place. 
[2024-06-14 14:46:19,928 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 141 selfloop transitions, 14 changer transitions 0/166 dead transitions.
[2024-06-14 14:46:19,928 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 166 transitions, 1519 flow
[2024-06-14 14:46:19,928 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:46:19,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:46:19,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-14 14:46:19,929 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-14 14:46:19,929 INFO  L175             Difference]: Start difference. First operand has 125 places, 141 transitions, 1113 flow. Second operand 7 states and 140 transitions.
[2024-06-14 14:46:19,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 166 transitions, 1519 flow
[2024-06-14 14:46:19,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 166 transitions, 1406 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-14 14:46:19,994 INFO  L231             Difference]: Finished difference. Result has 126 places, 144 transitions, 1080 flow
[2024-06-14 14:46:19,994 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1080, PETRI_PLACES=126, PETRI_TRANSITIONS=144}
[2024-06-14 14:46:19,994 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 81 predicate places.
[2024-06-14 14:46:19,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 144 transitions, 1080 flow
[2024-06-14 14:46:19,995 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:19,995 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:46:19,995 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:46:19,995 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 14:46:19,995 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:46:19,996 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:46:19,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 1563936979, now seen corresponding path program 2 times
[2024-06-14 14:46:19,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:46:19,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425229751]
[2024-06-14 14:46:19,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:46:19,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:46:20,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:46:34,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:46:34,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:46:34,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425229751]
[2024-06-14 14:46:34,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425229751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:46:34,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:46:34,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:46:34,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330244992]
[2024-06-14 14:46:34,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:46:34,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:46:34,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:46:34,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:46:34,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:46:35,177 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:46:35,178 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 144 transitions, 1080 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:35,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:46:35,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:46:35,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:46:37,654 INFO  L124   PetriNetUnfolderBase]: 2089/3210 cut-off events.
[2024-06-14 14:46:37,655 INFO  L125   PetriNetUnfolderBase]: For 135694/135696 co-relation queries the response was YES.
[2024-06-14 14:46:37,669 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21709 conditions, 3210 events. 2089/3210 cut-off events. For 135694/135696 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16228 event pairs, 585 based on Foata normal form. 4/3211 useless extension candidates. Maximal degree in co-relation 21653. Up to 2916 conditions per place. 
[2024-06-14 14:46:37,685 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 135 selfloop transitions, 44 changer transitions 0/184 dead transitions.
[2024-06-14 14:46:37,685 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 184 transitions, 1607 flow
[2024-06-14 14:46:37,688 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:46:37,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:46:37,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 14:46:37,689 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:46:37,689 INFO  L175             Difference]: Start difference. First operand has 126 places, 144 transitions, 1080 flow. Second operand 9 states and 176 transitions.
[2024-06-14 14:46:37,689 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 184 transitions, 1607 flow
[2024-06-14 14:46:37,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 184 transitions, 1549 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:46:37,784 INFO  L231             Difference]: Finished difference. Result has 131 places, 152 transitions, 1218 flow
[2024-06-14 14:46:37,784 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1218, PETRI_PLACES=131, PETRI_TRANSITIONS=152}
[2024-06-14 14:46:37,785 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 86 predicate places.
[2024-06-14 14:46:37,785 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 152 transitions, 1218 flow
[2024-06-14 14:46:37,785 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:37,785 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:46:37,786 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:46:37,786 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 14:46:37,786 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:46:37,786 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:46:37,786 INFO  L85        PathProgramCache]: Analyzing trace with hash 1564205749, now seen corresponding path program 3 times
[2024-06-14 14:46:37,787 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:46:37,787 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690290985]
[2024-06-14 14:46:37,787 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:46:37,787 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:46:37,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:46:53,249 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:46:53,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:46:53,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690290985]
[2024-06-14 14:46:53,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690290985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:46:53,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:46:53,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:46:53,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549127560]
[2024-06-14 14:46:53,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:46:53,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:46:53,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:46:53,250 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:46:53,250 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:46:53,491 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:46:53,492 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 152 transitions, 1218 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:53,492 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:46:53,492 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:46:53,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:46:55,446 INFO  L124   PetriNetUnfolderBase]: 2131/3281 cut-off events.
[2024-06-14 14:46:55,447 INFO  L125   PetriNetUnfolderBase]: For 148013/148015 co-relation queries the response was YES.
[2024-06-14 14:46:55,457 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22978 conditions, 3281 events. 2131/3281 cut-off events. For 148013/148015 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 16674 event pairs, 583 based on Foata normal form. 4/3282 useless extension candidates. Maximal degree in co-relation 22920. Up to 2899 conditions per place. 
[2024-06-14 14:46:55,469 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 135 selfloop transitions, 51 changer transitions 0/191 dead transitions.
[2024-06-14 14:46:55,470 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 191 transitions, 1900 flow
[2024-06-14 14:46:55,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:46:55,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:46:55,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 14:46:55,473 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-14 14:46:55,473 INFO  L175             Difference]: Start difference. First operand has 131 places, 152 transitions, 1218 flow. Second operand 9 states and 179 transitions.
[2024-06-14 14:46:55,473 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 191 transitions, 1900 flow
[2024-06-14 14:46:55,540 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 191 transitions, 1797 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-14 14:46:55,542 INFO  L231             Difference]: Finished difference. Result has 136 places, 156 transitions, 1326 flow
[2024-06-14 14:46:55,542 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1326, PETRI_PLACES=136, PETRI_TRANSITIONS=156}
[2024-06-14 14:46:55,543 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 91 predicate places.
[2024-06-14 14:46:55,543 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 156 transitions, 1326 flow
[2024-06-14 14:46:55,543 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:46:55,543 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:46:55,543 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:46:55,544 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 14:46:55,544 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:46:55,544 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:46:55,544 INFO  L85        PathProgramCache]: Analyzing trace with hash 1556787139, now seen corresponding path program 4 times
[2024-06-14 14:46:55,544 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:46:55,544 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587898738]
[2024-06-14 14:46:55,544 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:46:55,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:46:55,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:47:09,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:47:09,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:47:09,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587898738]
[2024-06-14 14:47:09,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587898738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:47:09,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:47:09,189 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:47:09,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865584049]
[2024-06-14 14:47:09,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:47:09,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:47:09,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:47:09,190 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:47:09,190 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:47:09,418 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:47:09,418 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 156 transitions, 1326 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:47:09,418 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:47:09,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:47:09,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:47:11,281 INFO  L124   PetriNetUnfolderBase]: 2123/3269 cut-off events.
[2024-06-14 14:47:11,284 INFO  L125   PetriNetUnfolderBase]: For 153864/153866 co-relation queries the response was YES.
[2024-06-14 14:47:11,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22962 conditions, 3269 events. 2123/3269 cut-off events. For 153864/153866 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16587 event pairs, 590 based on Foata normal form. 4/3270 useless extension candidates. Maximal degree in co-relation 22903. Up to 2970 conditions per place. 
[2024-06-14 14:47:11,306 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 140 selfloop transitions, 43 changer transitions 0/188 dead transitions.
[2024-06-14 14:47:11,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 188 transitions, 1776 flow
[2024-06-14 14:47:11,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:47:11,309 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:47:11,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-14 14:47:11,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44696969696969696
[2024-06-14 14:47:11,314 INFO  L175             Difference]: Start difference. First operand has 136 places, 156 transitions, 1326 flow. Second operand 9 states and 177 transitions.
[2024-06-14 14:47:11,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 188 transitions, 1776 flow
[2024-06-14 14:47:11,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 188 transitions, 1650 flow, removed 38 selfloop flow, removed 5 redundant places.
[2024-06-14 14:47:11,391 INFO  L231             Difference]: Finished difference. Result has 140 places, 156 transitions, 1293 flow
[2024-06-14 14:47:11,391 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1200, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1293, PETRI_PLACES=140, PETRI_TRANSITIONS=156}
[2024-06-14 14:47:11,392 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places.
[2024-06-14 14:47:11,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 156 transitions, 1293 flow
[2024-06-14 14:47:11,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:47:11,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:47:11,392 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:47:11,392 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 14:47:11,392 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:47:11,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:47:11,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 851147440, now seen corresponding path program 1 times
[2024-06-14 14:47:11,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:47:11,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941534062]
[2024-06-14 14:47:11,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:47:11,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:47:11,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:47:30,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:47:30,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:47:30,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941534062]
[2024-06-14 14:47:30,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941534062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:47:30,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:47:30,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:47:30,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631178810]
[2024-06-14 14:47:30,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:47:30,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:47:30,720 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:47:30,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:47:30,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:47:30,888 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:47:30,889 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 156 transitions, 1293 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:47:30,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:47:30,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:47:30,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:47:32,355 INFO  L124   PetriNetUnfolderBase]: 1881/3014 cut-off events.
[2024-06-14 14:47:32,356 INFO  L125   PetriNetUnfolderBase]: For 157967/157967 co-relation queries the response was YES.
[2024-06-14 14:47:32,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21958 conditions, 3014 events. 1881/3014 cut-off events. For 157967/157967 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16188 event pairs, 576 based on Foata normal form. 1/3006 useless extension candidates. Maximal degree in co-relation 21897. Up to 2704 conditions per place. 
[2024-06-14 14:47:32,376 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 137 selfloop transitions, 14 changer transitions 0/175 dead transitions.
[2024-06-14 14:47:32,377 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 175 transitions, 1675 flow
[2024-06-14 14:47:32,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:47:32,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:47:32,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-14 14:47:32,384 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-14 14:47:32,384 INFO  L175             Difference]: Start difference. First operand has 140 places, 156 transitions, 1293 flow. Second operand 7 states and 140 transitions.
[2024-06-14 14:47:32,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 175 transitions, 1675 flow
[2024-06-14 14:47:32,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 175 transitions, 1550 flow, removed 8 selfloop flow, removed 9 redundant places.
[2024-06-14 14:47:32,459 INFO  L231             Difference]: Finished difference. Result has 138 places, 159 transitions, 1248 flow
[2024-06-14 14:47:32,459 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1248, PETRI_PLACES=138, PETRI_TRANSITIONS=159}
[2024-06-14 14:47:32,460 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 93 predicate places.
[2024-06-14 14:47:32,460 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1248 flow
[2024-06-14 14:47:32,460 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:47:32,460 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:47:32,460 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:47:32,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 14:47:32,461 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:47:32,461 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:47:32,461 INFO  L85        PathProgramCache]: Analyzing trace with hash 851147006, now seen corresponding path program 2 times
[2024-06-14 14:47:32,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:47:32,462 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015029500]
[2024-06-14 14:47:32,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:47:32,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:47:32,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:47:49,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:47:49,612 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:47:49,612 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015029500]
[2024-06-14 14:47:49,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015029500] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:47:49,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:47:49,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:47:49,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973345272]
[2024-06-14 14:47:49,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:47:49,613 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:47:49,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:47:49,613 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:47:49,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:47:49,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:47:49,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1248 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:47:49,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:47:49,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:47:49,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:47:51,264 INFO  L124   PetriNetUnfolderBase]: 1987/3122 cut-off events.
[2024-06-14 14:47:51,264 INFO  L125   PetriNetUnfolderBase]: For 166532/166532 co-relation queries the response was YES.
[2024-06-14 14:47:51,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23026 conditions, 3122 events. 1987/3122 cut-off events. For 166532/166532 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 16315 event pairs, 576 based on Foata normal form. 1/3114 useless extension candidates. Maximal degree in co-relation 22965. Up to 2918 conditions per place. 
[2024-06-14 14:47:51,287 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 148 selfloop transitions, 19 changer transitions 0/178 dead transitions.
[2024-06-14 14:47:51,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 178 transitions, 1674 flow
[2024-06-14 14:47:51,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:47:51,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:47:51,288 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 14:47:51,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-14 14:47:51,289 INFO  L175             Difference]: Start difference. First operand has 138 places, 159 transitions, 1248 flow. Second operand 7 states and 136 transitions.
[2024-06-14 14:47:51,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 178 transitions, 1674 flow
[2024-06-14 14:47:51,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 178 transitions, 1616 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 14:47:51,361 INFO  L231             Difference]: Finished difference. Result has 140 places, 162 transitions, 1292 flow
[2024-06-14 14:47:51,361 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1292, PETRI_PLACES=140, PETRI_TRANSITIONS=162}
[2024-06-14 14:47:51,362 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 95 predicate places.
[2024-06-14 14:47:51,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 162 transitions, 1292 flow
[2024-06-14 14:47:51,362 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:47:51,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:47:51,362 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:47:51,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 14:47:51,362 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:47:51,363 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:47:51,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -1425182027, now seen corresponding path program 5 times
[2024-06-14 14:47:51,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:47:51,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144698061]
[2024-06-14 14:47:51,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:47:51,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:47:51,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:48:06,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:48:06,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:48:06,108 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144698061]
[2024-06-14 14:48:06,108 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144698061] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:48:06,108 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:48:06,108 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:48:06,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079556340]
[2024-06-14 14:48:06,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:48:06,109 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:48:06,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:48:06,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:48:06,109 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:48:06,305 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:48:06,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 162 transitions, 1292 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:06,306 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:48:06,306 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:48:06,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:48:08,210 INFO  L124   PetriNetUnfolderBase]: 2186/3363 cut-off events.
[2024-06-14 14:48:08,211 INFO  L125   PetriNetUnfolderBase]: For 181117/181125 co-relation queries the response was YES.
[2024-06-14 14:48:08,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24786 conditions, 3363 events. 2186/3363 cut-off events. For 181117/181125 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17098 event pairs, 597 based on Foata normal form. 7/3367 useless extension candidates. Maximal degree in co-relation 24724. Up to 3015 conditions per place. 
[2024-06-14 14:48:08,234 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 144 selfloop transitions, 54 changer transitions 0/203 dead transitions.
[2024-06-14 14:48:08,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 203 transitions, 2052 flow
[2024-06-14 14:48:08,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:48:08,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:48:08,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 14:48:08,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:48:08,238 INFO  L175             Difference]: Start difference. First operand has 140 places, 162 transitions, 1292 flow. Second operand 9 states and 176 transitions.
[2024-06-14 14:48:08,238 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 203 transitions, 2052 flow
[2024-06-14 14:48:08,324 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 203 transitions, 1972 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-14 14:48:08,327 INFO  L231             Difference]: Finished difference. Result has 145 places, 172 transitions, 1505 flow
[2024-06-14 14:48:08,327 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1505, PETRI_PLACES=145, PETRI_TRANSITIONS=172}
[2024-06-14 14:48:08,328 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 100 predicate places.
[2024-06-14 14:48:08,329 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 172 transitions, 1505 flow
[2024-06-14 14:48:08,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:08,329 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:48:08,329 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:48:08,329 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 14:48:08,329 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:48:08,330 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:48:08,330 INFO  L85        PathProgramCache]: Analyzing trace with hash -53691753, now seen corresponding path program 6 times
[2024-06-14 14:48:08,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:48:08,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400774572]
[2024-06-14 14:48:08,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:48:08,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:48:08,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:48:24,294 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:48:24,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:48:24,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400774572]
[2024-06-14 14:48:24,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400774572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:48:24,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:48:24,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:48:24,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156911193]
[2024-06-14 14:48:24,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:48:24,295 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:48:24,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:48:24,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:48:24,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:48:24,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:48:24,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 172 transitions, 1505 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:24,478 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:48:24,478 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:48:24,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:48:26,451 INFO  L124   PetriNetUnfolderBase]: 2178/3361 cut-off events.
[2024-06-14 14:48:26,451 INFO  L125   PetriNetUnfolderBase]: For 189299/189307 co-relation queries the response was YES.
[2024-06-14 14:48:26,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25333 conditions, 3361 events. 2178/3361 cut-off events. For 189299/189307 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17170 event pairs, 600 based on Foata normal form. 7/3365 useless extension candidates. Maximal degree in co-relation 25269. Up to 3050 conditions per place. 
[2024-06-14 14:48:26,479 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 144 selfloop transitions, 51 changer transitions 0/200 dead transitions.
[2024-06-14 14:48:26,480 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 200 transitions, 1965 flow
[2024-06-14 14:48:26,482 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:48:26,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:48:26,483 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-14 14:48:26,483 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43434343434343436
[2024-06-14 14:48:26,483 INFO  L175             Difference]: Start difference. First operand has 145 places, 172 transitions, 1505 flow. Second operand 9 states and 172 transitions.
[2024-06-14 14:48:26,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 200 transitions, 1965 flow
[2024-06-14 14:48:26,593 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 200 transitions, 1855 flow, removed 50 selfloop flow, removed 2 redundant places.
[2024-06-14 14:48:26,595 INFO  L231             Difference]: Finished difference. Result has 152 places, 172 transitions, 1504 flow
[2024-06-14 14:48:26,595 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1504, PETRI_PLACES=152, PETRI_TRANSITIONS=172}
[2024-06-14 14:48:26,596 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places.
[2024-06-14 14:48:26,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 172 transitions, 1504 flow
[2024-06-14 14:48:26,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:26,596 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:48:26,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:48:26,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 14:48:26,596 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:48:26,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:48:26,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -310192263, now seen corresponding path program 7 times
[2024-06-14 14:48:26,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:48:26,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204887495]
[2024-06-14 14:48:26,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:48:26,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:48:26,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:48:40,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:48:40,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:48:40,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204887495]
[2024-06-14 14:48:40,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204887495] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:48:40,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:48:40,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:48:40,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957345945]
[2024-06-14 14:48:40,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:48:40,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:48:40,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:48:40,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:48:40,345 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:48:40,580 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:48:40,580 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 172 transitions, 1504 flow. Second operand  has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:40,580 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:48:40,580 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:48:40,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:48:42,291 INFO  L124   PetriNetUnfolderBase]: 2206/3399 cut-off events.
[2024-06-14 14:48:42,291 INFO  L125   PetriNetUnfolderBase]: For 196873/196881 co-relation queries the response was YES.
[2024-06-14 14:48:42,305 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25453 conditions, 3399 events. 2206/3399 cut-off events. For 196873/196881 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17365 event pairs, 595 based on Foata normal form. 7/3403 useless extension candidates. Maximal degree in co-relation 25387. Up to 3089 conditions per place. 
[2024-06-14 14:48:42,320 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 149 selfloop transitions, 51 changer transitions 0/205 dead transitions.
[2024-06-14 14:48:42,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 205 transitions, 2068 flow
[2024-06-14 14:48:42,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:48:42,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:48:42,323 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-06-14 14:48:42,323 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48579545454545453
[2024-06-14 14:48:42,323 INFO  L175             Difference]: Start difference. First operand has 152 places, 172 transitions, 1504 flow. Second operand 8 states and 171 transitions.
[2024-06-14 14:48:42,323 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 205 transitions, 2068 flow
[2024-06-14 14:48:42,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 205 transitions, 1951 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-14 14:48:42,421 INFO  L231             Difference]: Finished difference. Result has 152 places, 177 transitions, 1594 flow
[2024-06-14 14:48:42,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1594, PETRI_PLACES=152, PETRI_TRANSITIONS=177}
[2024-06-14 14:48:42,422 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 107 predicate places.
[2024-06-14 14:48:42,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 177 transitions, 1594 flow
[2024-06-14 14:48:42,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:42,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:48:42,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:48:42,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 14:48:42,422 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:48:42,423 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:48:42,423 INFO  L85        PathProgramCache]: Analyzing trace with hash -302782953, now seen corresponding path program 8 times
[2024-06-14 14:48:42,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:48:42,423 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672518900]
[2024-06-14 14:48:42,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:48:42,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:48:42,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:48:56,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:48:56,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:48:56,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672518900]
[2024-06-14 14:48:56,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672518900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:48:56,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:48:56,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:48:56,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903308818]
[2024-06-14 14:48:56,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:48:56,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:48:56,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:48:56,730 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:48:56,730 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:48:56,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:48:56,875 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 177 transitions, 1594 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:56,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:48:56,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:48:56,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:48:58,837 INFO  L124   PetriNetUnfolderBase]: 2223/3431 cut-off events.
[2024-06-14 14:48:58,838 INFO  L125   PetriNetUnfolderBase]: For 207906/207914 co-relation queries the response was YES.
[2024-06-14 14:48:58,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26055 conditions, 3431 events. 2223/3431 cut-off events. For 207906/207914 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17586 event pairs, 605 based on Foata normal form. 7/3435 useless extension candidates. Maximal degree in co-relation 25989. Up to 3116 conditions per place. 
[2024-06-14 14:48:58,864 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 151 selfloop transitions, 51 changer transitions 0/207 dead transitions.
[2024-06-14 14:48:58,865 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 207 transitions, 2130 flow
[2024-06-14 14:48:58,865 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:48:58,865 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:48:58,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 14:48:58,866 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4393939393939394
[2024-06-14 14:48:58,866 INFO  L175             Difference]: Start difference. First operand has 152 places, 177 transitions, 1594 flow. Second operand 9 states and 174 transitions.
[2024-06-14 14:48:58,866 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 207 transitions, 2130 flow
[2024-06-14 14:48:58,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 207 transitions, 1955 flow, removed 29 selfloop flow, removed 7 redundant places.
[2024-06-14 14:48:59,000 INFO  L231             Difference]: Finished difference. Result has 154 places, 179 transitions, 1594 flow
[2024-06-14 14:48:59,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1594, PETRI_PLACES=154, PETRI_TRANSITIONS=179}
[2024-06-14 14:48:59,001 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places.
[2024-06-14 14:48:59,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 179 transitions, 1594 flow
[2024-06-14 14:48:59,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:48:59,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:48:59,001 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:48:59,001 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 14:48:59,001 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:48:59,002 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:48:59,002 INFO  L85        PathProgramCache]: Analyzing trace with hash -302773653, now seen corresponding path program 9 times
[2024-06-14 14:48:59,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:48:59,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889774505]
[2024-06-14 14:48:59,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:48:59,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:48:59,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:49:13,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:49:13,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:49:13,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889774505]
[2024-06-14 14:49:13,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889774505] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:49:13,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:49:13,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:49:13,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924087105]
[2024-06-14 14:49:13,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:49:13,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:49:13,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:49:13,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:49:13,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:49:13,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:49:13,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 179 transitions, 1594 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:49:13,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:49:13,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:49:13,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:49:15,250 INFO  L124   PetriNetUnfolderBase]: 2240/3458 cut-off events.
[2024-06-14 14:49:15,250 INFO  L125   PetriNetUnfolderBase]: For 218517/218525 co-relation queries the response was YES.
[2024-06-14 14:49:15,261 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26466 conditions, 3458 events. 2240/3458 cut-off events. For 218517/218525 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17743 event pairs, 605 based on Foata normal form. 7/3462 useless extension candidates. Maximal degree in co-relation 26400. Up to 3084 conditions per place. 
[2024-06-14 14:49:15,274 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 149 selfloop transitions, 56 changer transitions 0/210 dead transitions.
[2024-06-14 14:49:15,274 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 210 transitions, 2142 flow
[2024-06-14 14:49:15,276 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:49:15,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:49:15,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 14:49:15,277 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44191919191919193
[2024-06-14 14:49:15,277 INFO  L175             Difference]: Start difference. First operand has 154 places, 179 transitions, 1594 flow. Second operand 9 states and 175 transitions.
[2024-06-14 14:49:15,277 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 210 transitions, 2142 flow
[2024-06-14 14:49:15,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 210 transitions, 1973 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-14 14:49:15,393 INFO  L231             Difference]: Finished difference. Result has 157 places, 181 transitions, 1614 flow
[2024-06-14 14:49:15,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1614, PETRI_PLACES=157, PETRI_TRANSITIONS=181}
[2024-06-14 14:49:15,394 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 112 predicate places.
[2024-06-14 14:49:15,394 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 181 transitions, 1614 flow
[2024-06-14 14:49:15,394 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:49:15,395 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:49:15,395 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:49:15,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 14:49:15,395 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:49:15,395 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:49:15,395 INFO  L85        PathProgramCache]: Analyzing trace with hash -1414140137, now seen corresponding path program 10 times
[2024-06-14 14:49:15,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:49:15,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293283594]
[2024-06-14 14:49:15,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:49:15,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:49:15,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:49:31,365 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:49:31,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:49:31,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293283594]
[2024-06-14 14:49:31,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293283594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:49:31,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:49:31,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:49:31,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918449825]
[2024-06-14 14:49:31,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:49:31,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:49:31,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:49:31,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:49:31,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:49:31,545 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-14 14:49:31,546 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 181 transitions, 1614 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:49:31,546 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:49:31,546 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-14 14:49:31,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:49:33,523 INFO  L124   PetriNetUnfolderBase]: 2232/3456 cut-off events.
[2024-06-14 14:49:33,523 INFO  L125   PetriNetUnfolderBase]: For 225077/225085 co-relation queries the response was YES.
[2024-06-14 14:49:33,536 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26460 conditions, 3456 events. 2232/3456 cut-off events. For 225077/225085 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 17864 event pairs, 554 based on Foata normal form. 7/3460 useless extension candidates. Maximal degree in co-relation 26393. Up to 2854 conditions per place. 
[2024-06-14 14:49:33,551 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 131 selfloop transitions, 77 changer transitions 0/213 dead transitions.
[2024-06-14 14:49:33,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 213 transitions, 2174 flow
[2024-06-14 14:49:33,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:49:33,553 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:49:33,554 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 14:49:33,554 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4393939393939394
[2024-06-14 14:49:33,554 INFO  L175             Difference]: Start difference. First operand has 157 places, 181 transitions, 1614 flow. Second operand 9 states and 174 transitions.
[2024-06-14 14:49:33,554 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 213 transitions, 2174 flow
[2024-06-14 14:49:33,692 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 213 transitions, 2003 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-14 14:49:33,695 INFO  L231             Difference]: Finished difference. Result has 159 places, 183 transitions, 1678 flow
[2024-06-14 14:49:33,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1678, PETRI_PLACES=159, PETRI_TRANSITIONS=183}
[2024-06-14 14:49:33,695 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 114 predicate places.
[2024-06-14 14:49:33,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 183 transitions, 1678 flow
[2024-06-14 14:49:33,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:49:33,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:49:33,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:49:33,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 14:49:33,696 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:49:33,697 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:49:33,697 INFO  L85        PathProgramCache]: Analyzing trace with hash 1258521810, now seen corresponding path program 2 times
[2024-06-14 14:49:33,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:49:33,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853855665]
[2024-06-14 14:49:33,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:49:33,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:49:33,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:49:51,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:49:51,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:49:51,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853855665]
[2024-06-14 14:49:51,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853855665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:49:51,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:49:51,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:49:51,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856616155]
[2024-06-14 14:49:51,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:49:51,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:49:51,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:49:51,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:49:51,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:49:51,986 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-14 14:49:51,986 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 183 transitions, 1678 flow. Second operand  has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:49:51,986 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:49:51,986 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-14 14:49:51,986 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:49:53,411 INFO  L124   PetriNetUnfolderBase]: 1988/3178 cut-off events.
[2024-06-14 14:49:53,411 INFO  L125   PetriNetUnfolderBase]: For 228748/228756 co-relation queries the response was YES.
[2024-06-14 14:49:53,424 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25215 conditions, 3178 events. 1988/3178 cut-off events. For 228748/228756 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17108 event pairs, 591 based on Foata normal form. 7/3161 useless extension candidates. Maximal degree in co-relation 25147. Up to 2812 conditions per place. 
[2024-06-14 14:49:53,438 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 142 selfloop transitions, 26 changer transitions 0/202 dead transitions.
[2024-06-14 14:49:53,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 202 transitions, 2232 flow
[2024-06-14 14:49:53,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:49:53,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:49:53,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-14 14:49:53,440 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4707792207792208
[2024-06-14 14:49:53,440 INFO  L175             Difference]: Start difference. First operand has 159 places, 183 transitions, 1678 flow. Second operand 7 states and 145 transitions.
[2024-06-14 14:49:53,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 202 transitions, 2232 flow
[2024-06-14 14:49:53,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 202 transitions, 2015 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-14 14:49:53,549 INFO  L231             Difference]: Finished difference. Result has 160 places, 191 transitions, 1644 flow
[2024-06-14 14:49:53,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1644, PETRI_PLACES=160, PETRI_TRANSITIONS=191}
[2024-06-14 14:49:53,551 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 115 predicate places.
[2024-06-14 14:49:53,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 191 transitions, 1644 flow
[2024-06-14 14:49:53,551 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:49:53,551 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:49:53,551 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:49:53,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 14:49:53,552 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:49:53,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:49:53,552 INFO  L85        PathProgramCache]: Analyzing trace with hash 596427044, now seen corresponding path program 3 times
[2024-06-14 14:49:53,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:49:53,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413447984]
[2024-06-14 14:49:53,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:49:53,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:49:53,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:10,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:50:10,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:10,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413447984]
[2024-06-14 14:50:10,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413447984] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:10,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:10,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:50:10,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264075426]
[2024-06-14 14:50:10,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:10,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:50:10,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:10,918 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:50:10,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:50:11,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44
[2024-06-14 14:50:11,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 191 transitions, 1644 flow. Second operand  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:11,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:11,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44
[2024-06-14 14:50:11,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:12,566 INFO  L124   PetriNetUnfolderBase]: 2088/3288 cut-off events.
[2024-06-14 14:50:12,566 INFO  L125   PetriNetUnfolderBase]: For 240535/240543 co-relation queries the response was YES.
[2024-06-14 14:50:12,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26291 conditions, 3288 events. 2088/3288 cut-off events. For 240535/240543 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17350 event pairs, 598 based on Foata normal form. 4/3282 useless extension candidates. Maximal degree in co-relation 26221. Up to 3067 conditions per place. 
[2024-06-14 14:50:12,591 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 167 selfloop transitions, 26 changer transitions 0/204 dead transitions.
[2024-06-14 14:50:12,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 204 transitions, 2124 flow
[2024-06-14 14:50:12,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:50:12,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:50:12,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-14 14:50:12,594 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:50:12,594 INFO  L175             Difference]: Start difference. First operand has 160 places, 191 transitions, 1644 flow. Second operand 7 states and 132 transitions.
[2024-06-14 14:50:12,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 204 transitions, 2124 flow
[2024-06-14 14:50:12,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 204 transitions, 2060 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-14 14:50:12,696 INFO  L231             Difference]: Finished difference. Result has 164 places, 194 transitions, 1714 flow
[2024-06-14 14:50:12,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1714, PETRI_PLACES=164, PETRI_TRANSITIONS=194}
[2024-06-14 14:50:12,697 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 119 predicate places.
[2024-06-14 14:50:12,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1714 flow
[2024-06-14 14:50:12,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:12,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:12,697 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:12,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 14:50:12,698 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:50:12,698 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:12,698 INFO  L85        PathProgramCache]: Analyzing trace with hash 1264454320, now seen corresponding path program 3 times
[2024-06-14 14:50:12,698 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:12,698 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860559575]
[2024-06-14 14:50:12,698 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:12,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:12,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:32,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:50:32,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:32,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860559575]
[2024-06-14 14:50:32,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860559575] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:32,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:32,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:50:32,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499875317]
[2024-06-14 14:50:32,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:32,094 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:50:32,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:32,094 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:50:32,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:50:32,316 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:50:32,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 194 transitions, 1714 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:32,316 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:32,316 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:50:32,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:33,962 INFO  L124   PetriNetUnfolderBase]: 1974/3172 cut-off events.
[2024-06-14 14:50:33,963 INFO  L125   PetriNetUnfolderBase]: For 244827/244835 co-relation queries the response was YES.
[2024-06-14 14:50:33,976 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25626 conditions, 3172 events. 1974/3172 cut-off events. For 244827/244835 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17167 event pairs, 591 based on Foata normal form. 7/3169 useless extension candidates. Maximal degree in co-relation 25554. Up to 2807 conditions per place. 
[2024-06-14 14:50:33,990 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 151 selfloop transitions, 19 changer transitions 0/205 dead transitions.
[2024-06-14 14:50:33,990 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 205 transitions, 2085 flow
[2024-06-14 14:50:33,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:50:33,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:50:33,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 14:50:33,993 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-14 14:50:33,993 INFO  L175             Difference]: Start difference. First operand has 164 places, 194 transitions, 1714 flow. Second operand 7 states and 136 transitions.
[2024-06-14 14:50:33,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 205 transitions, 2085 flow
[2024-06-14 14:50:34,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 205 transitions, 1943 flow, removed 47 selfloop flow, removed 5 redundant places.
[2024-06-14 14:50:34,104 INFO  L231             Difference]: Finished difference. Result has 166 places, 195 transitions, 1625 flow
[2024-06-14 14:50:34,105 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1625, PETRI_PLACES=166, PETRI_TRANSITIONS=195}
[2024-06-14 14:50:34,105 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 121 predicate places.
[2024-06-14 14:50:34,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 195 transitions, 1625 flow
[2024-06-14 14:50:34,105 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:34,105 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:34,106 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:34,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 14:50:34,106 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:50:34,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:34,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1087448660, now seen corresponding path program 1 times
[2024-06-14 14:50:34,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:34,106 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229805579]
[2024-06-14 14:50:34,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:34,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:34,165 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:50:52,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:50:52,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:50:52,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229805579]
[2024-06-14 14:50:52,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229805579] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:50:52,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:50:52,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:50:52,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731573135]
[2024-06-14 14:50:52,591 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:50:52,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:50:52,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:50:52,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:50:52,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:50:52,849 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:50:52,849 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 195 transitions, 1625 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:52,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:50:52,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:50:52,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:50:54,488 INFO  L124   PetriNetUnfolderBase]: 1986/3191 cut-off events.
[2024-06-14 14:50:54,488 INFO  L125   PetriNetUnfolderBase]: For 252728/252728 co-relation queries the response was YES.
[2024-06-14 14:50:54,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25552 conditions, 3191 events. 1986/3191 cut-off events. For 252728/252728 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17193 event pairs, 528 based on Foata normal form. 1/3190 useless extension candidates. Maximal degree in co-relation 25479. Up to 2782 conditions per place. 
[2024-06-14 14:50:54,515 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 166 selfloop transitions, 14 changer transitions 0/214 dead transitions.
[2024-06-14 14:50:54,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 214 transitions, 2077 flow
[2024-06-14 14:50:54,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:50:54,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:50:54,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-14 14:50:54,517 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-14 14:50:54,517 INFO  L175             Difference]: Start difference. First operand has 166 places, 195 transitions, 1625 flow. Second operand 7 states and 140 transitions.
[2024-06-14 14:50:54,517 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 214 transitions, 2077 flow
[2024-06-14 14:50:54,747 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 214 transitions, 2035 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-14 14:50:54,750 INFO  L231             Difference]: Finished difference. Result has 168 places, 198 transitions, 1675 flow
[2024-06-14 14:50:54,750 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1675, PETRI_PLACES=168, PETRI_TRANSITIONS=198}
[2024-06-14 14:50:54,750 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 123 predicate places.
[2024-06-14 14:50:54,751 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 198 transitions, 1675 flow
[2024-06-14 14:50:54,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:50:54,751 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:50:54,751 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:50:54,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 14:50:54,751 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:50:54,752 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:50:54,752 INFO  L85        PathProgramCache]: Analyzing trace with hash 332553354, now seen corresponding path program 1 times
[2024-06-14 14:50:54,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:50:54,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699657021]
[2024-06-14 14:50:54,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:50:54,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:50:54,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:14,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:14,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:14,219 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699657021]
[2024-06-14 14:51:14,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699657021] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:14,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:14,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:51:14,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869006900]
[2024-06-14 14:51:14,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:14,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:51:14,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:14,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:51:14,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:51:14,507 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-14 14:51:14,507 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 198 transitions, 1675 flow. Second operand  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:14,508 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:14,508 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-14 14:51:14,508 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:16,167 INFO  L124   PetriNetUnfolderBase]: 2001/3214 cut-off events.
[2024-06-14 14:51:16,168 INFO  L125   PetriNetUnfolderBase]: For 266440/266440 co-relation queries the response was YES.
[2024-06-14 14:51:16,187 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26160 conditions, 3214 events. 2001/3214 cut-off events. For 266440/266440 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17325 event pairs, 526 based on Foata normal form. 4/3216 useless extension candidates. Maximal degree in co-relation 26086. Up to 2801 conditions per place. 
[2024-06-14 14:51:16,207 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 167 selfloop transitions, 15 changer transitions 0/216 dead transitions.
[2024-06-14 14:51:16,207 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 216 transitions, 2119 flow
[2024-06-14 14:51:16,208 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:51:16,208 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:51:16,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-14 14:51:16,209 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4512987012987013
[2024-06-14 14:51:16,209 INFO  L175             Difference]: Start difference. First operand has 168 places, 198 transitions, 1675 flow. Second operand 7 states and 139 transitions.
[2024-06-14 14:51:16,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 216 transitions, 2119 flow
[2024-06-14 14:51:16,523 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 216 transitions, 2049 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-14 14:51:16,527 INFO  L231             Difference]: Finished difference. Result has 170 places, 202 transitions, 1694 flow
[2024-06-14 14:51:16,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1694, PETRI_PLACES=170, PETRI_TRANSITIONS=202}
[2024-06-14 14:51:16,528 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 125 predicate places.
[2024-06-14 14:51:16,528 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 202 transitions, 1694 flow
[2024-06-14 14:51:16,528 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:16,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:16,529 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:16,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 14:51:16,529 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:16,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:16,529 INFO  L85        PathProgramCache]: Analyzing trace with hash 1264937486, now seen corresponding path program 2 times
[2024-06-14 14:51:16,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:16,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898632899]
[2024-06-14 14:51:16,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:16,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:16,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15