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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
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/mix038.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix038.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-bcb38a6-m
[2024-06-04 17:15:56,129 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 17:15:56,164 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 17:15:56,167 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 17:15:56,167 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 17:15:56,196 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 17:15:56,196 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 17:15:56,197 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 17:15:56,197 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 17:15:56,197 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 17:15:56,198 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 17:15:56,198 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 17:15:56,198 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 17:15:56,198 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 17:15:56,199 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 17:15:56,199 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 17:15:56,199 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 17:15:56,199 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 17:15:56,199 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 17:15:56,200 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 17:15:56,200 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 17:15:56,212 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 17:15:56,212 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 17:15:56,213 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 17:15:56,213 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 17:15:56,213 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 17:15:56,213 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 17:15:56,213 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 17:15:56,214 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 17:15:56,214 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 17:15:56,215 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 17:15:56,215 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 17:15:56,215 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:15:56,215 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 17:15:56,216 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 17:15:56,216 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 17:15:56,216 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 17:15:56,216 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 17:15:56,217 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 17:15:56,217 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 17:15:56,217 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 17:15:56,217 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 17:15:56,217 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 17:15:56,218 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-04 17:15:56,436 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 17:15:56,459 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 17:15:56,461 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 17:15:56,462 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 17:15:56,463 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 17:15:56,463 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/mix038.opt.yml/witness.yml
[2024-06-04 17:15:56,629 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 17:15:56,629 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 17:15:56,630 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i
[2024-06-04 17:15:57,802 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 17:15:57,982 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 17:15:57,983 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i
[2024-06-04 17:15:57,995 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0074d9bd9/7942ea4891aa41bdaf17af5c85c762cf/FLAGb5a103695
[2024-06-04 17:15:58,007 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0074d9bd9/7942ea4891aa41bdaf17af5c85c762cf
[2024-06-04 17:15:58,007 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 17:15:58,008 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 17:15:58,009 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 17:15:58,009 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 17:15:58,013 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 17:15:58,013 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:15:56" (1/2) ...
[2024-06-04 17:15:58,014 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c65cc1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:58, skipping insertion in model container
[2024-06-04 17:15:58,014 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:15:56" (1/2) ...
[2024-06-04 17:15:58,015 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1aae8e31 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:15:58, skipping insertion in model container
[2024-06-04 17:15:58,015 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:15:58" (2/2) ...
[2024-06-04 17:15:58,016 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c65cc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58, skipping insertion in model container
[2024-06-04 17:15:58,016 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:15:58" (2/2) ...
[2024-06-04 17:15:58,016 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 17:15:58,083 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 17:15:58,084 INFO  L97    edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 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_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__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)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-04 17:15:58,085 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 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_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__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)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-04 17:15:58,086 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((((! multithreaded || y$r_buff0_thd1 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 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 )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff0_thd3 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd3 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 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_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 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_EBX) - (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff0_thd2 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd2 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__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)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-04 17:15:58,086 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 17:15:58,086 INFO  L106   edCorrectnessWitness]: ghost_update [L834-L834] multithreaded = 1;
[2024-06-04 17:15:58,126 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 17:15:58,462 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:15:58,472 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 17:15:58,742 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 17:15:58,827 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 17:15:58,828 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58 WrapperNode
[2024-06-04 17:15:58,828 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 17:15:58,829 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 17:15:58,829 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 17:15:58,829 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 17:15:58,835 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:58,905 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:58,993 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133
[2024-06-04 17:15:58,993 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 17:15:58,994 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 17:15:58,995 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 17:15:58,995 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 17:15:59,010 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,010 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,038 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,078 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-04 17:15:59,079 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,079 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,119 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,120 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,142 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,146 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,176 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 17:15:59,178 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 17:15:59,178 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 17:15:59,178 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 17:15:59,179 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (1/1) ...
[2024-06-04 17:15:59,183 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 17:15:59,190 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 17:15:59,204 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-04 17:15:59,236 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-04 17:15:59,261 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 17:15:59,261 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 17:15:59,261 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 17:15:59,261 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 17:15:59,261 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 17:15:59,262 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 17:15:59,262 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 17:15:59,262 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 17:15:59,262 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 17:15:59,262 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 17:15:59,263 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 17:15:59,263 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 17:15:59,265 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 17:15:59,387 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 17:15:59,389 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 17:16:00,638 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 17:16:00,639 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 17:16:00,893 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 17:16:00,893 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 17:16:00,894 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:16:00 BoogieIcfgContainer
[2024-06-04 17:16:00,894 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 17:16:00,897 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 17:16:00,898 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 17:16:00,900 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 17:16:00,900 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:15:56" (1/4) ...
[2024-06-04 17:16:00,901 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644efcb8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:16:00, skipping insertion in model container
[2024-06-04 17:16:00,901 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:15:58" (2/4) ...
[2024-06-04 17:16:00,902 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644efcb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:16:00, skipping insertion in model container
[2024-06-04 17:16:00,902 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:15:58" (3/4) ...
[2024-06-04 17:16:00,902 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644efcb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:16:00, skipping insertion in model container
[2024-06-04 17:16:00,902 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:16:00" (4/4) ...
[2024-06-04 17:16:00,903 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix038.opt.i
[2024-06-04 17:16:00,916 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 17:16:00,916 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 17:16:00,916 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 17:16:01,040 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 17:16:01,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-04 17:16:01,122 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-04 17:16:01,123 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:16:01,125 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 17:16:01,125 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-04 17:16:01,128 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-04 17:16:01,140 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 17:16:01,146 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;@1452f475, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 17:16:01,146 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 17:16:01,154 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 17:16:01,154 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-04 17:16:01,154 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 17:16:01,154 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:01,155 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:01,155 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-04 17:16:01,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:01,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -1743886950, now seen corresponding path program 1 times
[2024-06-04 17:16:01,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:01,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826967765]
[2024-06-04 17:16:01,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:01,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:01,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:07,451 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-04 17:16:07,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:07,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826967765]
[2024-06-04 17:16:07,453 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826967765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:07,453 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:07,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 17:16:07,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141922572]
[2024-06-04 17:16:07,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:07,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 17:16:07,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:07,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 17:16:07,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 17:16:07,576 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43
[2024-06-04 17:16:07,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-04 17:16:07,578 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:07,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43
[2024-06-04 17:16:07,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:08,391 INFO  L124   PetriNetUnfolderBase]: 1116/1802 cut-off events.
[2024-06-04 17:16:08,392 INFO  L125   PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES.
[2024-06-04 17:16:08,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3555 conditions, 1802 events. 1116/1802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9051 event pairs, 765 based on Foata normal form. 1/1733 useless extension candidates. Maximal degree in co-relation 3540. Up to 1676 conditions per place. 
[2024-06-04 17:16:08,419 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-04 17:16:08,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 177 flow
[2024-06-04 17:16:08,420 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 17:16:08,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 17:16:08,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions.
[2024-06-04 17:16:08,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6124031007751938
[2024-06-04 17:16:08,429 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 79 transitions.
[2024-06-04 17:16:08,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 177 flow
[2024-06-04 17:16:08,431 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 17:16:08,433 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-04 17:16:08,434 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-04 17:16:08,436 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-04 17:16:08,437 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-04 17:16:08,437 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-04 17:16:08,437 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:08,437 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:08,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 17:16:08,437 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-04 17:16:08,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:08,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -838079111, now seen corresponding path program 1 times
[2024-06-04 17:16:08,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:08,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395195295]
[2024-06-04 17:16:08,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:08,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:08,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:13,083 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-04 17:16:13,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:13,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395195295]
[2024-06-04 17:16:13,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395195295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:13,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:13,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 17:16:13,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15600200]
[2024-06-04 17:16:13,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:13,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 17:16:13,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:13,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 17:16:13,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-04 17:16:13,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:16:13,192 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-04 17:16:13,192 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:13,192 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:16:13,192 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:14,042 INFO  L124   PetriNetUnfolderBase]: 1280/1998 cut-off events.
[2024-06-04 17:16:14,043 INFO  L125   PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES.
[2024-06-04 17:16:14,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 1998 events. 1280/1998 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9816 event pairs, 750 based on Foata normal form. 3/1965 useless extension candidates. Maximal degree in co-relation 4506. Up to 1897 conditions per place. 
[2024-06-04 17:16:14,054 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 41 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-04 17:16:14,055 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 246 flow
[2024-06-04 17:16:14,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 17:16:14,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 17:16:14,057 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions.
[2024-06-04 17:16:14,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5755813953488372
[2024-06-04 17:16:14,058 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 99 transitions.
[2024-06-04 17:16:14,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 246 flow
[2024-06-04 17:16:14,059 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 17:16:14,061 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-04 17:16:14,062 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40}
[2024-06-04 17:16:14,062 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-04 17:16:14,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-04 17:16:14,063 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-04 17:16:14,063 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:14,063 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:14,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 17:16:14,066 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-04 17:16:14,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:14,067 INFO  L85        PathProgramCache]: Analyzing trace with hash -210647529, now seen corresponding path program 1 times
[2024-06-04 17:16:14,067 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:14,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711016073]
[2024-06-04 17:16:14,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:14,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:14,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:18,961 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-04 17:16:18,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:18,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711016073]
[2024-06-04 17:16:18,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711016073] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:18,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:18,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 17:16:18,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274560301]
[2024-06-04 17:16:18,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:18,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 17:16:18,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:18,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 17:16:18,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-04 17:16:19,071 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:16:19,072 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 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-04 17:16:19,072 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:19,072 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:16:19,072 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:20,032 INFO  L124   PetriNetUnfolderBase]: 1302/2077 cut-off events.
[2024-06-04 17:16:20,032 INFO  L125   PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES.
[2024-06-04 17:16:20,036 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5166 conditions, 2077 events. 1302/2077 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10516 event pairs, 470 based on Foata normal form. 7/2073 useless extension candidates. Maximal degree in co-relation 5149. Up to 1800 conditions per place. 
[2024-06-04 17:16:20,045 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 57 selfloop transitions, 16 changer transitions 0/79 dead transitions.
[2024-06-04 17:16:20,045 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 412 flow
[2024-06-04 17:16:20,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:16:20,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:16:20,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions.
[2024-06-04 17:16:20,047 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6139534883720931
[2024-06-04 17:16:20,047 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 132 transitions.
[2024-06-04 17:16:20,048 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 412 flow
[2024-06-04 17:16:20,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 398 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-04 17:16:20,050 INFO  L231             Difference]: Finished difference. Result has 52 places, 51 transitions, 239 flow
[2024-06-04 17:16:20,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=51}
[2024-06-04 17:16:20,051 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places.
[2024-06-04 17:16:20,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 239 flow
[2024-06-04 17:16:20,051 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-04 17:16:20,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:20,052 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:20,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 17:16:20,052 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-04 17:16:20,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:20,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -568775082, now seen corresponding path program 1 times
[2024-06-04 17:16:20,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:20,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877218113]
[2024-06-04 17:16:20,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:20,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:20,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:24,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:16:24,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:24,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877218113]
[2024-06-04 17:16:24,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877218113] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:24,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:24,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:16:24,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17474082]
[2024-06-04 17:16:24,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:24,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:16:24,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:24,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:16:24,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:16:24,820 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:16:24,820 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 239 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-04 17:16:24,820 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:24,820 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:16:24,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:25,770 INFO  L124   PetriNetUnfolderBase]: 1384/2221 cut-off events.
[2024-06-04 17:16:25,788 INFO  L125   PetriNetUnfolderBase]: For 2892/2892 co-relation queries the response was YES.
[2024-06-04 17:16:25,791 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 2221 events. 1384/2221 cut-off events. For 2892/2892 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11486 event pairs, 321 based on Foata normal form. 26/2234 useless extension candidates. Maximal degree in co-relation 6562. Up to 1764 conditions per place. 
[2024-06-04 17:16:25,805 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 65 selfloop transitions, 18 changer transitions 0/89 dead transitions.
[2024-06-04 17:16:25,805 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 529 flow
[2024-06-04 17:16:25,806 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:16:25,806 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:16:25,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions.
[2024-06-04 17:16:25,809 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5968992248062015
[2024-06-04 17:16:25,809 INFO  L175             Difference]: Start difference. First operand has 52 places, 51 transitions, 239 flow. Second operand 6 states and 154 transitions.
[2024-06-04 17:16:25,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 529 flow
[2024-06-04 17:16:25,815 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 521 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-04 17:16:25,817 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 287 flow
[2024-06-04 17:16:25,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-06-04 17:16:25,818 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places.
[2024-06-04 17:16:25,818 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 287 flow
[2024-06-04 17:16:25,818 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-04 17:16:25,819 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:25,819 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:25,819 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 17:16:25,819 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-04 17:16:25,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:25,819 INFO  L85        PathProgramCache]: Analyzing trace with hash -1208652322, now seen corresponding path program 1 times
[2024-06-04 17:16:25,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:25,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711461025]
[2024-06-04 17:16:25,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:25,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:25,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:37,079 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-04 17:16:37,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:37,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711461025]
[2024-06-04 17:16:37,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711461025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:37,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:37,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:16:37,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846219074]
[2024-06-04 17:16:37,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:37,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:16:37,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:37,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:16:37,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:16:37,182 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:16:37,182 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 287 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-04 17:16:37,182 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:37,182 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:16:37,182 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:38,154 INFO  L124   PetriNetUnfolderBase]: 1204/2038 cut-off events.
[2024-06-04 17:16:38,154 INFO  L125   PetriNetUnfolderBase]: For 3705/3705 co-relation queries the response was YES.
[2024-06-04 17:16:38,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6372 conditions, 2038 events. 1204/2038 cut-off events. For 3705/3705 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11049 event pairs, 447 based on Foata normal form. 4/2034 useless extension candidates. Maximal degree in co-relation 6349. Up to 1814 conditions per place. 
[2024-06-04 17:16:38,167 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 49 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2024-06-04 17:16:38,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 431 flow
[2024-06-04 17:16:38,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:16:38,167 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:16:38,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions.
[2024-06-04 17:16:38,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4930232558139535
[2024-06-04 17:16:38,169 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 287 flow. Second operand 5 states and 106 transitions.
[2024-06-04 17:16:38,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 431 flow
[2024-06-04 17:16:38,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 387 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 17:16:38,177 INFO  L231             Difference]: Finished difference. Result has 58 places, 52 transitions, 267 flow
[2024-06-04 17:16:38,177 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=58, PETRI_TRANSITIONS=52}
[2024-06-04 17:16:38,179 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places.
[2024-06-04 17:16:38,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 267 flow
[2024-06-04 17:16:38,181 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-04 17:16:38,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:38,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:38,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 17:16:38,182 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-04 17:16:38,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:38,182 INFO  L85        PathProgramCache]: Analyzing trace with hash -1880161743, now seen corresponding path program 1 times
[2024-06-04 17:16:38,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:38,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747706232]
[2024-06-04 17:16:38,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:38,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:38,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:16:50,016 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-04 17:16:50,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:16:50,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747706232]
[2024-06-04 17:16:50,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747706232] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:16:50,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:16:50,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:16:50,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50359002]
[2024-06-04 17:16:50,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:16:50,017 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:16:50,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:16:50,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:16:50,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:16:50,168 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:16:50,168 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 267 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-04 17:16:50,168 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:16:50,168 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:16:50,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:16:51,234 INFO  L124   PetriNetUnfolderBase]: 1386/2223 cut-off events.
[2024-06-04 17:16:51,234 INFO  L125   PetriNetUnfolderBase]: For 4743/4743 co-relation queries the response was YES.
[2024-06-04 17:16:51,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 2223 events. 1386/2223 cut-off events. For 4743/4743 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11474 event pairs, 459 based on Foata normal form. 8/2217 useless extension candidates. Maximal degree in co-relation 7054. Up to 1943 conditions per place. 
[2024-06-04 17:16:51,248 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 53 selfloop transitions, 19 changer transitions 0/78 dead transitions.
[2024-06-04 17:16:51,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 509 flow
[2024-06-04 17:16:51,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:16:51,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:16:51,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions.
[2024-06-04 17:16:51,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5077519379844961
[2024-06-04 17:16:51,250 INFO  L175             Difference]: Start difference. First operand has 58 places, 52 transitions, 267 flow. Second operand 6 states and 131 transitions.
[2024-06-04 17:16:51,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 509 flow
[2024-06-04 17:16:51,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 487 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 17:16:51,256 INFO  L231             Difference]: Finished difference. Result has 60 places, 55 transitions, 317 flow
[2024-06-04 17:16:51,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=60, PETRI_TRANSITIONS=55}
[2024-06-04 17:16:51,260 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places.
[2024-06-04 17:16:51,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 317 flow
[2024-06-04 17:16:51,260 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-04 17:16:51,260 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:16:51,261 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:16:51,261 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 17:16:51,261 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-04 17:16:51,262 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:16:51,262 INFO  L85        PathProgramCache]: Analyzing trace with hash -1873611753, now seen corresponding path program 2 times
[2024-06-04 17:16:51,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:16:51,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295866026]
[2024-06-04 17:16:51,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:16:51,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:16:51,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:03,441 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-04 17:17:03,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:03,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295866026]
[2024-06-04 17:17:03,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295866026] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:03,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:03,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:17:03,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623316673]
[2024-06-04 17:17:03,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:03,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:17:03,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:03,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:17:03,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:17:03,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:17:03,555 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 317 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-04 17:17:03,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:03,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:17:03,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:04,576 INFO  L124   PetriNetUnfolderBase]: 1354/2152 cut-off events.
[2024-06-04 17:17:04,576 INFO  L125   PetriNetUnfolderBase]: For 5808/5808 co-relation queries the response was YES.
[2024-06-04 17:17:04,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7154 conditions, 2152 events. 1354/2152 cut-off events. For 5808/5808 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10870 event pairs, 469 based on Foata normal form. 4/2141 useless extension candidates. Maximal degree in co-relation 7129. Up to 1895 conditions per place. 
[2024-06-04 17:17:04,586 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 47 selfloop transitions, 20 changer transitions 0/73 dead transitions.
[2024-06-04 17:17:04,587 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 495 flow
[2024-06-04 17:17:04,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:17:04,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:17:04,588 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions.
[2024-06-04 17:17:04,588 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49224806201550386
[2024-06-04 17:17:04,588 INFO  L175             Difference]: Start difference. First operand has 60 places, 55 transitions, 317 flow. Second operand 6 states and 127 transitions.
[2024-06-04 17:17:04,588 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 495 flow
[2024-06-04 17:17:04,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 73 transitions, 466 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:17:04,592 INFO  L231             Difference]: Finished difference. Result has 63 places, 55 transitions, 336 flow
[2024-06-04 17:17:04,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=55}
[2024-06-04 17:17:04,593 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places.
[2024-06-04 17:17:04,593 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 336 flow
[2024-06-04 17:17:04,593 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-04 17:17:04,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:04,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:04,594 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 17:17:04,594 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:17:04,594 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:04,594 INFO  L85        PathProgramCache]: Analyzing trace with hash -1666816423, now seen corresponding path program 1 times
[2024-06-04 17:17:04,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:04,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744660597]
[2024-06-04 17:17:04,595 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:04,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:04,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:16,213 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-04 17:17:16,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:16,214 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744660597]
[2024-06-04 17:17:16,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744660597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:16,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:16,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:17:16,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15570247]
[2024-06-04 17:17:16,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:16,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:17:16,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:16,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:17:16,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:17:16,410 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:17:16,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 336 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-04 17:17:16,411 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:16,411 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:17:16,411 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:17,390 INFO  L124   PetriNetUnfolderBase]: 1176/1973 cut-off events.
[2024-06-04 17:17:17,416 INFO  L125   PetriNetUnfolderBase]: For 6120/6120 co-relation queries the response was YES.
[2024-06-04 17:17:17,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 1973 events. 1176/1973 cut-off events. For 6120/6120 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10414 event pairs, 406 based on Foata normal form. 4/1963 useless extension candidates. Maximal degree in co-relation 6536. Up to 1742 conditions per place. 
[2024-06-04 17:17:17,430 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 60 selfloop transitions, 13 changer transitions 0/80 dead transitions.
[2024-06-04 17:17:17,430 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 569 flow
[2024-06-04 17:17:17,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:17:17,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:17:17,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-04 17:17:17,432 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-04 17:17:17,432 INFO  L175             Difference]: Start difference. First operand has 63 places, 55 transitions, 336 flow. Second operand 7 states and 143 transitions.
[2024-06-04 17:17:17,432 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 569 flow
[2024-06-04 17:17:17,436 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 499 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-04 17:17:17,453 INFO  L231             Difference]: Finished difference. Result has 65 places, 60 transitions, 346 flow
[2024-06-04 17:17:17,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=65, PETRI_TRANSITIONS=60}
[2024-06-04 17:17:17,455 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places.
[2024-06-04 17:17:17,455 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 346 flow
[2024-06-04 17:17:17,456 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-04 17:17:17,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:17,456 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:17,456 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 17:17:17,456 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:17:17,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:17,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -1850510522, now seen corresponding path program 1 times
[2024-06-04 17:17:17,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:17,457 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573368015]
[2024-06-04 17:17:17,457 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:17,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:17,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:29,638 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-04 17:17:29,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:29,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573368015]
[2024-06-04 17:17:29,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573368015] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:29,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:29,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 17:17:29,640 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451750618]
[2024-06-04 17:17:29,640 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:29,640 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 17:17:29,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:29,641 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 17:17:29,641 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-04 17:17:29,771 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:17:29,772 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 346 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:29,772 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:29,772 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:17:29,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:30,484 INFO  L124   PetriNetUnfolderBase]: 1173/1969 cut-off events.
[2024-06-04 17:17:30,484 INFO  L125   PetriNetUnfolderBase]: For 6996/6996 co-relation queries the response was YES.
[2024-06-04 17:17:30,488 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6810 conditions, 1969 events. 1173/1969 cut-off events. For 6996/6996 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10372 event pairs, 420 based on Foata normal form. 1/1956 useless extension candidates. Maximal degree in co-relation 6782. Up to 1771 conditions per place. 
[2024-06-04 17:17:30,493 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 56 selfloop transitions, 8 changer transitions 0/71 dead transitions.
[2024-06-04 17:17:30,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 514 flow
[2024-06-04 17:17:30,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 17:17:30,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 17:17:30,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions.
[2024-06-04 17:17:30,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4697674418604651
[2024-06-04 17:17:30,495 INFO  L175             Difference]: Start difference. First operand has 65 places, 60 transitions, 346 flow. Second operand 5 states and 101 transitions.
[2024-06-04 17:17:30,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 514 flow
[2024-06-04 17:17:30,499 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 481 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-04 17:17:30,500 INFO  L231             Difference]: Finished difference. Result has 66 places, 63 transitions, 361 flow
[2024-06-04 17:17:30,500 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=66, PETRI_TRANSITIONS=63}
[2024-06-04 17:17:30,501 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places.
[2024-06-04 17:17:30,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 361 flow
[2024-06-04 17:17:30,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:17:30,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:30,501 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:30,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 17:17:30,502 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:17:30,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:30,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -1564318406, now seen corresponding path program 1 times
[2024-06-04 17:17:30,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:30,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847394406]
[2024-06-04 17:17:30,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:30,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:30,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:43,024 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-04 17:17:43,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:43,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847394406]
[2024-06-04 17:17:43,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847394406] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:43,025 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:43,025 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:17:43,025 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438732287]
[2024-06-04 17:17:43,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:43,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:17:43,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:43,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:17:43,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:17:43,174 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:17:43,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 361 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-04 17:17:43,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:43,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:17:43,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:43,939 INFO  L124   PetriNetUnfolderBase]: 1340/2155 cut-off events.
[2024-06-04 17:17:43,940 INFO  L125   PetriNetUnfolderBase]: For 9912/9912 co-relation queries the response was YES.
[2024-06-04 17:17:43,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7955 conditions, 2155 events. 1340/2155 cut-off events. For 9912/9912 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10986 event pairs, 492 based on Foata normal form. 1/2155 useless extension candidates. Maximal degree in co-relation 7926. Up to 2009 conditions per place. 
[2024-06-04 17:17:43,948 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 58 selfloop transitions, 11 changer transitions 0/75 dead transitions.
[2024-06-04 17:17:43,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 545 flow
[2024-06-04 17:17:43,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:17:43,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:17:43,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-04 17:17:43,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43410852713178294
[2024-06-04 17:17:43,950 INFO  L175             Difference]: Start difference. First operand has 66 places, 63 transitions, 361 flow. Second operand 6 states and 112 transitions.
[2024-06-04 17:17:43,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 545 flow
[2024-06-04 17:17:43,954 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 519 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-04 17:17:43,955 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 393 flow
[2024-06-04 17:17:43,956 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-06-04 17:17:43,956 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places.
[2024-06-04 17:17:43,956 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 393 flow
[2024-06-04 17:17:43,956 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-04 17:17:43,957 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:43,957 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:43,957 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 17:17:43,957 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-04 17:17:43,957 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:43,957 INFO  L85        PathProgramCache]: Analyzing trace with hash 1432728446, now seen corresponding path program 1 times
[2024-06-04 17:17:43,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:43,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550655907]
[2024-06-04 17:17:43,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:43,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:43,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:17:57,516 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-04 17:17:57,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:17:57,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550655907]
[2024-06-04 17:17:57,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550655907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:17:57,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:17:57,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:17:57,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909264466]
[2024-06-04 17:17:57,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:17:57,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:17:57,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:17:57,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:17:57,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:17:57,691 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:17:57,692 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 393 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-04 17:17:57,692 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:17:57,692 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:17:57,692 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:17:58,863 INFO  L124   PetriNetUnfolderBase]: 1543/2447 cut-off events.
[2024-06-04 17:17:58,863 INFO  L125   PetriNetUnfolderBase]: For 16170/16172 co-relation queries the response was YES.
[2024-06-04 17:17:58,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 2447 events. 1543/2447 cut-off events. For 16170/16172 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12646 event pairs, 357 based on Foata normal form. 16/2457 useless extension candidates. Maximal degree in co-relation 9763. Up to 1728 conditions per place. 
[2024-06-04 17:17:58,873 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 74 selfloop transitions, 22 changer transitions 0/103 dead transitions.
[2024-06-04 17:17:58,873 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 743 flow
[2024-06-04 17:17:58,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:17:58,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:17:58,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-04 17:17:58,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5116279069767442
[2024-06-04 17:17:58,876 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 393 flow. Second operand 7 states and 154 transitions.
[2024-06-04 17:17:58,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 743 flow
[2024-06-04 17:17:58,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 103 transitions, 707 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-04 17:17:58,883 INFO  L231             Difference]: Finished difference. Result has 72 places, 68 transitions, 433 flow
[2024-06-04 17:17:58,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=433, PETRI_PLACES=72, PETRI_TRANSITIONS=68}
[2024-06-04 17:17:58,883 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places.
[2024-06-04 17:17:58,884 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 68 transitions, 433 flow
[2024-06-04 17:17:58,884 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-04 17:17:58,884 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:17:58,884 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:17:58,884 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 17:17:58,884 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-04 17:17:58,885 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:17:58,885 INFO  L85        PathProgramCache]: Analyzing trace with hash 1435585406, now seen corresponding path program 2 times
[2024-06-04 17:17:58,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:17:58,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914030871]
[2024-06-04 17:17:58,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:17:58,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:17:58,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:12,834 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-04 17:18:12,835 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:12,835 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914030871]
[2024-06-04 17:18:12,835 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914030871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:12,835 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:12,835 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:18:12,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788569858]
[2024-06-04 17:18:12,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:12,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:18:12,836 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:12,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:18:12,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:18:12,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:18:12,993 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 68 transitions, 433 flow. Second operand  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-04 17:18:12,993 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:12,993 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:18:12,993 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:14,228 INFO  L124   PetriNetUnfolderBase]: 1581/2535 cut-off events.
[2024-06-04 17:18:14,228 INFO  L125   PetriNetUnfolderBase]: For 19100/19102 co-relation queries the response was YES.
[2024-06-04 17:18:14,232 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10383 conditions, 2535 events. 1581/2535 cut-off events. For 19100/19102 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13379 event pairs, 510 based on Foata normal form. 24/2557 useless extension candidates. Maximal degree in co-relation 10352. Up to 2107 conditions per place. 
[2024-06-04 17:18:14,239 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 69 selfloop transitions, 23 changer transitions 0/99 dead transitions.
[2024-06-04 17:18:14,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 99 transitions, 717 flow
[2024-06-04 17:18:14,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:18:14,241 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:18:14,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-04 17:18:14,242 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5016611295681063
[2024-06-04 17:18:14,242 INFO  L175             Difference]: Start difference. First operand has 72 places, 68 transitions, 433 flow. Second operand 7 states and 151 transitions.
[2024-06-04 17:18:14,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 99 transitions, 717 flow
[2024-06-04 17:18:14,249 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 687 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-04 17:18:14,251 INFO  L231             Difference]: Finished difference. Result has 76 places, 70 transitions, 481 flow
[2024-06-04 17:18:14,251 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=76, PETRI_TRANSITIONS=70}
[2024-06-04 17:18:14,251 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places.
[2024-06-04 17:18:14,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 70 transitions, 481 flow
[2024-06-04 17:18:14,252 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 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-04 17:18:14,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:14,252 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:14,252 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 17:18:14,252 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-04 17:18:14,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:14,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -1260671089, now seen corresponding path program 1 times
[2024-06-04 17:18:14,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:14,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842016318]
[2024-06-04 17:18:14,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:14,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:14,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:26,451 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-04 17:18:26,452 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:26,452 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842016318]
[2024-06-04 17:18:26,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842016318] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:26,452 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:26,452 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:18:26,452 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272594129]
[2024-06-04 17:18:26,452 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:26,452 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:18:26,453 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:26,453 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:18:26,453 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:18:26,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:18:26,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 481 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-04 17:18:26,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:26,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:18:26,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:27,614 INFO  L124   PetriNetUnfolderBase]: 1616/2587 cut-off events.
[2024-06-04 17:18:27,614 INFO  L125   PetriNetUnfolderBase]: For 20350/20350 co-relation queries the response was YES.
[2024-06-04 17:18:27,620 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10974 conditions, 2587 events. 1616/2587 cut-off events. For 20350/20350 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13591 event pairs, 587 based on Foata normal form. 1/2587 useless extension candidates. Maximal degree in co-relation 10941. Up to 2404 conditions per place. 
[2024-06-04 17:18:27,626 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 70 selfloop transitions, 11 changer transitions 0/88 dead transitions.
[2024-06-04 17:18:27,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 707 flow
[2024-06-04 17:18:27,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:18:27,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:18:27,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-04 17:18:27,628 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-04 17:18:27,628 INFO  L175             Difference]: Start difference. First operand has 76 places, 70 transitions, 481 flow. Second operand 6 states and 118 transitions.
[2024-06-04 17:18:27,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 707 flow
[2024-06-04 17:18:27,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 88 transitions, 653 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-04 17:18:27,669 INFO  L231             Difference]: Finished difference. Result has 77 places, 73 transitions, 487 flow
[2024-06-04 17:18:27,670 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=77, PETRI_TRANSITIONS=73}
[2024-06-04 17:18:27,670 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places.
[2024-06-04 17:18:27,671 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 73 transitions, 487 flow
[2024-06-04 17:18:27,671 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-04 17:18:27,671 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:27,671 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:27,671 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 17:18:27,671 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-04 17:18:27,672 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:27,672 INFO  L85        PathProgramCache]: Analyzing trace with hash 1165069012, now seen corresponding path program 1 times
[2024-06-04 17:18:27,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:27,672 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124482616]
[2024-06-04 17:18:27,672 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:27,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:27,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:39,016 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-04 17:18:39,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:39,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124482616]
[2024-06-04 17:18:39,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124482616] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:39,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:39,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:39,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150191457]
[2024-06-04 17:18:39,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:39,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:39,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:39,019 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:39,019 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:39,174 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:18:39,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 73 transitions, 487 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-04 17:18:39,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:39,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:18:39,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:40,547 INFO  L124   PetriNetUnfolderBase]: 1644/2613 cut-off events.
[2024-06-04 17:18:40,547 INFO  L125   PetriNetUnfolderBase]: For 23360/23360 co-relation queries the response was YES.
[2024-06-04 17:18:40,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11439 conditions, 2613 events. 1644/2613 cut-off events. For 23360/23360 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13661 event pairs, 546 based on Foata normal form. 4/2613 useless extension candidates. Maximal degree in co-relation 11405. Up to 2298 conditions per place. 
[2024-06-04 17:18:40,557 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 70 selfloop transitions, 28 changer transitions 0/105 dead transitions.
[2024-06-04 17:18:40,557 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 105 transitions, 802 flow
[2024-06-04 17:18:40,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:40,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:40,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-04 17:18:40,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738372093023256
[2024-06-04 17:18:40,560 INFO  L175             Difference]: Start difference. First operand has 77 places, 73 transitions, 487 flow. Second operand 8 states and 163 transitions.
[2024-06-04 17:18:40,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 105 transitions, 802 flow
[2024-06-04 17:18:40,569 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 105 transitions, 764 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-04 17:18:40,570 INFO  L231             Difference]: Finished difference. Result has 82 places, 79 transitions, 575 flow
[2024-06-04 17:18:40,570 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=575, PETRI_PLACES=82, PETRI_TRANSITIONS=79}
[2024-06-04 17:18:40,571 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places.
[2024-06-04 17:18:40,571 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 575 flow
[2024-06-04 17:18:40,571 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-04 17:18:40,571 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:40,571 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:40,571 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 17:18:40,572 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-04 17:18:40,572 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:40,572 INFO  L85        PathProgramCache]: Analyzing trace with hash 211935514, now seen corresponding path program 2 times
[2024-06-04 17:18:40,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:40,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703691375]
[2024-06-04 17:18:40,572 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:40,573 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:40,611 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:18:51,959 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-04 17:18:51,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:18:51,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703691375]
[2024-06-04 17:18:51,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703691375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:18:51,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:18:51,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:18:51,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892020812]
[2024-06-04 17:18:51,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:18:51,960 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:18:51,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:18:51,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:18:51,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:18:52,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:18:52,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 575 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-04 17:18:52,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:18:52,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:18:52,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:18:53,455 INFO  L124   PetriNetUnfolderBase]: 1636/2604 cut-off events.
[2024-06-04 17:18:53,455 INFO  L125   PetriNetUnfolderBase]: For 26832/26832 co-relation queries the response was YES.
[2024-06-04 17:18:53,460 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 2604 events. 1636/2604 cut-off events. For 26832/26832 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13585 event pairs, 544 based on Foata normal form. 4/2604 useless extension candidates. Maximal degree in co-relation 11929. Up to 2286 conditions per place. 
[2024-06-04 17:18:53,467 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 71 selfloop transitions, 34 changer transitions 0/112 dead transitions.
[2024-06-04 17:18:53,467 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 936 flow
[2024-06-04 17:18:53,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:18:53,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:18:53,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-04 17:18:53,470 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738372093023256
[2024-06-04 17:18:53,470 INFO  L175             Difference]: Start difference. First operand has 82 places, 79 transitions, 575 flow. Second operand 8 states and 163 transitions.
[2024-06-04 17:18:53,471 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 936 flow
[2024-06-04 17:18:53,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 853 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 17:18:53,485 INFO  L231             Difference]: Finished difference. Result has 86 places, 87 transitions, 670 flow
[2024-06-04 17:18:53,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=670, PETRI_PLACES=86, PETRI_TRANSITIONS=87}
[2024-06-04 17:18:53,486 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places.
[2024-06-04 17:18:53,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 87 transitions, 670 flow
[2024-06-04 17:18:53,486 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-04 17:18:53,486 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:18:53,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:18:53,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 17:18:53,487 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-04 17:18:53,487 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:18:53,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 1723195528, now seen corresponding path program 3 times
[2024-06-04 17:18:53,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:18:53,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619288228]
[2024-06-04 17:18:53,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:18:53,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:18:53,533 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:06,244 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:19:06,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:06,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619288228]
[2024-06-04 17:19:06,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619288228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:06,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:06,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:19:06,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879063832]
[2024-06-04 17:19:06,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:06,249 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:19:06,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:06,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:19:06,249 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:19:06,389 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:19:06,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 87 transitions, 670 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-04 17:19:06,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:06,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:19:06,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:07,836 INFO  L124   PetriNetUnfolderBase]: 1669/2670 cut-off events.
[2024-06-04 17:19:07,836 INFO  L125   PetriNetUnfolderBase]: For 30141/30141 co-relation queries the response was YES.
[2024-06-04 17:19:07,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12526 conditions, 2670 events. 1669/2670 cut-off events. For 30141/30141 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14076 event pairs, 449 based on Foata normal form. 4/2670 useless extension candidates. Maximal degree in co-relation 12488. Up to 2176 conditions per place. 
[2024-06-04 17:19:07,848 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 71 selfloop transitions, 41 changer transitions 0/119 dead transitions.
[2024-06-04 17:19:07,849 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 119 transitions, 1010 flow
[2024-06-04 17:19:07,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:19:07,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:19:07,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-04 17:19:07,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48546511627906974
[2024-06-04 17:19:07,852 INFO  L175             Difference]: Start difference. First operand has 86 places, 87 transitions, 670 flow. Second operand 8 states and 167 transitions.
[2024-06-04 17:19:07,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 119 transitions, 1010 flow
[2024-06-04 17:19:07,867 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 119 transitions, 946 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-04 17:19:07,872 INFO  L231             Difference]: Finished difference. Result has 92 places, 90 transitions, 752 flow
[2024-06-04 17:19:07,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=752, PETRI_PLACES=92, PETRI_TRANSITIONS=90}
[2024-06-04 17:19:07,873 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places.
[2024-06-04 17:19:07,875 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 90 transitions, 752 flow
[2024-06-04 17:19:07,876 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-04 17:19:07,876 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:07,876 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:07,877 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 17:19:07,877 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:19:07,896 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:07,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -227985551, now seen corresponding path program 2 times
[2024-06-04 17:19:07,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:07,897 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993116538]
[2024-06-04 17:19:07,897 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:07,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:07,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:20,496 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-04 17:19:20,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:20,497 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993116538]
[2024-06-04 17:19:20,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993116538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:20,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:20,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:19:20,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804330277]
[2024-06-04 17:19:20,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:20,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:19:20,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:20,499 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:19:20,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:19:20,638 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:19:20,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 90 transitions, 752 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-04 17:19:20,639 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:20,639 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:19:20,639 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:21,666 INFO  L124   PetriNetUnfolderBase]: 1666/2685 cut-off events.
[2024-06-04 17:19:21,666 INFO  L125   PetriNetUnfolderBase]: For 33150/33158 co-relation queries the response was YES.
[2024-06-04 17:19:21,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12823 conditions, 2685 events. 1666/2685 cut-off events. For 33150/33158 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14292 event pairs, 548 based on Foata normal form. 7/2690 useless extension candidates. Maximal degree in co-relation 12783. Up to 2484 conditions per place. 
[2024-06-04 17:19:21,681 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 79 selfloop transitions, 16 changer transitions 0/102 dead transitions.
[2024-06-04 17:19:21,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 102 transitions, 1002 flow
[2024-06-04 17:19:21,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:19:21,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:19:21,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-04 17:19:21,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:19:21,682 INFO  L175             Difference]: Start difference. First operand has 92 places, 90 transitions, 752 flow. Second operand 6 states and 114 transitions.
[2024-06-04 17:19:21,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 102 transitions, 1002 flow
[2024-06-04 17:19:21,700 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 102 transitions, 912 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 17:19:21,702 INFO  L231             Difference]: Finished difference. Result has 93 places, 93 transitions, 744 flow
[2024-06-04 17:19:21,702 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=744, PETRI_PLACES=93, PETRI_TRANSITIONS=93}
[2024-06-04 17:19:21,703 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places.
[2024-06-04 17:19:21,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 93 transitions, 744 flow
[2024-06-04 17:19:21,703 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-04 17:19:21,703 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:21,703 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:21,703 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 17:19:21,704 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-04 17:19:21,704 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:21,704 INFO  L85        PathProgramCache]: Analyzing trace with hash -1254951217, now seen corresponding path program 1 times
[2024-06-04 17:19:21,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:21,704 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542318858]
[2024-06-04 17:19:21,704 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:21,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:21,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:34,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:19:34,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:34,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542318858]
[2024-06-04 17:19:34,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542318858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:34,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:34,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:19:34,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428580102]
[2024-06-04 17:19:34,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:34,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:19:34,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:34,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:19:34,171 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:19:34,260 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:19:34,261 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 93 transitions, 744 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-04 17:19:34,261 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:34,261 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:19:34,261 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:35,278 INFO  L124   PetriNetUnfolderBase]: 1506/2504 cut-off events.
[2024-06-04 17:19:35,279 INFO  L125   PetriNetUnfolderBase]: For 31762/31762 co-relation queries the response was YES.
[2024-06-04 17:19:35,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11861 conditions, 2504 events. 1506/2504 cut-off events. For 31762/31762 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13700 event pairs, 473 based on Foata normal form. 2/2505 useless extension candidates. Maximal degree in co-relation 11820. Up to 2262 conditions per place. 
[2024-06-04 17:19:35,291 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 90 selfloop transitions, 11 changer transitions 0/109 dead transitions.
[2024-06-04 17:19:35,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 109 transitions, 1006 flow
[2024-06-04 17:19:35,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:19:35,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:19:35,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-04 17:19:35,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4689922480620155
[2024-06-04 17:19:35,293 INFO  L175             Difference]: Start difference. First operand has 93 places, 93 transitions, 744 flow. Second operand 6 states and 121 transitions.
[2024-06-04 17:19:35,293 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 109 transitions, 1006 flow
[2024-06-04 17:19:35,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 109 transitions, 946 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-04 17:19:35,311 INFO  L231             Difference]: Finished difference. Result has 95 places, 96 transitions, 742 flow
[2024-06-04 17:19:35,311 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=95, PETRI_TRANSITIONS=96}
[2024-06-04 17:19:35,312 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places.
[2024-06-04 17:19:35,312 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 96 transitions, 742 flow
[2024-06-04 17:19:35,312 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-04 17:19:35,312 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:35,313 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:35,313 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 17:19:35,313 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:19:35,313 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:35,313 INFO  L85        PathProgramCache]: Analyzing trace with hash -224128987, now seen corresponding path program 2 times
[2024-06-04 17:19:35,313 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:35,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211363401]
[2024-06-04 17:19:35,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:35,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:35,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:19:48,155 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-04 17:19:48,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:19:48,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211363401]
[2024-06-04 17:19:48,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211363401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:19:48,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:19:48,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 17:19:48,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944497841]
[2024-06-04 17:19:48,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:19:48,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 17:19:48,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:19:48,157 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 17:19:48,157 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 17:19:48,314 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:19:48,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 96 transitions, 742 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-04 17:19:48,315 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:19:48,315 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:19:48,315 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:19:49,250 INFO  L124   PetriNetUnfolderBase]: 1508/2510 cut-off events.
[2024-06-04 17:19:49,250 INFO  L125   PetriNetUnfolderBase]: For 34798/34800 co-relation queries the response was YES.
[2024-06-04 17:19:49,256 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12274 conditions, 2510 events. 1508/2510 cut-off events. For 34798/34800 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 13784 event pairs, 477 based on Foata normal form. 4/2513 useless extension candidates. Maximal degree in co-relation 12232. Up to 2256 conditions per place. 
[2024-06-04 17:19:49,262 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 86 selfloop transitions, 16 changer transitions 0/110 dead transitions.
[2024-06-04 17:19:49,262 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 110 transitions, 1010 flow
[2024-06-04 17:19:49,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 17:19:49,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 17:19:49,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions.
[2024-06-04 17:19:49,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4689922480620155
[2024-06-04 17:19:49,265 INFO  L175             Difference]: Start difference. First operand has 95 places, 96 transitions, 742 flow. Second operand 6 states and 121 transitions.
[2024-06-04 17:19:49,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 110 transitions, 1010 flow
[2024-06-04 17:19:49,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 974 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-04 17:19:49,286 INFO  L231             Difference]: Finished difference. Result has 97 places, 99 transitions, 780 flow
[2024-06-04 17:19:49,286 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=97, PETRI_TRANSITIONS=99}
[2024-06-04 17:19:49,286 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places.
[2024-06-04 17:19:49,286 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 780 flow
[2024-06-04 17:19:49,287 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-04 17:19:49,287 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:19:49,287 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:19:49,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 17:19:49,287 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:19:49,288 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:19:49,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -224121051, now seen corresponding path program 1 times
[2024-06-04 17:19:49,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:19:49,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931827988]
[2024-06-04 17:19:49,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:19:49,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:19:49,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:02,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:20:02,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:02,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931827988]
[2024-06-04 17:20:02,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931827988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:02,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:02,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:20:02,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442972512]
[2024-06-04 17:20:02,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:02,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:20:02,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:02,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:20:02,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:20:02,736 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:20:02,737 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 780 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-04 17:20:02,737 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:02,737 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:20:02,737 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:03,694 INFO  L124   PetriNetUnfolderBase]: 1590/2590 cut-off events.
[2024-06-04 17:20:03,696 INFO  L125   PetriNetUnfolderBase]: For 37624/37624 co-relation queries the response was YES.
[2024-06-04 17:20:03,701 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13030 conditions, 2590 events. 1590/2590 cut-off events. For 37624/37624 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13862 event pairs, 500 based on Foata normal form. 1/2590 useless extension candidates. Maximal degree in co-relation 12987. Up to 2426 conditions per place. 
[2024-06-04 17:20:03,707 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 92 selfloop transitions, 14 changer transitions 0/112 dead transitions.
[2024-06-04 17:20:03,708 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 1052 flow
[2024-06-04 17:20:03,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:20:03,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:20:03,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:20:03,711 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4219269102990033
[2024-06-04 17:20:03,711 INFO  L175             Difference]: Start difference. First operand has 97 places, 99 transitions, 780 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:20:03,711 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 1052 flow
[2024-06-04 17:20:03,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 112 transitions, 1000 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-04 17:20:03,735 INFO  L231             Difference]: Finished difference. Result has 100 places, 102 transitions, 804 flow
[2024-06-04 17:20:03,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=804, PETRI_PLACES=100, PETRI_TRANSITIONS=102}
[2024-06-04 17:20:03,735 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places.
[2024-06-04 17:20:03,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 102 transitions, 804 flow
[2024-06-04 17:20:03,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-04 17:20:03,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:03,736 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:03,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 17:20:03,737 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:03,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:03,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 1629777369, now seen corresponding path program 1 times
[2024-06-04 17:20:03,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:03,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22837559]
[2024-06-04 17:20:03,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:03,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:03,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:16,537 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-04 17:20:16,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:16,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22837559]
[2024-06-04 17:20:16,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22837559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:16,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:16,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:20:16,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331936201]
[2024-06-04 17:20:16,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:16,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:20:16,540 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:16,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:20:16,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:20:16,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:20:16,703 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 804 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-04 17:20:16,703 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:16,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:20:16,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:17,830 INFO  L124   PetriNetUnfolderBase]: 1687/2722 cut-off events.
[2024-06-04 17:20:17,830 INFO  L125   PetriNetUnfolderBase]: For 48380/48382 co-relation queries the response was YES.
[2024-06-04 17:20:17,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14456 conditions, 2722 events. 1687/2722 cut-off events. For 48380/48382 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14555 event pairs, 536 based on Foata normal form. 5/2726 useless extension candidates. Maximal degree in co-relation 14412. Up to 2449 conditions per place. 
[2024-06-04 17:20:17,845 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 101 selfloop transitions, 24 changer transitions 0/132 dead transitions.
[2024-06-04 17:20:17,845 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 132 transitions, 1180 flow
[2024-06-04 17:20:17,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:20:17,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:20:17,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions.
[2024-06-04 17:20:17,846 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48172757475083056
[2024-06-04 17:20:17,847 INFO  L175             Difference]: Start difference. First operand has 100 places, 102 transitions, 804 flow. Second operand 7 states and 145 transitions.
[2024-06-04 17:20:17,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 132 transitions, 1180 flow
[2024-06-04 17:20:17,869 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 132 transitions, 1126 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-04 17:20:17,870 INFO  L231             Difference]: Finished difference. Result has 103 places, 109 transitions, 890 flow
[2024-06-04 17:20:17,870 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=890, PETRI_PLACES=103, PETRI_TRANSITIONS=109}
[2024-06-04 17:20:17,871 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places.
[2024-06-04 17:20:17,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 890 flow
[2024-06-04 17:20:17,871 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-04 17:20:17,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:17,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:17,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 17:20:17,872 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-04 17:20:17,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:17,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 917555622, now seen corresponding path program 1 times
[2024-06-04 17:20:17,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:17,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20363015]
[2024-06-04 17:20:17,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:17,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:17,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:29,626 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-04 17:20:29,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:29,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20363015]
[2024-06-04 17:20:29,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20363015] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:29,627 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:29,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:20:29,627 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855505765]
[2024-06-04 17:20:29,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:29,627 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:20:29,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:29,628 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:20:29,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:20:29,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:20:29,795 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 109 transitions, 890 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:29,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:29,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:20:29,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:31,145 INFO  L124   PetriNetUnfolderBase]: 1797/2921 cut-off events.
[2024-06-04 17:20:31,158 INFO  L125   PetriNetUnfolderBase]: For 55294/55296 co-relation queries the response was YES.
[2024-06-04 17:20:31,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15970 conditions, 2921 events. 1797/2921 cut-off events. For 55294/55296 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16030 event pairs, 546 based on Foata normal form. 12/2931 useless extension candidates. Maximal degree in co-relation 15924. Up to 2271 conditions per place. 
[2024-06-04 17:20:31,174 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 103 selfloop transitions, 37 changer transitions 0/147 dead transitions.
[2024-06-04 17:20:31,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 147 transitions, 1320 flow
[2024-06-04 17:20:31,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:20:31,175 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:20:31,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-04 17:20:31,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-04 17:20:31,188 INFO  L175             Difference]: Start difference. First operand has 103 places, 109 transitions, 890 flow. Second operand 8 states and 168 transitions.
[2024-06-04 17:20:31,190 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 147 transitions, 1320 flow
[2024-06-04 17:20:31,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 147 transitions, 1250 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-04 17:20:31,227 INFO  L231             Difference]: Finished difference. Result has 108 places, 114 transitions, 969 flow
[2024-06-04 17:20:31,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=108, PETRI_TRANSITIONS=114}
[2024-06-04 17:20:31,230 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places.
[2024-06-04 17:20:31,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 114 transitions, 969 flow
[2024-06-04 17:20:31,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:31,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:31,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:31,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 17:20:31,231 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:20:31,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:31,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -426097157, now seen corresponding path program 1 times
[2024-06-04 17:20:31,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:31,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307863514]
[2024-06-04 17:20:31,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:31,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:31,316 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:44,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:20:44,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:44,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307863514]
[2024-06-04 17:20:44,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307863514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:44,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:44,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:20:44,013 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738569473]
[2024-06-04 17:20:44,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:44,015 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:20:44,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:44,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:20:44,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:20:44,204 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:20:44,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 114 transitions, 969 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:44,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:44,204 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:20:44,205 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:20:45,263 INFO  L124   PetriNetUnfolderBase]: 1887/3013 cut-off events.
[2024-06-04 17:20:45,263 INFO  L125   PetriNetUnfolderBase]: For 58345/58345 co-relation queries the response was YES.
[2024-06-04 17:20:45,270 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16789 conditions, 3013 events. 1887/3013 cut-off events. For 58345/58345 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16248 event pairs, 584 based on Foata normal form. 1/3013 useless extension candidates. Maximal degree in co-relation 16742. Up to 2868 conditions per place. 
[2024-06-04 17:20:45,279 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 114 selfloop transitions, 14 changer transitions 0/133 dead transitions.
[2024-06-04 17:20:45,279 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 133 transitions, 1309 flow
[2024-06-04 17:20:45,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:20:45,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:20:45,281 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 17:20:45,281 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4219269102990033
[2024-06-04 17:20:45,281 INFO  L175             Difference]: Start difference. First operand has 108 places, 114 transitions, 969 flow. Second operand 7 states and 127 transitions.
[2024-06-04 17:20:45,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 133 transitions, 1309 flow
[2024-06-04 17:20:45,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 133 transitions, 1258 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-04 17:20:45,314 INFO  L231             Difference]: Finished difference. Result has 112 places, 117 transitions, 1002 flow
[2024-06-04 17:20:45,315 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1002, PETRI_PLACES=112, PETRI_TRANSITIONS=117}
[2024-06-04 17:20:45,315 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 68 predicate places.
[2024-06-04 17:20:45,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 117 transitions, 1002 flow
[2024-06-04 17:20:45,315 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:20:45,316 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:20:45,316 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:20:45,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 17:20:45,316 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-04 17:20:45,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:20:45,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -426097529, now seen corresponding path program 2 times
[2024-06-04 17:20:45,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:20:45,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031793825]
[2024-06-04 17:20:45,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:20:45,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:20:45,359 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:20:58,731 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-04 17:20:58,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:20:58,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031793825]
[2024-06-04 17:20:58,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031793825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:20:58,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:20:58,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:20:58,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17503018]
[2024-06-04 17:20:58,733 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:20:58,733 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:20:58,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:20:58,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:20:58,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:20:58,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:20:58,851 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 117 transitions, 1002 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-04 17:20:58,851 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:20:58,851 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:20:58,851 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:00,033 INFO  L124   PetriNetUnfolderBase]: 1863/3024 cut-off events.
[2024-06-04 17:21:00,034 INFO  L125   PetriNetUnfolderBase]: For 65028/65030 co-relation queries the response was YES.
[2024-06-04 17:21:00,043 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17292 conditions, 3024 events. 1863/3024 cut-off events. For 65028/65030 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16765 event pairs, 561 based on Foata normal form. 5/3028 useless extension candidates. Maximal degree in co-relation 17244. Up to 2677 conditions per place. 
[2024-06-04 17:21:00,053 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 107 selfloop transitions, 29 changer transitions 0/144 dead transitions.
[2024-06-04 17:21:00,053 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 144 transitions, 1482 flow
[2024-06-04 17:21:00,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:21:00,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:21:00,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-04 17:21:00,055 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4717607973421927
[2024-06-04 17:21:00,055 INFO  L175             Difference]: Start difference. First operand has 112 places, 117 transitions, 1002 flow. Second operand 7 states and 142 transitions.
[2024-06-04 17:21:00,055 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 144 transitions, 1482 flow
[2024-06-04 17:21:00,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 144 transitions, 1420 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 17:21:00,099 INFO  L231             Difference]: Finished difference. Result has 115 places, 125 transitions, 1134 flow
[2024-06-04 17:21:00,099 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1134, PETRI_PLACES=115, PETRI_TRANSITIONS=125}
[2024-06-04 17:21:00,099 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 71 predicate places.
[2024-06-04 17:21:00,100 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 125 transitions, 1134 flow
[2024-06-04 17:21:00,100 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-04 17:21:00,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:00,100 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:21:00,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 17:21:00,100 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-04 17:21:00,101 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:00,101 INFO  L85        PathProgramCache]: Analyzing trace with hash 26860728, now seen corresponding path program 2 times
[2024-06-04 17:21:00,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:00,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77665660]
[2024-06-04 17:21:00,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:00,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:00,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:11,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:21:11,170 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:11,170 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77665660]
[2024-06-04 17:21:11,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77665660] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:11,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:11,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:21:11,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099763206]
[2024-06-04 17:21:11,171 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:11,171 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:21:11,171 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:11,171 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:21:11,172 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:21:11,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:21:11,388 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 125 transitions, 1134 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:11,388 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:11,388 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:21:11,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:12,720 INFO  L124   PetriNetUnfolderBase]: 1843/2991 cut-off events.
[2024-06-04 17:21:12,720 INFO  L125   PetriNetUnfolderBase]: For 72190/72192 co-relation queries the response was YES.
[2024-06-04 17:21:12,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17812 conditions, 2991 events. 1843/2991 cut-off events. For 72190/72192 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16464 event pairs, 347 based on Foata normal form. 12/3001 useless extension candidates. Maximal degree in co-relation 17762. Up to 1909 conditions per place. 
[2024-06-04 17:21:12,735 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 107 selfloop transitions, 40 changer transitions 0/155 dead transitions.
[2024-06-04 17:21:12,735 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 155 transitions, 1528 flow
[2024-06-04 17:21:12,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:21:12,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:21:12,738 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-04 17:21:12,738 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5016611295681063
[2024-06-04 17:21:12,738 INFO  L175             Difference]: Start difference. First operand has 115 places, 125 transitions, 1134 flow. Second operand 7 states and 151 transitions.
[2024-06-04 17:21:12,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 155 transitions, 1528 flow
[2024-06-04 17:21:12,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 155 transitions, 1451 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-04 17:21:12,777 INFO  L231             Difference]: Finished difference. Result has 119 places, 125 transitions, 1146 flow
[2024-06-04 17:21:12,777 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1146, PETRI_PLACES=119, PETRI_TRANSITIONS=125}
[2024-06-04 17:21:12,778 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places.
[2024-06-04 17:21:12,778 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 125 transitions, 1146 flow
[2024-06-04 17:21:12,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:12,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:12,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:21:12,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 17:21:12,779 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-04 17:21:12,779 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:12,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -1540079290, now seen corresponding path program 3 times
[2024-06-04 17:21:12,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:12,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580364363]
[2024-06-04 17:21:12,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:12,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:12,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:24,665 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-04 17:21:24,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:24,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580364363]
[2024-06-04 17:21:24,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580364363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:24,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:24,665 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:21:24,665 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272364363]
[2024-06-04 17:21:24,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:24,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:21:24,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:24,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:21:24,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:21:24,941 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:21:24,942 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 125 transitions, 1146 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:24,942 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:24,942 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:21:24,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:26,147 INFO  L124   PetriNetUnfolderBase]: 1823/2960 cut-off events.
[2024-06-04 17:21:26,148 INFO  L125   PetriNetUnfolderBase]: For 74633/74635 co-relation queries the response was YES.
[2024-06-04 17:21:26,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17771 conditions, 2960 events. 1823/2960 cut-off events. For 74633/74635 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 16309 event pairs, 310 based on Foata normal form. 12/2967 useless extension candidates. Maximal degree in co-relation 17719. Up to 1767 conditions per place. 
[2024-06-04 17:21:26,166 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 102 selfloop transitions, 39 changer transitions 0/149 dead transitions.
[2024-06-04 17:21:26,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 149 transitions, 1482 flow
[2024-06-04 17:21:26,167 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:21:26,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:21:26,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-04 17:21:26,168 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4750830564784053
[2024-06-04 17:21:26,168 INFO  L175             Difference]: Start difference. First operand has 119 places, 125 transitions, 1146 flow. Second operand 7 states and 143 transitions.
[2024-06-04 17:21:26,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 149 transitions, 1482 flow
[2024-06-04 17:21:26,206 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 1378 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-04 17:21:26,207 INFO  L231             Difference]: Finished difference. Result has 119 places, 124 transitions, 1092 flow
[2024-06-04 17:21:26,208 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1092, PETRI_PLACES=119, PETRI_TRANSITIONS=124}
[2024-06-04 17:21:26,208 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places.
[2024-06-04 17:21:26,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 124 transitions, 1092 flow
[2024-06-04 17:21:26,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:26,208 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:26,209 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:21:26,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 17:21:26,209 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:21:26,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:26,209 INFO  L85        PathProgramCache]: Analyzing trace with hash -71834117, now seen corresponding path program 2 times
[2024-06-04 17:21:26,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:26,210 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514546468]
[2024-06-04 17:21:26,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:26,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:26,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:39,054 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-04 17:21:39,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:39,054 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514546468]
[2024-06-04 17:21:39,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514546468] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:39,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:39,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:21:39,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862958814]
[2024-06-04 17:21:39,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:39,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:21:39,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:39,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:21:39,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:21:39,159 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:21:39,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 124 transitions, 1092 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:39,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:39,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:21:39,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:40,180 INFO  L124   PetriNetUnfolderBase]: 1903/3043 cut-off events.
[2024-06-04 17:21:40,180 INFO  L125   PetriNetUnfolderBase]: For 71223/71233 co-relation queries the response was YES.
[2024-06-04 17:21:40,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18094 conditions, 3043 events. 1903/3043 cut-off events. For 71223/71233 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16492 event pairs, 569 based on Foata normal form. 9/3050 useless extension candidates. Maximal degree in co-relation 18041. Up to 2866 conditions per place. 
[2024-06-04 17:21:40,198 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 110 selfloop transitions, 26 changer transitions 0/141 dead transitions.
[2024-06-04 17:21:40,199 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 141 transitions, 1548 flow
[2024-06-04 17:21:40,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:21:40,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:21:40,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions.
[2024-06-04 17:21:40,200 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4152823920265781
[2024-06-04 17:21:40,200 INFO  L175             Difference]: Start difference. First operand has 119 places, 124 transitions, 1092 flow. Second operand 7 states and 125 transitions.
[2024-06-04 17:21:40,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 141 transitions, 1548 flow
[2024-06-04 17:21:40,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 141 transitions, 1437 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 17:21:40,234 INFO  L231             Difference]: Finished difference. Result has 120 places, 130 transitions, 1153 flow
[2024-06-04 17:21:40,234 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=981, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1153, PETRI_PLACES=120, PETRI_TRANSITIONS=130}
[2024-06-04 17:21:40,234 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 76 predicate places.
[2024-06-04 17:21:40,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 130 transitions, 1153 flow
[2024-06-04 17:21:40,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:21:40,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:40,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:21:40,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 17:21:40,235 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:21:40,236 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:40,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 497274767, now seen corresponding path program 3 times
[2024-06-04 17:21:40,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:40,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268679915]
[2024-06-04 17:21:40,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:40,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:40,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:21:53,084 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-04 17:21:53,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:21:53,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268679915]
[2024-06-04 17:21:53,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268679915] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:21:53,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:21:53,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:21:53,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472108890]
[2024-06-04 17:21:53,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:21:53,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:21:53,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:21:53,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:21:53,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:21:53,265 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:21:53,265 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 130 transitions, 1153 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-04 17:21:53,265 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:21:53,265 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:21:53,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:21:54,285 INFO  L124   PetriNetUnfolderBase]: 1855/3012 cut-off events.
[2024-06-04 17:21:54,285 INFO  L125   PetriNetUnfolderBase]: For 78024/78026 co-relation queries the response was YES.
[2024-06-04 17:21:54,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18053 conditions, 3012 events. 1855/3012 cut-off events. For 78024/78026 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 16642 event pairs, 566 based on Foata normal form. 5/3013 useless extension candidates. Maximal degree in co-relation 18000. Up to 2598 conditions per place. 
[2024-06-04 17:21:54,302 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 101 selfloop transitions, 42 changer transitions 0/153 dead transitions.
[2024-06-04 17:21:54,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 153 transitions, 1719 flow
[2024-06-04 17:21:54,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:21:54,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:21:54,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-04 17:21:54,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-04 17:21:54,304 INFO  L175             Difference]: Start difference. First operand has 120 places, 130 transitions, 1153 flow. Second operand 7 states and 140 transitions.
[2024-06-04 17:21:54,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 153 transitions, 1719 flow
[2024-06-04 17:21:54,346 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 1647 flow, removed 26 selfloop flow, removed 3 redundant places.
[2024-06-04 17:21:54,348 INFO  L231             Difference]: Finished difference. Result has 125 places, 138 transitions, 1317 flow
[2024-06-04 17:21:54,348 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1317, PETRI_PLACES=125, PETRI_TRANSITIONS=138}
[2024-06-04 17:21:54,348 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 81 predicate places.
[2024-06-04 17:21:54,348 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 138 transitions, 1317 flow
[2024-06-04 17:21:54,349 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-04 17:21:54,349 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:21:54,349 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:21:54,349 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 17:21:54,349 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-04 17:21:54,349 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:21:54,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 1642168131, now seen corresponding path program 3 times
[2024-06-04 17:21:54,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:21:54,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095752363]
[2024-06-04 17:21:54,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:21:54,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:21:54,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:07,582 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-04 17:22:07,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:07,583 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095752363]
[2024-06-04 17:22:07,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095752363] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:07,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:07,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:22:07,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935802002]
[2024-06-04 17:22:07,584 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:07,584 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:22:07,584 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:07,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:22:07,585 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:22:07,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:22:07,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 138 transitions, 1317 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:07,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:07,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:22:07,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:08,790 INFO  L124   PetriNetUnfolderBase]: 1927/3083 cut-off events.
[2024-06-04 17:22:08,791 INFO  L125   PetriNetUnfolderBase]: For 84683/84693 co-relation queries the response was YES.
[2024-06-04 17:22:08,799 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19253 conditions, 3083 events. 1927/3083 cut-off events. For 84683/84693 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16754 event pairs, 575 based on Foata normal form. 9/3090 useless extension candidates. Maximal degree in co-relation 19197. Up to 2901 conditions per place. 
[2024-06-04 17:22:08,810 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 116 selfloop transitions, 27 changer transitions 0/148 dead transitions.
[2024-06-04 17:22:08,810 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 148 transitions, 1627 flow
[2024-06-04 17:22:08,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:22:08,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:22:08,811 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-04 17:22:08,812 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40863787375415284
[2024-06-04 17:22:08,812 INFO  L175             Difference]: Start difference. First operand has 125 places, 138 transitions, 1317 flow. Second operand 7 states and 123 transitions.
[2024-06-04 17:22:08,812 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 148 transitions, 1627 flow
[2024-06-04 17:22:08,858 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 148 transitions, 1453 flow, removed 58 selfloop flow, removed 4 redundant places.
[2024-06-04 17:22:08,860 INFO  L231             Difference]: Finished difference. Result has 128 places, 138 transitions, 1203 flow
[2024-06-04 17:22:08,860 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1203, PETRI_PLACES=128, PETRI_TRANSITIONS=138}
[2024-06-04 17:22:08,861 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 84 predicate places.
[2024-06-04 17:22:08,861 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 138 transitions, 1203 flow
[2024-06-04 17:22:08,861 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:22:08,861 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:08,861 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:22:08,861 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 17:22:08,862 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-04 17:22:08,862 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:08,862 INFO  L85        PathProgramCache]: Analyzing trace with hash -248901281, now seen corresponding path program 1 times
[2024-06-04 17:22:08,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:08,862 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915638514]
[2024-06-04 17:22:08,862 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:08,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:08,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:21,606 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-04 17:22:21,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:21,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915638514]
[2024-06-04 17:22:21,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915638514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:21,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:21,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:22:21,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944924727]
[2024-06-04 17:22:21,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:21,608 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:22:21,608 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:21,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:22:21,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:22:21,790 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43
[2024-06-04 17:22:21,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 138 transitions, 1203 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-04 17:22:21,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:21,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43
[2024-06-04 17:22:21,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:22,904 INFO  L124   PetriNetUnfolderBase]: 1663/2810 cut-off events.
[2024-06-04 17:22:22,905 INFO  L125   PetriNetUnfolderBase]: For 75216/75216 co-relation queries the response was YES.
[2024-06-04 17:22:22,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16626 conditions, 2810 events. 1663/2810 cut-off events. For 75216/75216 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16057 event pairs, 459 based on Foata normal form. 1/2810 useless extension candidates. Maximal degree in co-relation 16569. Up to 2500 conditions per place. 
[2024-06-04 17:22:22,921 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 132 selfloop transitions, 14 changer transitions 0/157 dead transitions.
[2024-06-04 17:22:22,921 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 157 transitions, 1581 flow
[2024-06-04 17:22:22,922 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:22:22,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:22:22,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-04 17:22:22,922 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4584717607973422
[2024-06-04 17:22:22,923 INFO  L175             Difference]: Start difference. First operand has 128 places, 138 transitions, 1203 flow. Second operand 7 states and 138 transitions.
[2024-06-04 17:22:22,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 157 transitions, 1581 flow
[2024-06-04 17:22:22,965 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 157 transitions, 1519 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-04 17:22:22,967 INFO  L231             Difference]: Finished difference. Result has 129 places, 141 transitions, 1227 flow
[2024-06-04 17:22:22,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1227, PETRI_PLACES=129, PETRI_TRANSITIONS=141}
[2024-06-04 17:22:22,968 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 85 predicate places.
[2024-06-04 17:22:22,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 141 transitions, 1227 flow
[2024-06-04 17:22:22,968 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-04 17:22:22,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:22,968 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:22:22,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 17:22:22,969 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-04 17:22:22,969 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:22,969 INFO  L85        PathProgramCache]: Analyzing trace with hash -1800584923, now seen corresponding path program 1 times
[2024-06-04 17:22:22,969 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:22,969 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855201778]
[2024-06-04 17:22:22,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:22,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:23,017 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:35,804 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-04 17:22:35,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:35,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855201778]
[2024-06-04 17:22:35,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855201778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:35,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:35,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:22:35,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000107135]
[2024-06-04 17:22:35,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:35,806 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:22:35,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:35,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:22:35,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:22:35,963 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:22:35,964 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 141 transitions, 1227 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-04 17:22:35,964 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:35,964 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:22:35,973 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:37,085 INFO  L124   PetriNetUnfolderBase]: 1767/2920 cut-off events.
[2024-06-04 17:22:37,086 INFO  L125   PetriNetUnfolderBase]: For 80369/80369 co-relation queries the response was YES.
[2024-06-04 17:22:37,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17530 conditions, 2920 events. 1767/2920 cut-off events. For 80369/80369 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16365 event pairs, 498 based on Foata normal form. 2/2921 useless extension candidates. Maximal degree in co-relation 17472. Up to 2683 conditions per place. 
[2024-06-04 17:22:37,107 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 139 selfloop transitions, 14 changer transitions 0/159 dead transitions.
[2024-06-04 17:22:37,108 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 159 transitions, 1623 flow
[2024-06-04 17:22:37,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:22:37,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:22:37,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-04 17:22:37,110 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43521594684385384
[2024-06-04 17:22:37,110 INFO  L175             Difference]: Start difference. First operand has 129 places, 141 transitions, 1227 flow. Second operand 7 states and 131 transitions.
[2024-06-04 17:22:37,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 159 transitions, 1623 flow
[2024-06-04 17:22:37,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 159 transitions, 1559 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-04 17:22:37,159 INFO  L231             Difference]: Finished difference. Result has 131 places, 144 transitions, 1245 flow
[2024-06-04 17:22:37,160 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=124, 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=1245, PETRI_PLACES=131, PETRI_TRANSITIONS=144}
[2024-06-04 17:22:37,160 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places.
[2024-06-04 17:22:37,160 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 144 transitions, 1245 flow
[2024-06-04 17:22:37,160 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-04 17:22:37,161 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:37,161 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:22:37,161 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 17:22:37,161 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:22:37,162 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:37,162 INFO  L85        PathProgramCache]: Analyzing trace with hash 1642174083, now seen corresponding path program 2 times
[2024-06-04 17:22:37,162 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:37,162 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347417096]
[2024-06-04 17:22:37,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:37,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:37,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:22:50,290 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-04 17:22:50,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:22:50,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347417096]
[2024-06-04 17:22:50,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347417096] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:22:50,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:22:50,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:22:50,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94949756]
[2024-06-04 17:22:50,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:22:50,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:22:50,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:22:50,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:22:50,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:22:50,445 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:22:50,446 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 144 transitions, 1245 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-04 17:22:50,446 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:22:50,446 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:22:50,446 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:22:51,408 INFO  L124   PetriNetUnfolderBase]: 1785/2930 cut-off events.
[2024-06-04 17:22:51,409 INFO  L125   PetriNetUnfolderBase]: For 83861/83863 co-relation queries the response was YES.
[2024-06-04 17:22:51,419 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18138 conditions, 2930 events. 1785/2930 cut-off events. For 83861/83863 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16331 event pairs, 502 based on Foata normal form. 4/2933 useless extension candidates. Maximal degree in co-relation 18079. Up to 2679 conditions per place. 
[2024-06-04 17:22:51,429 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 27 changer transitions 0/164 dead transitions.
[2024-06-04 17:22:51,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 164 transitions, 1767 flow
[2024-06-04 17:22:51,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:22:51,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:22:51,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-04 17:22:51,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:22:51,431 INFO  L175             Difference]: Start difference. First operand has 131 places, 144 transitions, 1245 flow. Second operand 7 states and 133 transitions.
[2024-06-04 17:22:51,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 164 transitions, 1767 flow
[2024-06-04 17:22:51,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 164 transitions, 1707 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 17:22:51,487 INFO  L231             Difference]: Finished difference. Result has 133 places, 150 transitions, 1347 flow
[2024-06-04 17:22:51,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1347, PETRI_PLACES=133, PETRI_TRANSITIONS=150}
[2024-06-04 17:22:51,488 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-04 17:22:51,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 150 transitions, 1347 flow
[2024-06-04 17:22:51,488 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-04 17:22:51,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:22:51,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:22:51,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 17:22:51,489 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-04 17:22:51,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:22:51,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 1641936933, now seen corresponding path program 3 times
[2024-06-04 17:22:51,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:22:51,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120043663]
[2024-06-04 17:22:51,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:22:51,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:22:51,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:04,679 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-04 17:23:04,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:04,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120043663]
[2024-06-04 17:23:04,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120043663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:04,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:04,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:23:04,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583540259]
[2024-06-04 17:23:04,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:04,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:23:04,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:04,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:23:04,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:23:04,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:23:04,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 150 transitions, 1347 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-04 17:23:04,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:04,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:23:04,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:05,889 INFO  L124   PetriNetUnfolderBase]: 1779/2922 cut-off events.
[2024-06-04 17:23:05,889 INFO  L125   PetriNetUnfolderBase]: For 88820/88822 co-relation queries the response was YES.
[2024-06-04 17:23:05,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18436 conditions, 2922 events. 1779/2922 cut-off events. For 88820/88822 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 16257 event pairs, 504 based on Foata normal form. 4/2925 useless extension candidates. Maximal degree in co-relation 18376. Up to 2674 conditions per place. 
[2024-06-04 17:23:05,910 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 131 selfloop transitions, 26 changer transitions 0/163 dead transitions.
[2024-06-04 17:23:05,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 163 transitions, 1709 flow
[2024-06-04 17:23:05,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:23:05,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:23:05,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-04 17:23:05,912 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:23:05,912 INFO  L175             Difference]: Start difference. First operand has 133 places, 150 transitions, 1347 flow. Second operand 7 states and 133 transitions.
[2024-06-04 17:23:05,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 163 transitions, 1709 flow
[2024-06-04 17:23:05,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 163 transitions, 1619 flow, removed 36 selfloop flow, removed 3 redundant places.
[2024-06-04 17:23:05,968 INFO  L231             Difference]: Finished difference. Result has 137 places, 150 transitions, 1315 flow
[2024-06-04 17:23:05,968 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1257, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1315, PETRI_PLACES=137, PETRI_TRANSITIONS=150}
[2024-06-04 17:23:05,969 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places.
[2024-06-04 17:23:05,969 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 150 transitions, 1315 flow
[2024-06-04 17:23:05,969 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-04 17:23:05,969 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:05,969 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:23:05,969 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 17:23:05,970 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:23:05,970 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:05,970 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016508175, now seen corresponding path program 1 times
[2024-06-04 17:23:05,970 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:05,970 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137152409]
[2024-06-04 17:23:05,970 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:05,970 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:06,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:19,105 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-04 17:23:19,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:19,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137152409]
[2024-06-04 17:23:19,105 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137152409] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:19,105 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:19,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:23:19,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893556542]
[2024-06-04 17:23:19,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:19,106 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:23:19,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:19,106 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:23:19,107 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:23:19,252 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:23:19,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 150 transitions, 1315 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:23:19,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:19,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:23:19,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:20,479 INFO  L124   PetriNetUnfolderBase]: 1961/3132 cut-off events.
[2024-06-04 17:23:20,479 INFO  L125   PetriNetUnfolderBase]: For 111152/111154 co-relation queries the response was YES.
[2024-06-04 17:23:20,490 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20583 conditions, 3132 events. 1961/3132 cut-off events. For 111152/111154 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 17041 event pairs, 573 based on Foata normal form. 5/3136 useless extension candidates. Maximal degree in co-relation 20521. Up to 2885 conditions per place. 
[2024-06-04 17:23:20,501 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 146 selfloop transitions, 28 changer transitions 0/179 dead transitions.
[2024-06-04 17:23:20,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 179 transitions, 1805 flow
[2024-06-04 17:23:20,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:23:20,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:23:20,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 17:23:20,503 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-04 17:23:20,503 INFO  L175             Difference]: Start difference. First operand has 137 places, 150 transitions, 1315 flow. Second operand 8 states and 154 transitions.
[2024-06-04 17:23:20,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 179 transitions, 1805 flow
[2024-06-04 17:23:20,557 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 179 transitions, 1733 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 17:23:20,559 INFO  L231             Difference]: Finished difference. Result has 139 places, 154 transitions, 1382 flow
[2024-06-04 17:23:20,560 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1382, PETRI_PLACES=139, PETRI_TRANSITIONS=154}
[2024-06-04 17:23:20,560 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places.
[2024-06-04 17:23:20,560 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 154 transitions, 1382 flow
[2024-06-04 17:23:20,560 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:23:20,560 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:20,561 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:23:20,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 17:23:20,561 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:23:20,561 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:20,561 INFO  L85        PathProgramCache]: Analyzing trace with hash -329830866, now seen corresponding path program 1 times
[2024-06-04 17:23:20,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:20,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550576421]
[2024-06-04 17:23:20,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:20,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:20,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:33,763 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:23:33,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:33,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550576421]
[2024-06-04 17:23:33,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550576421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:33,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:33,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:23:33,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883134874]
[2024-06-04 17:23:33,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:33,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:23:33,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:33,764 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:23:33,764 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:23:33,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:23:33,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 154 transitions, 1382 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-04 17:23:33,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:33,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:23:33,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:35,114 INFO  L124   PetriNetUnfolderBase]: 1924/3107 cut-off events.
[2024-06-04 17:23:35,114 INFO  L125   PetriNetUnfolderBase]: For 120802/120804 co-relation queries the response was YES.
[2024-06-04 17:23:35,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21223 conditions, 3107 events. 1924/3107 cut-off events. For 120802/120804 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17210 event pairs, 547 based on Foata normal form. 6/3112 useless extension candidates. Maximal degree in co-relation 21160. Up to 2774 conditions per place. 
[2024-06-04 17:23:35,138 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 141 selfloop transitions, 23 changer transitions 0/178 dead transitions.
[2024-06-04 17:23:35,139 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 178 transitions, 1823 flow
[2024-06-04 17:23:35,139 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:23:35,139 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:23:35,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-04 17:23:35,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4684385382059801
[2024-06-04 17:23:35,140 INFO  L175             Difference]: Start difference. First operand has 139 places, 154 transitions, 1382 flow. Second operand 7 states and 141 transitions.
[2024-06-04 17:23:35,140 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 178 transitions, 1823 flow
[2024-06-04 17:23:35,203 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 178 transitions, 1712 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-04 17:23:35,205 INFO  L231             Difference]: Finished difference. Result has 140 places, 158 transitions, 1389 flow
[2024-06-04 17:23:35,205 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1389, PETRI_PLACES=140, PETRI_TRANSITIONS=158}
[2024-06-04 17:23:35,206 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 96 predicate places.
[2024-06-04 17:23:35,206 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 158 transitions, 1389 flow
[2024-06-04 17:23:35,206 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-04 17:23:35,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:35,206 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:23:35,206 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 17:23:35,206 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:23:35,207 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:35,207 INFO  L85        PathProgramCache]: Analyzing trace with hash -324116946, now seen corresponding path program 2 times
[2024-06-04 17:23:35,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:35,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882183271]
[2024-06-04 17:23:35,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:35,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:35,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:23:47,994 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-04 17:23:47,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:23:47,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882183271]
[2024-06-04 17:23:47,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882183271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:23:47,995 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:23:47,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:23:47,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799219407]
[2024-06-04 17:23:47,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:23:47,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:23:47,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:23:47,996 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:23:47,996 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:23:48,152 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:23:48,152 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 158 transitions, 1389 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-04 17:23:48,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:23:48,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:23:48,152 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:23:49,275 INFO  L124   PetriNetUnfolderBase]: 1926/3115 cut-off events.
[2024-06-04 17:23:49,275 INFO  L125   PetriNetUnfolderBase]: For 125744/125746 co-relation queries the response was YES.
[2024-06-04 17:23:49,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21346 conditions, 3115 events. 1926/3115 cut-off events. For 125744/125746 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17311 event pairs, 546 based on Foata normal form. 6/3120 useless extension candidates. Maximal degree in co-relation 21282. Up to 2723 conditions per place. 
[2024-06-04 17:23:49,298 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 131 selfloop transitions, 35 changer transitions 0/180 dead transitions.
[2024-06-04 17:23:49,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 180 transitions, 1903 flow
[2024-06-04 17:23:49,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:23:49,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:23:49,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions.
[2024-06-04 17:23:49,300 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4684385382059801
[2024-06-04 17:23:49,300 INFO  L175             Difference]: Start difference. First operand has 140 places, 158 transitions, 1389 flow. Second operand 7 states and 141 transitions.
[2024-06-04 17:23:49,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 180 transitions, 1903 flow
[2024-06-04 17:23:49,386 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 180 transitions, 1841 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-04 17:23:49,388 INFO  L231             Difference]: Finished difference. Result has 144 places, 161 transitions, 1464 flow
[2024-06-04 17:23:49,388 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1464, PETRI_PLACES=144, PETRI_TRANSITIONS=161}
[2024-06-04 17:23:49,389 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 100 predicate places.
[2024-06-04 17:23:49,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 161 transitions, 1464 flow
[2024-06-04 17:23:49,389 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-04 17:23:49,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:23:49,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:23:49,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 17:23:49,390 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-04 17:23:49,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:23:49,390 INFO  L85        PathProgramCache]: Analyzing trace with hash -1019164275, now seen corresponding path program 2 times
[2024-06-04 17:23:49,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:23:49,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880167522]
[2024-06-04 17:23:49,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:23:49,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:23:49,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:02,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:24:02,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:02,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880167522]
[2024-06-04 17:24:02,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880167522] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:02,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:02,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:24:02,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196182998]
[2024-06-04 17:24:02,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:02,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:24:02,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:02,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:24:02,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:24:02,742 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:24:02,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 161 transitions, 1464 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:24:02,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:02,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:24:02,742 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:03,990 INFO  L124   PetriNetUnfolderBase]: 2060/3292 cut-off events.
[2024-06-04 17:24:03,991 INFO  L125   PetriNetUnfolderBase]: For 135378/135380 co-relation queries the response was YES.
[2024-06-04 17:24:04,003 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22785 conditions, 3292 events. 2060/3292 cut-off events. For 135378/135380 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18207 event pairs, 574 based on Foata normal form. 5/3296 useless extension candidates. Maximal degree in co-relation 22720. Up to 2884 conditions per place. 
[2024-06-04 17:24:04,016 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 142 selfloop transitions, 48 changer transitions 0/195 dead transitions.
[2024-06-04 17:24:04,017 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 195 transitions, 2276 flow
[2024-06-04 17:24:04,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:24:04,018 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:24:04,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 17:24:04,018 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-04 17:24:04,018 INFO  L175             Difference]: Start difference. First operand has 144 places, 161 transitions, 1464 flow. Second operand 8 states and 154 transitions.
[2024-06-04 17:24:04,019 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 195 transitions, 2276 flow
[2024-06-04 17:24:04,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 195 transitions, 2189 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-06-04 17:24:04,116 INFO  L231             Difference]: Finished difference. Result has 149 places, 173 transitions, 1739 flow
[2024-06-04 17:24:04,116 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1739, PETRI_PLACES=149, PETRI_TRANSITIONS=173}
[2024-06-04 17:24:04,117 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places.
[2024-06-04 17:24:04,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 173 transitions, 1739 flow
[2024-06-04 17:24:04,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:24:04,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:04,117 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:24:04,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 17:24:04,118 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-04 17:24:04,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:04,118 INFO  L85        PathProgramCache]: Analyzing trace with hash -324109010, now seen corresponding path program 1 times
[2024-06-04 17:24:04,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:04,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281503393]
[2024-06-04 17:24:04,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:04,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:04,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:17,528 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-04 17:24:17,529 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:17,529 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281503393]
[2024-06-04 17:24:17,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281503393] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:17,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:17,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:24:17,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330095962]
[2024-06-04 17:24:17,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:17,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:24:17,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:17,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:24:17,530 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:24:17,735 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:24:17,736 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 173 transitions, 1739 flow. Second operand  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:17,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:17,736 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:24:17,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:18,942 INFO  L124   PetriNetUnfolderBase]: 2065/3292 cut-off events.
[2024-06-04 17:24:18,942 INFO  L125   PetriNetUnfolderBase]: For 144570/144570 co-relation queries the response was YES.
[2024-06-04 17:24:18,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23674 conditions, 3292 events. 2065/3292 cut-off events. For 144570/144570 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18109 event pairs, 582 based on Foata normal form. 1/3292 useless extension candidates. Maximal degree in co-relation 23607. Up to 3106 conditions per place. 
[2024-06-04 17:24:18,963 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 171 selfloop transitions, 17 changer transitions 0/193 dead transitions.
[2024-06-04 17:24:18,963 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 193 transitions, 2221 flow
[2024-06-04 17:24:18,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:24:18,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:24:18,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-04 17:24:18,964 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4069767441860465
[2024-06-04 17:24:18,965 INFO  L175             Difference]: Start difference. First operand has 149 places, 173 transitions, 1739 flow. Second operand 8 states and 140 transitions.
[2024-06-04 17:24:18,965 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 193 transitions, 2221 flow
[2024-06-04 17:24:19,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 193 transitions, 2106 flow, removed 48 selfloop flow, removed 3 redundant places.
[2024-06-04 17:24:19,064 INFO  L231             Difference]: Finished difference. Result has 154 places, 176 transitions, 1734 flow
[2024-06-04 17:24:19,064 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1734, PETRI_PLACES=154, PETRI_TRANSITIONS=176}
[2024-06-04 17:24:19,064 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places.
[2024-06-04 17:24:19,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 176 transitions, 1734 flow
[2024-06-04 17:24:19,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:24:19,065 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:19,065 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:24:19,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 17:24:19,065 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:24:19,065 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:19,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -324109413, now seen corresponding path program 3 times
[2024-06-04 17:24:19,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:19,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842003002]
[2024-06-04 17:24:19,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:19,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:19,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:32,235 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-04 17:24:32,236 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:32,236 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842003002]
[2024-06-04 17:24:32,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842003002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:32,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:32,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:24:32,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124881644]
[2024-06-04 17:24:32,237 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:32,237 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:24:32,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:32,238 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:24:32,238 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:24:32,400 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:24:32,401 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 176 transitions, 1734 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:24:32,401 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:32,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:24:32,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:33,597 INFO  L124   PetriNetUnfolderBase]: 2060/3289 cut-off events.
[2024-06-04 17:24:33,597 INFO  L125   PetriNetUnfolderBase]: For 146054/146056 co-relation queries the response was YES.
[2024-06-04 17:24:33,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23690 conditions, 3289 events. 2060/3289 cut-off events. For 146054/146056 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 18059 event pairs, 568 based on Foata normal form. 5/3293 useless extension candidates. Maximal degree in co-relation 23621. Up to 2889 conditions per place. 
[2024-06-04 17:24:33,618 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 146 selfloop transitions, 47 changer transitions 0/198 dead transitions.
[2024-06-04 17:24:33,619 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 198 transitions, 2338 flow
[2024-06-04 17:24:33,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:24:33,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:24:33,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 17:24:33,620 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44476744186046513
[2024-06-04 17:24:33,620 INFO  L175             Difference]: Start difference. First operand has 154 places, 176 transitions, 1734 flow. Second operand 8 states and 153 transitions.
[2024-06-04 17:24:33,620 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 198 transitions, 2338 flow
[2024-06-04 17:24:33,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 198 transitions, 2202 flow, removed 53 selfloop flow, removed 6 redundant places.
[2024-06-04 17:24:33,723 INFO  L231             Difference]: Finished difference. Result has 156 places, 176 transitions, 1700 flow
[2024-06-04 17:24:33,723 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1700, PETRI_PLACES=156, PETRI_TRANSITIONS=176}
[2024-06-04 17:24:33,724 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places.
[2024-06-04 17:24:33,724 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 176 transitions, 1700 flow
[2024-06-04 17:24:33,724 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:24:33,724 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:33,725 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:24:33,725 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 17:24:33,725 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:24:33,725 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:33,725 INFO  L85        PathProgramCache]: Analyzing trace with hash 1309905582, now seen corresponding path program 3 times
[2024-06-04 17:24:33,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:33,726 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766984499]
[2024-06-04 17:24:33,726 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:33,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:33,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:24:48,001 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-04 17:24:48,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:24:48,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766984499]
[2024-06-04 17:24:48,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766984499] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:24:48,001 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:24:48,001 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:24:48,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904078788]
[2024-06-04 17:24:48,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:24:48,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:24:48,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:24:48,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:24:48,002 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:24:48,141 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:24:48,142 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 176 transitions, 1700 flow. Second operand  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-04 17:24:48,142 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:24:48,142 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:24:48,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:24:49,374 INFO  L124   PetriNetUnfolderBase]: 1988/3203 cut-off events.
[2024-06-04 17:24:49,374 INFO  L125   PetriNetUnfolderBase]: For 152133/152133 co-relation queries the response was YES.
[2024-06-04 17:24:49,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23436 conditions, 3203 events. 1988/3203 cut-off events. For 152133/152133 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17777 event pairs, 559 based on Foata normal form. 2/3202 useless extension candidates. Maximal degree in co-relation 23366. Up to 2844 conditions per place. 
[2024-06-04 17:24:49,396 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 154 selfloop transitions, 25 changer transitions 0/196 dead transitions.
[2024-06-04 17:24:49,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 196 transitions, 2146 flow
[2024-06-04 17:24:49,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:24:49,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:24:49,397 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 17:24:49,397 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:24:49,398 INFO  L175             Difference]: Start difference. First operand has 156 places, 176 transitions, 1700 flow. Second operand 8 states and 152 transitions.
[2024-06-04 17:24:49,398 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 196 transitions, 2146 flow
[2024-06-04 17:24:49,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 196 transitions, 2000 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-04 17:24:49,492 INFO  L231             Difference]: Finished difference. Result has 158 places, 178 transitions, 1634 flow
[2024-06-04 17:24:49,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1634, PETRI_PLACES=158, PETRI_TRANSITIONS=178}
[2024-06-04 17:24:49,493 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places.
[2024-06-04 17:24:49,493 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 178 transitions, 1634 flow
[2024-06-04 17:24:49,493 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.666666666666666) internal successors, (114), 9 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-04 17:24:49,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:24:49,494 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:24:49,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 17:24:49,494 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:24:49,494 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:24:49,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 866607248, now seen corresponding path program 4 times
[2024-06-04 17:24:49,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:24:49,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567284804]
[2024-06-04 17:24:49,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:24:49,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:24:49,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:03,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:25:03,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:03,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567284804]
[2024-06-04 17:25:03,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567284804] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:03,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:03,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:25:03,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722183543]
[2024-06-04 17:25:03,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:03,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:25:03,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:03,398 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:25:03,398 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:25:03,536 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:25:03,537 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 178 transitions, 1634 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-04 17:25:03,537 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:03,537 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:25:03,537 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:04,647 INFO  L124   PetriNetUnfolderBase]: 2013/3241 cut-off events.
[2024-06-04 17:25:04,647 INFO  L125   PetriNetUnfolderBase]: For 161179/161195 co-relation queries the response was YES.
[2024-06-04 17:25:04,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23753 conditions, 3241 events. 2013/3241 cut-off events. For 161179/161195 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18112 event pairs, 559 based on Foata normal form. 2/3224 useless extension candidates. Maximal degree in co-relation 23682. Up to 2853 conditions per place. 
[2024-06-04 17:25:04,673 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 145 selfloop transitions, 33 changer transitions 0/195 dead transitions.
[2024-06-04 17:25:04,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 195 transitions, 2088 flow
[2024-06-04 17:25:04,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:25:04,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:25:04,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-04 17:25:04,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4584717607973422
[2024-06-04 17:25:04,676 INFO  L175             Difference]: Start difference. First operand has 158 places, 178 transitions, 1634 flow. Second operand 7 states and 138 transitions.
[2024-06-04 17:25:04,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 195 transitions, 2088 flow
[2024-06-04 17:25:04,767 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 195 transitions, 1959 flow, removed 8 selfloop flow, removed 9 redundant places.
[2024-06-04 17:25:04,769 INFO  L231             Difference]: Finished difference. Result has 156 places, 181 transitions, 1635 flow
[2024-06-04 17:25:04,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1635, PETRI_PLACES=156, PETRI_TRANSITIONS=181}
[2024-06-04 17:25:04,769 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places.
[2024-06-04 17:25:04,770 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 181 transitions, 1635 flow
[2024-06-04 17:25:04,770 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-04 17:25:04,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:04,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:25:04,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 17:25:04,770 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:25:04,771 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:04,771 INFO  L85        PathProgramCache]: Analyzing trace with hash -639782938, now seen corresponding path program 5 times
[2024-06-04 17:25:04,771 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:04,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892685180]
[2024-06-04 17:25:04,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:04,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:04,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:17,820 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-04 17:25:17,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:17,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892685180]
[2024-06-04 17:25:17,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892685180] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:17,821 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:17,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:25:17,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685668598]
[2024-06-04 17:25:17,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:17,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:25:17,822 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:17,822 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:25:17,822 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:25:17,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:25:17,959 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 181 transitions, 1635 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-04 17:25:17,959 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:17,959 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:25:17,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:19,057 INFO  L124   PetriNetUnfolderBase]: 2011/3251 cut-off events.
[2024-06-04 17:25:19,058 INFO  L125   PetriNetUnfolderBase]: For 168334/168352 co-relation queries the response was YES.
[2024-06-04 17:25:19,071 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23887 conditions, 3251 events. 2011/3251 cut-off events. For 168334/168352 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18287 event pairs, 567 based on Foata normal form. 6/3238 useless extension candidates. Maximal degree in co-relation 23814. Up to 2757 conditions per place. 
[2024-06-04 17:25:19,083 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 128 selfloop transitions, 52 changer transitions 0/197 dead transitions.
[2024-06-04 17:25:19,084 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 197 transitions, 2181 flow
[2024-06-04 17:25:19,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:25:19,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:25:19,085 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-04 17:25:19,085 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46179401993355484
[2024-06-04 17:25:19,085 INFO  L175             Difference]: Start difference. First operand has 156 places, 181 transitions, 1635 flow. Second operand 7 states and 139 transitions.
[2024-06-04 17:25:19,085 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 197 transitions, 2181 flow
[2024-06-04 17:25:19,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 197 transitions, 2083 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-04 17:25:19,249 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 1709 flow
[2024-06-04 17:25:19,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1537, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1709, PETRI_PLACES=158, PETRI_TRANSITIONS=184}
[2024-06-04 17:25:19,250 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places.
[2024-06-04 17:25:19,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 1709 flow
[2024-06-04 17:25:19,253 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-04 17:25:19,253 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:19,253 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:25:19,253 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 17:25:19,253 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:25:19,254 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:19,254 INFO  L85        PathProgramCache]: Analyzing trace with hash 2073816622, now seen corresponding path program 6 times
[2024-06-04 17:25:19,254 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:19,254 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114447967]
[2024-06-04 17:25:19,255 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:19,255 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:19,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:32,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-04 17:25:32,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:32,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114447967]
[2024-06-04 17:25:32,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114447967] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:32,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:32,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 17:25:32,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340889087]
[2024-06-04 17:25:32,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:32,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 17:25:32,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:32,556 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 17:25:32,556 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 17:25:32,655 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:25:32,656 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 1709 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-04 17:25:32,656 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:32,656 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:25:32,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:33,817 INFO  L124   PetriNetUnfolderBase]: 2001/3237 cut-off events.
[2024-06-04 17:25:33,818 INFO  L125   PetriNetUnfolderBase]: For 172103/172121 co-relation queries the response was YES.
[2024-06-04 17:25:33,829 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23917 conditions, 3237 events. 2001/3237 cut-off events. For 172103/172121 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18208 event pairs, 571 based on Foata normal form. 4/3222 useless extension candidates. Maximal degree in co-relation 23843. Up to 2749 conditions per place. 
[2024-06-04 17:25:33,840 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 123 selfloop transitions, 56 changer transitions 0/196 dead transitions.
[2024-06-04 17:25:33,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 196 transitions, 2113 flow
[2024-06-04 17:25:33,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 17:25:33,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 17:25:33,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-04 17:25:33,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45514950166112955
[2024-06-04 17:25:33,842 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 1709 flow. Second operand 7 states and 137 transitions.
[2024-06-04 17:25:33,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 196 transitions, 2113 flow
[2024-06-04 17:25:33,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 196 transitions, 1955 flow, removed 37 selfloop flow, removed 4 redundant places.
[2024-06-04 17:25:33,969 INFO  L231             Difference]: Finished difference. Result has 161 places, 184 transitions, 1669 flow
[2024-06-04 17:25:33,969 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1669, PETRI_PLACES=161, PETRI_TRANSITIONS=184}
[2024-06-04 17:25:33,970 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 117 predicate places.
[2024-06-04 17:25:33,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 184 transitions, 1669 flow
[2024-06-04 17:25:33,970 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-04 17:25:33,970 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:33,970 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:25:33,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 17:25:33,971 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:25:33,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:33,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 2068110235, now seen corresponding path program 4 times
[2024-06-04 17:25:33,971 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:33,971 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327961421]
[2024-06-04 17:25:33,971 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:33,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:34,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:25:47,619 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-04 17:25:47,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:25:47,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327961421]
[2024-06-04 17:25:47,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327961421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:25:47,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:25:47,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:25:47,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948643731]
[2024-06-04 17:25:47,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:25:47,620 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:25:47,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:25:47,620 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:25:47,620 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:25:47,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:25:47,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 184 transitions, 1669 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:25:47,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:25:47,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:25:47,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:25:48,918 INFO  L124   PetriNetUnfolderBase]: 2125/3388 cut-off events.
[2024-06-04 17:25:48,918 INFO  L125   PetriNetUnfolderBase]: For 181502/181504 co-relation queries the response was YES.
[2024-06-04 17:25:48,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25170 conditions, 3388 events. 2125/3388 cut-off events. For 181502/181504 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18713 event pairs, 603 based on Foata normal form. 5/3389 useless extension candidates. Maximal degree in co-relation 25095. Up to 2794 conditions per place. 
[2024-06-04 17:25:48,940 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 132 selfloop transitions, 78 changer transitions 0/215 dead transitions.
[2024-06-04 17:25:48,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 215 transitions, 2717 flow
[2024-06-04 17:25:48,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:25:48,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:25:48,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-04 17:25:48,942 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-04 17:25:48,942 INFO  L175             Difference]: Start difference. First operand has 161 places, 184 transitions, 1669 flow. Second operand 8 states and 154 transitions.
[2024-06-04 17:25:48,942 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 215 transitions, 2717 flow
[2024-06-04 17:25:49,043 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 215 transitions, 2565 flow, removed 7 selfloop flow, removed 7 redundant places.
[2024-06-04 17:25:49,045 INFO  L231             Difference]: Finished difference. Result has 163 places, 195 transitions, 1917 flow
[2024-06-04 17:25:49,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1917, PETRI_PLACES=163, PETRI_TRANSITIONS=195}
[2024-06-04 17:25:49,046 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places.
[2024-06-04 17:25:49,046 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 195 transitions, 1917 flow
[2024-06-04 17:25:49,046 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:25:49,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:25:49,047 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:25:49,047 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 17:25:49,047 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-04 17:25:49,047 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:25:49,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 2068110638, now seen corresponding path program 2 times
[2024-06-04 17:25:49,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:25:49,048 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123988282]
[2024-06-04 17:25:49,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:25:49,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:25:49,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:02,204 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-04 17:26:02,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:02,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123988282]
[2024-06-04 17:26:02,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123988282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:02,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:02,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:26:02,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679525879]
[2024-06-04 17:26:02,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:02,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:26:02,206 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:02,206 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:26:02,206 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:26:02,396 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:02,397 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 195 transitions, 1917 flow. Second operand  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:02,397 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:02,397 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:02,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:03,511 INFO  L124   PetriNetUnfolderBase]: 2130/3395 cut-off events.
[2024-06-04 17:26:03,511 INFO  L125   PetriNetUnfolderBase]: For 192727/192734 co-relation queries the response was YES.
[2024-06-04 17:26:03,524 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26125 conditions, 3395 events. 2130/3395 cut-off events. For 192727/192734 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18728 event pairs, 599 based on Foata normal form. 7/3400 useless extension candidates. Maximal degree in co-relation 26048. Up to 3170 conditions per place. 
[2024-06-04 17:26:03,536 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 176 selfloop transitions, 35 changer transitions 0/216 dead transitions.
[2024-06-04 17:26:03,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 216 transitions, 2612 flow
[2024-06-04 17:26:03,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:26:03,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:26:03,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-04 17:26:03,538 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40988372093023256
[2024-06-04 17:26:03,538 INFO  L175             Difference]: Start difference. First operand has 163 places, 195 transitions, 1917 flow. Second operand 8 states and 141 transitions.
[2024-06-04 17:26:03,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 216 transitions, 2612 flow
[2024-06-04 17:26:03,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 216 transitions, 2448 flow, removed 52 selfloop flow, removed 3 redundant places.
[2024-06-04 17:26:03,654 INFO  L231             Difference]: Finished difference. Result has 169 places, 204 transitions, 2011 flow
[2024-06-04 17:26:03,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1753, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2011, PETRI_PLACES=169, PETRI_TRANSITIONS=204}
[2024-06-04 17:26:03,654 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 125 predicate places.
[2024-06-04 17:26:03,654 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 204 transitions, 2011 flow
[2024-06-04 17:26:03,655 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:03,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:03,655 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:26:03,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 17:26:03,655 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-04 17:26:03,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:03,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 2080997648, now seen corresponding path program 3 times
[2024-06-04 17:26:03,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:03,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680642481]
[2024-06-04 17:26:03,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:03,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:03,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:16,816 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-04 17:26:16,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:16,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680642481]
[2024-06-04 17:26:16,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680642481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:16,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:16,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:26:16,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298515838]
[2024-06-04 17:26:16,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:16,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:26:16,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:16,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:26:16,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:26:17,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:17,030 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 204 transitions, 2011 flow. Second operand  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:17,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:17,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:17,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:18,160 INFO  L124   PetriNetUnfolderBase]: 2135/3402 cut-off events.
[2024-06-04 17:26:18,160 INFO  L125   PetriNetUnfolderBase]: For 201132/201139 co-relation queries the response was YES.
[2024-06-04 17:26:18,175 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26475 conditions, 3402 events. 2135/3402 cut-off events. For 201132/201139 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18730 event pairs, 599 based on Foata normal form. 7/3407 useless extension candidates. Maximal degree in co-relation 26395. Up to 3176 conditions per place. 
[2024-06-04 17:26:18,189 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 175 selfloop transitions, 39 changer transitions 0/219 dead transitions.
[2024-06-04 17:26:18,190 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 219 transitions, 2636 flow
[2024-06-04 17:26:18,190 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:26:18,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:26:18,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-04 17:26:18,191 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4069767441860465
[2024-06-04 17:26:18,191 INFO  L175             Difference]: Start difference. First operand has 169 places, 204 transitions, 2011 flow. Second operand 8 states and 140 transitions.
[2024-06-04 17:26:18,191 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 219 transitions, 2636 flow
[2024-06-04 17:26:18,320 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 219 transitions, 2542 flow, removed 41 selfloop flow, removed 3 redundant places.
[2024-06-04 17:26:18,323 INFO  L231             Difference]: Finished difference. Result has 174 places, 207 transitions, 2079 flow
[2024-06-04 17:26:18,323 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2079, PETRI_PLACES=174, PETRI_TRANSITIONS=207}
[2024-06-04 17:26:18,323 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 130 predicate places.
[2024-06-04 17:26:18,324 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 207 transitions, 2079 flow
[2024-06-04 17:26:18,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:18,324 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:18,324 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:26:18,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 17:26:18,324 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-04 17:26:18,325 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:18,325 INFO  L85        PathProgramCache]: Analyzing trace with hash 2081443118, now seen corresponding path program 4 times
[2024-06-04 17:26:18,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:18,325 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044024193]
[2024-06-04 17:26:18,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:18,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:18,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:31,714 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-04 17:26:31,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:31,715 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044024193]
[2024-06-04 17:26:31,715 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044024193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:31,715 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:31,715 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:26:31,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793482989]
[2024-06-04 17:26:31,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:31,716 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:26:31,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:31,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:26:31,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:26:31,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:31,901 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 207 transitions, 2079 flow. Second operand  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:31,902 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:31,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:31,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:33,059 INFO  L124   PetriNetUnfolderBase]: 2132/3398 cut-off events.
[2024-06-04 17:26:33,059 INFO  L125   PetriNetUnfolderBase]: For 207035/207042 co-relation queries the response was YES.
[2024-06-04 17:26:33,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26570 conditions, 3398 events. 2132/3398 cut-off events. For 207035/207042 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18717 event pairs, 599 based on Foata normal form. 7/3403 useless extension candidates. Maximal degree in co-relation 26488. Up to 3173 conditions per place. 
[2024-06-04 17:26:33,096 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 172 selfloop transitions, 41 changer transitions 0/218 dead transitions.
[2024-06-04 17:26:33,096 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 218 transitions, 2534 flow
[2024-06-04 17:26:33,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:26:33,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:26:33,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions.
[2024-06-04 17:26:33,097 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4011627906976744
[2024-06-04 17:26:33,097 INFO  L175             Difference]: Start difference. First operand has 174 places, 207 transitions, 2079 flow. Second operand 8 states and 138 transitions.
[2024-06-04 17:26:33,097 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 218 transitions, 2534 flow
[2024-06-04 17:26:33,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 218 transitions, 2360 flow, removed 56 selfloop flow, removed 5 redundant places.
[2024-06-04 17:26:33,309 INFO  L231             Difference]: Finished difference. Result has 177 places, 207 transitions, 1993 flow
[2024-06-04 17:26:33,309 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1993, PETRI_PLACES=177, PETRI_TRANSITIONS=207}
[2024-06-04 17:26:33,310 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 133 predicate places.
[2024-06-04 17:26:33,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 207 transitions, 1993 flow
[2024-06-04 17:26:33,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:26:33,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:33,310 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:26:33,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 17:26:33,310 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-04 17:26:33,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:33,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -50377981, now seen corresponding path program 5 times
[2024-06-04 17:26:33,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:33,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971165428]
[2024-06-04 17:26:33,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:33,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:33,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:26:46,058 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-04 17:26:46,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:26:46,059 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971165428]
[2024-06-04 17:26:46,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971165428] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:26:46,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:26:46,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:26:46,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638629529]
[2024-06-04 17:26:46,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:26:46,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:26:46,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:26:46,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:26:46,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:26:46,217 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:26:46,218 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 207 transitions, 1993 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:26:46,218 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:26:46,218 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:26:46,218 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:26:47,392 INFO  L124   PetriNetUnfolderBase]: 2143/3420 cut-off events.
[2024-06-04 17:26:47,393 INFO  L125   PetriNetUnfolderBase]: For 215318/215320 co-relation queries the response was YES.
[2024-06-04 17:26:47,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26717 conditions, 3420 events. 2143/3420 cut-off events. For 215318/215320 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 18975 event pairs, 583 based on Foata normal form. 5/3421 useless extension candidates. Maximal degree in co-relation 26634. Up to 2817 conditions per place. 
[2024-06-04 17:26:47,418 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 137 selfloop transitions, 87 changer transitions 0/229 dead transitions.
[2024-06-04 17:26:47,419 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 229 transitions, 2845 flow
[2024-06-04 17:26:47,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:26:47,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:26:47,434 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 17:26:47,435 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:26:47,435 INFO  L175             Difference]: Start difference. First operand has 177 places, 207 transitions, 1993 flow. Second operand 8 states and 152 transitions.
[2024-06-04 17:26:47,435 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 229 transitions, 2845 flow
[2024-06-04 17:26:47,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 229 transitions, 2771 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-04 17:26:47,652 INFO  L231             Difference]: Finished difference. Result has 180 places, 212 transitions, 2236 flow
[2024-06-04 17:26:47,664 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2236, PETRI_PLACES=180, PETRI_TRANSITIONS=212}
[2024-06-04 17:26:47,665 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places.
[2024-06-04 17:26:47,665 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 212 transitions, 2236 flow
[2024-06-04 17:26:47,665 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:26:47,665 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:26:47,666 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:26:47,666 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 17:26:47,666 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-04 17:26:47,666 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:26:47,666 INFO  L85        PathProgramCache]: Analyzing trace with hash -1764350469, now seen corresponding path program 6 times
[2024-06-04 17:26:47,666 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:26:47,667 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141392343]
[2024-06-04 17:26:47,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:26:47,667 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:26:47,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:01,349 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-04 17:27:01,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:01,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141392343]
[2024-06-04 17:27:01,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141392343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:01,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:01,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:27:01,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345496144]
[2024-06-04 17:27:01,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:01,349 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:27:01,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:01,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:27:01,350 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:27:01,529 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:27:01,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 212 transitions, 2236 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:27:01,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:01,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:27:01,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:02,675 INFO  L124   PetriNetUnfolderBase]: 2150/3432 cut-off events.
[2024-06-04 17:27:02,675 INFO  L125   PetriNetUnfolderBase]: For 225722/225724 co-relation queries the response was YES.
[2024-06-04 17:27:02,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27453 conditions, 3432 events. 2150/3432 cut-off events. For 225722/225724 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 19005 event pairs, 603 based on Foata normal form. 5/3433 useless extension candidates. Maximal degree in co-relation 27368. Up to 2825 conditions per place. 
[2024-06-04 17:27:02,705 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 138 selfloop transitions, 89 changer transitions 0/232 dead transitions.
[2024-06-04 17:27:02,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 232 transitions, 3033 flow
[2024-06-04 17:27:02,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:27:02,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:27:02,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-04 17:27:02,706 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44476744186046513
[2024-06-04 17:27:02,707 INFO  L175             Difference]: Start difference. First operand has 180 places, 212 transitions, 2236 flow. Second operand 8 states and 153 transitions.
[2024-06-04 17:27:02,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 232 transitions, 3033 flow
[2024-06-04 17:27:02,894 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 232 transitions, 2753 flow, removed 46 selfloop flow, removed 6 redundant places.
[2024-06-04 17:27:02,896 INFO  L231             Difference]: Finished difference. Result has 182 places, 216 transitions, 2238 flow
[2024-06-04 17:27:02,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2238, PETRI_PLACES=182, PETRI_TRANSITIONS=216}
[2024-06-04 17:27:02,897 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 138 predicate places.
[2024-06-04 17:27:02,897 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 216 transitions, 2238 flow
[2024-06-04 17:27:02,897 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 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-04 17:27:02,897 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:02,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:27:02,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 17:27:02,898 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-04 17:27:02,898 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:02,898 INFO  L85        PathProgramCache]: Analyzing trace with hash 1317622443, now seen corresponding path program 1 times
[2024-06-04 17:27:02,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:02,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366096968]
[2024-06-04 17:27:02,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:02,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:02,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:18,651 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-04 17:27:18,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:18,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366096968]
[2024-06-04 17:27:18,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366096968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:18,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:18,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:27:18,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922743209]
[2024-06-04 17:27:18,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:18,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:27:18,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:18,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:27:18,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:27:18,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:27:18,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 216 transitions, 2238 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:18,801 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:18,801 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:27:18,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:20,030 INFO  L124   PetriNetUnfolderBase]: 2043/3322 cut-off events.
[2024-06-04 17:27:20,030 INFO  L125   PetriNetUnfolderBase]: For 234363/234365 co-relation queries the response was YES.
[2024-06-04 17:27:20,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26740 conditions, 3322 events. 2043/3322 cut-off events. For 234363/234365 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18891 event pairs, 921 based on Foata normal form. 1/3322 useless extension candidates. Maximal degree in co-relation 26654. Up to 3039 conditions per place. 
[2024-06-04 17:27:20,061 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 207 selfloop transitions, 19 changer transitions 0/237 dead transitions.
[2024-06-04 17:27:20,061 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 237 transitions, 2811 flow
[2024-06-04 17:27:20,062 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:27:20,062 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:27:20,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions.
[2024-06-04 17:27:20,077 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4108527131782946
[2024-06-04 17:27:20,077 INFO  L175             Difference]: Start difference. First operand has 182 places, 216 transitions, 2238 flow. Second operand 9 states and 159 transitions.
[2024-06-04 17:27:20,077 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 237 transitions, 2811 flow
[2024-06-04 17:27:20,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 237 transitions, 2591 flow, removed 39 selfloop flow, removed 5 redundant places.
[2024-06-04 17:27:20,310 INFO  L231             Difference]: Finished difference. Result has 187 places, 221 transitions, 2154 flow
[2024-06-04 17:27:20,311 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2154, PETRI_PLACES=187, PETRI_TRANSITIONS=221}
[2024-06-04 17:27:20,311 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 143 predicate places.
[2024-06-04 17:27:20,311 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 221 transitions, 2154 flow
[2024-06-04 17:27:20,311 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:20,311 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:20,312 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:27:20,312 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 17:27:20,312 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:27:20,312 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:20,312 INFO  L85        PathProgramCache]: Analyzing trace with hash 1525590926, now seen corresponding path program 1 times
[2024-06-04 17:27:20,313 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:20,313 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021278078]
[2024-06-04 17:27:20,313 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:20,313 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:20,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:33,618 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-04 17:27:33,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:33,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021278078]
[2024-06-04 17:27:33,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021278078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:33,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:33,619 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:27:33,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780052858]
[2024-06-04 17:27:33,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:33,620 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:27:33,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:33,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:27:33,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:27:33,813 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:27:33,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 221 transitions, 2154 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:33,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:33,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:27:33,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:35,070 INFO  L124   PetriNetUnfolderBase]: 2053/3344 cut-off events.
[2024-06-04 17:27:35,070 INFO  L125   PetriNetUnfolderBase]: For 247415/247417 co-relation queries the response was YES.
[2024-06-04 17:27:35,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26885 conditions, 3344 events. 2053/3344 cut-off events. For 247415/247417 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 19127 event pairs, 914 based on Foata normal form. 4/3347 useless extension candidates. Maximal degree in co-relation 26797. Up to 3046 conditions per place. 
[2024-06-04 17:27:35,096 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 211 selfloop transitions, 18 changer transitions 0/240 dead transitions.
[2024-06-04 17:27:35,097 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 240 transitions, 2724 flow
[2024-06-04 17:27:35,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:27:35,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:27:35,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-04 17:27:35,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4273255813953488
[2024-06-04 17:27:35,098 INFO  L175             Difference]: Start difference. First operand has 187 places, 221 transitions, 2154 flow. Second operand 8 states and 147 transitions.
[2024-06-04 17:27:35,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 240 transitions, 2724 flow
[2024-06-04 17:27:35,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 240 transitions, 2632 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-04 17:27:35,329 INFO  L231             Difference]: Finished difference. Result has 189 places, 224 transitions, 2166 flow
[2024-06-04 17:27:35,329 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2062, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2166, PETRI_PLACES=189, PETRI_TRANSITIONS=224}
[2024-06-04 17:27:35,329 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 145 predicate places.
[2024-06-04 17:27:35,329 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 224 transitions, 2166 flow
[2024-06-04 17:27:35,330 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:35,330 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:35,330 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:27:35,330 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 17:27:35,330 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:27:35,330 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:35,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -639561660, now seen corresponding path program 2 times
[2024-06-04 17:27:35,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:35,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212476320]
[2024-06-04 17:27:35,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:35,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:35,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:27:49,551 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-04 17:27:49,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:27:49,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212476320]
[2024-06-04 17:27:49,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212476320] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:27:49,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:27:49,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:27:49,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421011130]
[2024-06-04 17:27:49,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:27:49,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:27:49,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:27:49,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:27:49,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:27:49,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:27:49,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 224 transitions, 2166 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:49,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:27:49,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:27:49,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:27:51,125 INFO  L124   PetriNetUnfolderBase]: 2074/3382 cut-off events.
[2024-06-04 17:27:51,125 INFO  L125   PetriNetUnfolderBase]: For 260093/260097 co-relation queries the response was YES.
[2024-06-04 17:27:51,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27674 conditions, 3382 events. 2074/3382 cut-off events. For 260093/260097 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19438 event pairs, 923 based on Foata normal form. 6/3387 useless extension candidates. Maximal degree in co-relation 27585. Up to 3019 conditions per place. 
[2024-06-04 17:27:51,153 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 196 selfloop transitions, 38 changer transitions 0/245 dead transitions.
[2024-06-04 17:27:51,153 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 245 transitions, 2916 flow
[2024-06-04 17:27:51,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:27:51,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:27:51,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 17:27:51,154 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:27:51,154 INFO  L175             Difference]: Start difference. First operand has 189 places, 224 transitions, 2166 flow. Second operand 8 states and 152 transitions.
[2024-06-04 17:27:51,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 245 transitions, 2916 flow
[2024-06-04 17:27:51,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 245 transitions, 2834 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-04 17:27:51,385 INFO  L231             Difference]: Finished difference. Result has 191 places, 230 transitions, 2296 flow
[2024-06-04 17:27:51,385 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2296, PETRI_PLACES=191, PETRI_TRANSITIONS=230}
[2024-06-04 17:27:51,385 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places.
[2024-06-04 17:27:51,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 230 transitions, 2296 flow
[2024-06-04 17:27:51,386 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:27:51,386 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:27:51,386 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:27:51,387 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 17:27:51,387 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:27:51,387 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:27:51,387 INFO  L85        PathProgramCache]: Analyzing trace with hash -632210010, now seen corresponding path program 3 times
[2024-06-04 17:27:51,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:27:51,387 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739465413]
[2024-06-04 17:27:51,387 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:27:51,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:27:51,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:28:05,536 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-04 17:28:05,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:28:05,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739465413]
[2024-06-04 17:28:05,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739465413] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:28:05,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:28:05,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:28:05,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3066687]
[2024-06-04 17:28:05,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:28:05,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:28:05,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:28:05,540 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:28:05,540 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:28:05,746 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:28:05,746 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 230 transitions, 2296 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:28:05,746 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:28:05,747 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:28:05,747 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:28:07,011 INFO  L124   PetriNetUnfolderBase]: 2082/3398 cut-off events.
[2024-06-04 17:28:07,011 INFO  L125   PetriNetUnfolderBase]: For 271610/271614 co-relation queries the response was YES.
[2024-06-04 17:28:07,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28221 conditions, 3398 events. 2082/3398 cut-off events. For 271610/271614 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19583 event pairs, 917 based on Foata normal form. 6/3400 useless extension candidates. Maximal degree in co-relation 28131. Up to 3027 conditions per place. 
[2024-06-04 17:28:07,041 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 195 selfloop transitions, 42 changer transitions 0/248 dead transitions.
[2024-06-04 17:28:07,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 248 transitions, 2998 flow
[2024-06-04 17:28:07,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:28:07,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:28:07,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-04 17:28:07,043 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-04 17:28:07,043 INFO  L175             Difference]: Start difference. First operand has 191 places, 230 transitions, 2296 flow. Second operand 8 states and 151 transitions.
[2024-06-04 17:28:07,043 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 248 transitions, 2998 flow
[2024-06-04 17:28:07,271 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 248 transitions, 2899 flow, removed 34 selfloop flow, removed 4 redundant places.
[2024-06-04 17:28:07,274 INFO  L231             Difference]: Finished difference. Result has 195 places, 233 transitions, 2355 flow
[2024-06-04 17:28:07,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2203, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2355, PETRI_PLACES=195, PETRI_TRANSITIONS=233}
[2024-06-04 17:28:07,275 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places.
[2024-06-04 17:28:07,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 233 transitions, 2355 flow
[2024-06-04 17:28:07,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:28:07,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:28:07,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:28:07,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 17:28:07,276 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:28:07,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:28:07,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -631943100, now seen corresponding path program 4 times
[2024-06-04 17:28:07,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:28:07,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880243842]
[2024-06-04 17:28:07,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:28:07,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:28:07,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:28:21,113 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-04 17:28:21,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:28:21,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880243842]
[2024-06-04 17:28:21,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880243842] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:28:21,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:28:21,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:28:21,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311081637]
[2024-06-04 17:28:21,115 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:28:21,115 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:28:21,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:28:21,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:28:21,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:28:21,378 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:28:21,379 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 233 transitions, 2355 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:28:21,379 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:28:21,379 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:28:21,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:28:22,600 INFO  L124   PetriNetUnfolderBase]: 2072/3384 cut-off events.
[2024-06-04 17:28:22,600 INFO  L125   PetriNetUnfolderBase]: For 273646/273650 co-relation queries the response was YES.
[2024-06-04 17:28:22,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28111 conditions, 3384 events. 2072/3384 cut-off events. For 273646/273650 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 19486 event pairs, 913 based on Foata normal form. 5/3388 useless extension candidates. Maximal degree in co-relation 28019. Up to 3021 conditions per place. 
[2024-06-04 17:28:22,627 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 192 selfloop transitions, 44 changer transitions 0/247 dead transitions.
[2024-06-04 17:28:22,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 247 transitions, 2883 flow
[2024-06-04 17:28:22,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 17:28:22,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 17:28:22,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-04 17:28:22,629 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4331395348837209
[2024-06-04 17:28:22,629 INFO  L175             Difference]: Start difference. First operand has 195 places, 233 transitions, 2355 flow. Second operand 8 states and 149 transitions.
[2024-06-04 17:28:22,629 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 247 transitions, 2883 flow
[2024-06-04 17:28:22,854 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 247 transitions, 2703 flow, removed 47 selfloop flow, removed 6 redundant places.
[2024-06-04 17:28:22,857 INFO  L231             Difference]: Finished difference. Result has 197 places, 233 transitions, 2270 flow
[2024-06-04 17:28:22,857 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2175, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2270, PETRI_PLACES=197, PETRI_TRANSITIONS=233}
[2024-06-04 17:28:22,858 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places.
[2024-06-04 17:28:22,858 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 233 transitions, 2270 flow
[2024-06-04 17:28:22,858 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:28:22,858 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:28:22,858 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:28:22,858 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 17:28:22,859 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:28:22,859 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:28:22,859 INFO  L85        PathProgramCache]: Analyzing trace with hash -631933180, now seen corresponding path program 1 times
[2024-06-04 17:28:22,859 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:28:22,859 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341226250]
[2024-06-04 17:28:22,859 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:28:22,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:28:22,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:28:37,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:28:37,009 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:28:37,009 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341226250]
[2024-06-04 17:28:37,009 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341226250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:28:37,009 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:28:37,009 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:28:37,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418350050]
[2024-06-04 17:28:37,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:28:37,010 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:28:37,010 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:28:37,010 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:28:37,010 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:28:37,309 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:28:37,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 233 transitions, 2270 flow. Second operand  has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-04 17:28:37,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:28:37,310 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:28:37,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:28:38,482 INFO  L124   PetriNetUnfolderBase]: 2208/3514 cut-off events.
[2024-06-04 17:28:38,482 INFO  L125   PetriNetUnfolderBase]: For 277898/277900 co-relation queries the response was YES.
[2024-06-04 17:28:38,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28945 conditions, 3514 events. 2208/3514 cut-off events. For 277898/277900 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19626 event pairs, 994 based on Foata normal form. 1/3514 useless extension candidates. Maximal degree in co-relation 28852. Up to 3317 conditions per place. 
[2024-06-04 17:28:38,518 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 221 selfloop transitions, 21 changer transitions 0/247 dead transitions.
[2024-06-04 17:28:38,518 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 247 transitions, 2856 flow
[2024-06-04 17:28:38,519 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:28:38,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:28:38,522 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions.
[2024-06-04 17:28:38,524 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38242894056847543
[2024-06-04 17:28:38,524 INFO  L175             Difference]: Start difference. First operand has 197 places, 233 transitions, 2270 flow. Second operand 9 states and 148 transitions.
[2024-06-04 17:28:38,524 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 247 transitions, 2856 flow
[2024-06-04 17:28:38,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 247 transitions, 2758 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-04 17:28:38,788 INFO  L231             Difference]: Finished difference. Result has 199 places, 236 transitions, 2302 flow
[2024-06-04 17:28:38,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2172, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2302, PETRI_PLACES=199, PETRI_TRANSITIONS=236}
[2024-06-04 17:28:38,788 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 155 predicate places.
[2024-06-04 17:28:38,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 236 transitions, 2302 flow
[2024-06-04 17:28:38,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-04 17:28:38,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:28:38,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:28:38,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 17:28:38,789 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:28:38,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:28:38,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 1091544496, now seen corresponding path program 1 times
[2024-06-04 17:28:38,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:28:38,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6308215]
[2024-06-04 17:28:38,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:28:38,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:28:38,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:28:52,788 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-04 17:28:52,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:28:52,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6308215]
[2024-06-04 17:28:52,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6308215] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:28:52,789 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:28:52,789 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:28:52,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628339439]
[2024-06-04 17:28:52,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:28:52,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:28:52,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:28:52,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:28:52,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:28:52,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:28:52,980 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 236 transitions, 2302 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:28:52,981 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:28:52,981 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:28:52,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:28:54,362 INFO  L124   PetriNetUnfolderBase]: 2226/3584 cut-off events.
[2024-06-04 17:28:54,362 INFO  L125   PetriNetUnfolderBase]: For 304980/305006 co-relation queries the response was YES.
[2024-06-04 17:28:54,379 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29763 conditions, 3584 events. 2226/3584 cut-off events. For 304980/305006 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 20388 event pairs, 641 based on Foata normal form. 18/3589 useless extension candidates. Maximal degree in co-relation 29669. Up to 3085 conditions per place. 
[2024-06-04 17:28:54,393 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 224 selfloop transitions, 33 changer transitions 0/280 dead transitions.
[2024-06-04 17:28:54,394 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 280 transitions, 3080 flow
[2024-06-04 17:28:54,394 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:28:54,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:28:54,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-04 17:28:54,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4780361757105943
[2024-06-04 17:28:54,395 INFO  L175             Difference]: Start difference. First operand has 199 places, 236 transitions, 2302 flow. Second operand 9 states and 185 transitions.
[2024-06-04 17:28:54,395 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 280 transitions, 3080 flow
[2024-06-04 17:28:54,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 280 transitions, 2902 flow, removed 38 selfloop flow, removed 10 redundant places.
[2024-06-04 17:28:54,658 INFO  L231             Difference]: Finished difference. Result has 200 places, 247 transitions, 2367 flow
[2024-06-04 17:28:54,659 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2367, PETRI_PLACES=200, PETRI_TRANSITIONS=247}
[2024-06-04 17:28:54,659 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places.
[2024-06-04 17:28:54,659 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 247 transitions, 2367 flow
[2024-06-04 17:28:54,659 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:28:54,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:28:54,660 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:28:54,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 17:28:54,660 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:28:54,660 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:28:54,660 INFO  L85        PathProgramCache]: Analyzing trace with hash 1710466596, now seen corresponding path program 2 times
[2024-06-04 17:28:54,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:28:54,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096758700]
[2024-06-04 17:28:54,665 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:28:54,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:28:54,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:29:07,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:29:07,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:29:07,658 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096758700]
[2024-06-04 17:29:07,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096758700] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:29:07,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:29:07,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:29:07,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472278930]
[2024-06-04 17:29:07,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:29:07,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:29:07,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:29:07,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:29:07,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:29:07,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:29:07,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 247 transitions, 2367 flow. Second operand  has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:29:07,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:29:07,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:29:07,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:29:09,317 INFO  L124   PetriNetUnfolderBase]: 2429/3925 cut-off events.
[2024-06-04 17:29:09,318 INFO  L125   PetriNetUnfolderBase]: For 315328/315334 co-relation queries the response was YES.
[2024-06-04 17:29:09,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32553 conditions, 3925 events. 2429/3925 cut-off events. For 315328/315334 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 22576 event pairs, 588 based on Foata normal form. 16/3931 useless extension candidates. Maximal degree in co-relation 32457. Up to 3273 conditions per place. 
[2024-06-04 17:29:09,349 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 233 selfloop transitions, 52 changer transitions 0/308 dead transitions.
[2024-06-04 17:29:09,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 308 transitions, 3528 flow
[2024-06-04 17:29:09,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:29:09,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:29:09,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-04 17:29:09,351 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-04 17:29:09,351 INFO  L175             Difference]: Start difference. First operand has 200 places, 247 transitions, 2367 flow. Second operand 9 states and 184 transitions.
[2024-06-04 17:29:09,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 308 transitions, 3528 flow
[2024-06-04 17:29:09,682 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 308 transitions, 3326 flow, removed 55 selfloop flow, removed 5 redundant places.
[2024-06-04 17:29:09,685 INFO  L231             Difference]: Finished difference. Result has 208 places, 276 transitions, 2821 flow
[2024-06-04 17:29:09,685 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2821, PETRI_PLACES=208, PETRI_TRANSITIONS=276}
[2024-06-04 17:29:09,686 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 164 predicate places.
[2024-06-04 17:29:09,686 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 276 transitions, 2821 flow
[2024-06-04 17:29:09,686 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:29:09,686 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:29:09,686 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:29:09,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 17:29:09,687 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:29:09,687 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:29:09,687 INFO  L85        PathProgramCache]: Analyzing trace with hash -1666424412, now seen corresponding path program 3 times
[2024-06-04 17:29:09,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:29:09,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106904613]
[2024-06-04 17:29:09,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:29:09,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:29:09,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:29:24,113 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-04 17:29:24,114 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:29:24,114 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106904613]
[2024-06-04 17:29:24,114 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106904613] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:29:24,114 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:29:24,114 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 17:29:24,114 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529643440]
[2024-06-04 17:29:24,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:29:24,114 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 17:29:24,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:29:24,115 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 17:29:24,115 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 17:29:24,225 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:29:24,226 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 276 transitions, 2821 flow. Second operand  has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:29:24,226 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:29:24,226 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:29:24,226 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:29:25,733 INFO  L124   PetriNetUnfolderBase]: 2477/4011 cut-off events.
[2024-06-04 17:29:25,733 INFO  L125   PetriNetUnfolderBase]: For 338211/338218 co-relation queries the response was YES.
[2024-06-04 17:29:25,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33917 conditions, 4011 events. 2477/4011 cut-off events. For 338211/338218 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 23287 event pairs, 700 based on Foata normal form. 18/4021 useless extension candidates. Maximal degree in co-relation 33816. Up to 3431 conditions per place. 
[2024-06-04 17:29:25,768 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 237 selfloop transitions, 52 changer transitions 0/312 dead transitions.
[2024-06-04 17:29:25,768 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 312 transitions, 3651 flow
[2024-06-04 17:29:25,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:29:25,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:29:25,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-04 17:29:25,771 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4728682170542636
[2024-06-04 17:29:25,771 INFO  L175             Difference]: Start difference. First operand has 208 places, 276 transitions, 2821 flow. Second operand 9 states and 183 transitions.
[2024-06-04 17:29:25,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 312 transitions, 3651 flow
[2024-06-04 17:29:26,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 312 transitions, 3548 flow, removed 28 selfloop flow, removed 4 redundant places.
[2024-06-04 17:29:26,157 INFO  L231             Difference]: Finished difference. Result has 214 places, 282 transitions, 2950 flow
[2024-06-04 17:29:26,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2950, PETRI_PLACES=214, PETRI_TRANSITIONS=282}
[2024-06-04 17:29:26,157 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 170 predicate places.
[2024-06-04 17:29:26,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 282 transitions, 2950 flow
[2024-06-04 17:29:26,158 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:29:26,158 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:29:26,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:29:26,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 17:29:26,158 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:29:26,161 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:29:26,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 1433047892, now seen corresponding path program 1 times
[2024-06-04 17:29:26,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:29:26,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056718113]
[2024-06-04 17:29:26,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:29:26,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:29:26,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:29:39,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 17:29:39,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:29:39,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056718113]
[2024-06-04 17:29:39,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056718113] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:29:39,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:29:39,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 17:29:39,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227980482]
[2024-06-04 17:29:39,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:29:39,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 17:29:39,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:29:39,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 17:29:39,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2024-06-04 17:29:39,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-04 17:29:39,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 282 transitions, 2950 flow. Second operand  has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-04 17:29:39,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:29:39,766 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-04 17:29:39,766 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:29:41,295 INFO  L124   PetriNetUnfolderBase]: 2793/4454 cut-off events.
[2024-06-04 17:29:41,295 INFO  L125   PetriNetUnfolderBase]: For 342876/342878 co-relation queries the response was YES.
[2024-06-04 17:29:41,319 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37179 conditions, 4454 events. 2793/4454 cut-off events. For 342876/342878 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 25582 event pairs, 659 based on Foata normal form. 5/4458 useless extension candidates. Maximal degree in co-relation 37077. Up to 3813 conditions per place. 
[2024-06-04 17:29:41,337 INFO  L140   encePairwiseOnDemand]: 28/43 looper letters, 279 selfloop transitions, 78 changer transitions 0/362 dead transitions.
[2024-06-04 17:29:41,337 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 362 transitions, 4635 flow
[2024-06-04 17:29:41,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 17:29:41,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 17:29:41,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-04 17:29:41,338 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-04 17:29:41,339 INFO  L175             Difference]: Start difference. First operand has 214 places, 282 transitions, 2950 flow. Second operand 10 states and 190 transitions.
[2024-06-04 17:29:41,339 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 362 transitions, 4635 flow
[2024-06-04 17:29:41,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 362 transitions, 4489 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 17:29:41,770 INFO  L231             Difference]: Finished difference. Result has 221 places, 320 transitions, 3540 flow
[2024-06-04 17:29:41,770 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2804, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3540, PETRI_PLACES=221, PETRI_TRANSITIONS=320}
[2024-06-04 17:29:41,770 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 177 predicate places.
[2024-06-04 17:29:41,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 320 transitions, 3540 flow
[2024-06-04 17:29:41,771 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 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-04 17:29:41,771 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:29:41,771 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:29:41,771 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 17:29:41,771 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:29:41,772 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:29:41,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -26607888, now seen corresponding path program 4 times
[2024-06-04 17:29:41,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:29:41,772 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419406370]
[2024-06-04 17:29:41,772 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:29:41,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:29:41,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 17:29:54,083 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-04 17:29:54,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 17:29:54,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419406370]
[2024-06-04 17:29:54,084 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419406370] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 17:29:54,084 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 17:29:54,084 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 17:29:54,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917796290]
[2024-06-04 17:29:54,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 17:29:54,085 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 17:29:54,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 17:29:54,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 17:29:54,085 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-04 17:29:54,253 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-04 17:29:54,254 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 320 transitions, 3540 flow. Second operand  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:29:54,254 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 17:29:54,254 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-04 17:29:54,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 17:29:55,841 INFO  L124   PetriNetUnfolderBase]: 2855/4611 cut-off events.
[2024-06-04 17:29:55,842 INFO  L125   PetriNetUnfolderBase]: For 375785/375791 co-relation queries the response was YES.
[2024-06-04 17:29:55,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39156 conditions, 4611 events. 2855/4611 cut-off events. For 375785/375791 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 27190 event pairs, 574 based on Foata normal form. 16/4622 useless extension candidates. Maximal degree in co-relation 39050. Up to 3736 conditions per place. 
[2024-06-04 17:29:55,888 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 271 selfloop transitions, 71 changer transitions 0/370 dead transitions.
[2024-06-04 17:29:55,888 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 370 transitions, 4608 flow
[2024-06-04 17:29:55,890 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 17:29:55,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 17:29:55,891 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-04 17:29:55,891 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-04 17:29:55,891 INFO  L175             Difference]: Start difference. First operand has 221 places, 320 transitions, 3540 flow. Second operand 9 states and 184 transitions.
[2024-06-04 17:29:55,891 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 370 transitions, 4608 flow
[2024-06-04 17:29:56,309 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 370 transitions, 4443 flow, removed 60 selfloop flow, removed 4 redundant places.
[2024-06-04 17:29:56,313 INFO  L231             Difference]: Finished difference. Result has 228 places, 337 transitions, 3821 flow
[2024-06-04 17:29:56,313 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3821, PETRI_PLACES=228, PETRI_TRANSITIONS=337}
[2024-06-04 17:29:56,314 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 184 predicate places.
[2024-06-04 17:29:56,314 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 337 transitions, 3821 flow
[2024-06-04 17:29:56,314 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.6) internal successors, (126), 10 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 17:29:56,314 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 17:29:56,314 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 17:29:56,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 17:29:56,315 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 17:29:56,315 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 17:29:56,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -1632451760, now seen corresponding path program 2 times
[2024-06-04 17:29:56,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 17:29:56,315 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962542174]
[2024-06-04 17:29:56,315 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 17:29:56,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 17:29:56,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15