./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix038_tso.oepc.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_tso.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix038_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 21:55:22,576 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 21:55:22,650 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 21:55:22,655 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 21:55:22,656 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 21:55:22,694 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 21:55:22,694 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 21:55:22,695 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 21:55:22,695 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 21:55:22,698 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 21:55:22,698 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 21:55:22,699 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 21:55:22,699 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 21:55:22,700 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 21:55:22,700 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 21:55:22,700 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 21:55:22,701 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 21:55:22,701 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 21:55:22,701 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 21:55:22,701 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 21:55:22,701 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 21:55:22,702 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 21:55:22,702 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 21:55:22,702 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 21:55:22,702 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 21:55:22,702 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 21:55:22,703 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 21:55:22,703 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 21:55:22,703 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 21:55:22,703 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 21:55:22,704 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 21:55:22,704 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 21:55:22,704 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:55:22,705 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 21:55:22,705 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 21:55:22,705 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 21:55:22,705 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 21:55:22,705 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 21:55:22,705 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 21:55:22,706 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 21:55:22,706 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 21:55:22,706 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 21:55:22,706 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 21:55:22,706 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-03 21:55:22,938 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 21:55:22,958 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 21:55:22,960 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 21:55:22,961 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 21:55:22,961 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 21:55:22,962 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i
[2024-06-03 21:55:23,904 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 21:55:24,099 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 21:55:24,100 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i
[2024-06-03 21:55:24,116 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e669d52a4/7d69050e1dd5472484d2d564b04d9f98/FLAG64210a75a
[2024-06-03 21:55:24,133 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e669d52a4/7d69050e1dd5472484d2d564b04d9f98
[2024-06-03 21:55:24,135 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 21:55:24,135 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 21:55:24,136 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_tso.oepc.yml/witness.yml
[2024-06-03 21:55:24,300 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 21:55:24,301 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 21:55:24,302 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 21:55:24,302 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 21:55:24,306 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 21:55:24,307 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:55:24" (1/2) ...
[2024-06-03 21:55:24,308 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f9636e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:55:24, skipping insertion in model container
[2024-06-03 21:55:24,308 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:55:24" (1/2) ...
[2024-06-03 21:55:24,309 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5f2ea615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:55:24, skipping insertion in model container
[2024-06-03 21:55:24,310 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:55:24" (2/2) ...
[2024-06-03 21:55:24,310 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f9636e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:24, skipping insertion in model container
[2024-06-03 21:55:24,310 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:55:24" (2/2) ...
[2024-06-03 21:55:24,310 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 21:55:24,389 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 21:55:24,390 INFO  L97    edCorrectnessWitness]: Location invariant before [L836-L836] ((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_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 || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-03 21:55:24,391 INFO  L97    edCorrectnessWitness]: Location invariant before [L835-L835] ((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_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 || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-03 21:55:24,392 INFO  L97    edCorrectnessWitness]: Location invariant before [L833-L833] ((((((((((((((((((((! multithreaded || x$r_buff0_thd3 == (_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 || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= x && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )x$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 )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )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 )x$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )y >= 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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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 )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )x$flush_delayed >= 0LL) && (long long )a + (long long )x$mem_tmp >= 0LL) && (long long )a + (long long )x$r_buff0_thd0 >= 0LL) && (long long )a + (long long )x$r_buff0_thd1 >= 0LL) && (long long )a + (long long )x$r_buff0_thd2 >= 0LL) && (long long )a + (long long )x$r_buff0_thd3 >= 0LL) && (long long )a + (long long )x$r_buff1_thd0 >= 0LL) && (long long )a + (long long )x$r_buff1_thd1 >= 0LL) && (long long )a + (long long )x$r_buff1_thd2 >= 0LL) && (long long )a + (long long )x$r_buff1_thd3 >= 0LL) && (long long )a + (long long )x$read_delayed >= 0LL) && (long long )a + (long long )x$w_buff0 >= 0LL) && (long long )a + (long long )x$w_buff1 >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )z >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )z >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )z >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )z >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )z >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd3 + (long long )y >= 0LL) && (long long )x$r_buff0_thd3 + (long long )z >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )z >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )z >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )z >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd3 + (long long )y >= 0LL) && (long long )x$r_buff1_thd3 + (long long )z >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )z >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )z >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 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 )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd3 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )x$read_delayed >= 0LL) && (long long )a - (long long )x$r_buff0_thd0 >= 0LL) && (long long )a - (long long )x$r_buff0_thd1 >= 0LL) && (long long )a - (long long )x$r_buff0_thd3 >= 0LL) && (long long )a - (long long )x$r_buff1_thd0 >= 0LL) && (long long )a - (long long )x$r_buff1_thd1 >= 0LL) && (long long )a - (long long )x$r_buff1_thd3 >= 0LL) && (long long )a - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && 0 <= z) && __unbuffered_p1_EAX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && x$w_buff0 <= 127) && x$w_buff1 <= 127) && y <= 1) && z <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && x$w_buff0 % 2 == 0) && x$w_buff1 % 2 == 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)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff0 && x$w_buff0 <= 127) && x$w_buff0 % 2 == 0) && (x$w_buff0 == 0 || x$w_buff0 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= x$mem_tmp && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= x$w_buff1 && x$w_buff1 <= 127) && x$w_buff1 % 2 == 0) && (x$w_buff1 == 0 || x$w_buff1 == 2)))
[2024-06-03 21:55:24,393 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 21:55:24,393 INFO  L106   edCorrectnessWitness]: ghost_update [L831-L831] multithreaded = 1;
[2024-06-03 21:55:24,429 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 21:55:24,702 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:55:24,713 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 21:55:25,033 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:55:25,098 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 21:55:25,101 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25 WrapperNode
[2024-06-03 21:55:25,101 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 21:55:25,117 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 21:55:25,117 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 21:55:25,117 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 21:55:25,123 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,162 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,250 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 146
[2024-06-03 21:55:25,251 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 21:55:25,252 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 21:55:25,252 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 21:55:25,252 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 21:55:25,261 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,261 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,277 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,310 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-03 21:55:25,310 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,311 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,331 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,333 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,344 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,351 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,366 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 21:55:25,367 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 21:55:25,367 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 21:55:25,367 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 21:55:25,368 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (1/1) ...
[2024-06-03 21:55:25,372 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:55:25,378 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 21:55:25,390 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-03 21:55:25,400 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-03 21:55:25,422 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 21:55:25,422 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 21:55:25,423 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 21:55:25,423 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 21:55:25,423 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 21:55:25,423 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 21:55:25,423 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 21:55:25,423 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 21:55:25,424 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 21:55:25,424 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 21:55:25,424 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 21:55:25,424 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 21:55:25,425 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 21:55:25,559 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 21:55:25,562 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 21:55:26,804 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 21:55:26,805 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 21:55:27,103 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 21:55:27,103 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 21:55:27,105 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:55:27 BoogieIcfgContainer
[2024-06-03 21:55:27,105 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 21:55:27,107 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 21:55:27,107 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 21:55:27,109 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 21:55:27,109 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:55:24" (1/4) ...
[2024-06-03 21:55:27,110 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb29a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:55:27, skipping insertion in model container
[2024-06-03 21:55:27,110 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:55:24" (2/4) ...
[2024-06-03 21:55:27,110 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb29a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:55:27, skipping insertion in model container
[2024-06-03 21:55:27,110 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:55:25" (3/4) ...
[2024-06-03 21:55:27,111 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5bb29a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:55:27, skipping insertion in model container
[2024-06-03 21:55:27,111 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:55:27" (4/4) ...
[2024-06-03 21:55:27,112 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i
[2024-06-03 21:55:27,125 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 21:55:27,126 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 21:55:27,126 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 21:55:27,238 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 21:55:27,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-03 21:55:27,337 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-03 21:55:27,338 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:55:27,340 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 63 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-03 21:55:27,340 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-03 21:55:27,342 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-03 21:55:27,348 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 21:55:27,353 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;@33d2f0cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 21:55:27,353 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 21:55:27,359 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 21:55:27,359 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 21:55:27,359 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:55:27,359 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:27,360 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:27,360 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-03 21:55:27,364 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:27,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -1115339954, now seen corresponding path program 1 times
[2024-06-03 21:55:27,371 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:27,371 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346824353]
[2024-06-03 21:55:27,371 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:27,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:27,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:33,827 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-03 21:55:33,827 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:33,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346824353]
[2024-06-03 21:55:33,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346824353] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:33,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:33,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 21:55:33,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793400640]
[2024-06-03 21:55:33,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:33,836 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 21:55:33,839 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:33,860 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 21:55:33,861 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 21:55:33,977 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 43
[2024-06-03 21:55:33,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:33,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:33,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 43
[2024-06-03 21:55:33,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:34,971 INFO  L124   PetriNetUnfolderBase]: 1363/2171 cut-off events.
[2024-06-03 21:55:34,971 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-03 21:55:34,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 2171 events. 1363/2171 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10812 event pairs, 964 based on Foata normal form. 1/2090 useless extension candidates. Maximal degree in co-relation 4282. Up to 2037 conditions per place. 
[2024-06-03 21:55:34,986 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 34 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-03 21:55:34,986 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 179 flow
[2024-06-03 21:55:34,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 21:55:34,990 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 21:55:34,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions.
[2024-06-03 21:55:34,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5736434108527132
[2024-06-03 21:55:34,997 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 74 transitions.
[2024-06-03 21:55:34,998 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 179 flow
[2024-06-03 21:55:35,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 21:55:35,003 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-03 21:55:35,005 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-03 21:55:35,007 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-03 21:55:35,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-03 21:55:35,008 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:35,008 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:35,008 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:35,008 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 21:55:35,008 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-03 21:55:35,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:35,010 INFO  L85        PathProgramCache]: Analyzing trace with hash 1900162157, now seen corresponding path program 1 times
[2024-06-03 21:55:35,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:35,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191111573]
[2024-06-03 21:55:35,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:35,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:35,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:39,911 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-03 21:55:39,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:39,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191111573]
[2024-06-03 21:55:39,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191111573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:39,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:39,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 21:55:39,913 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33898865]
[2024-06-03 21:55:39,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:39,914 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 21:55:39,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:39,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 21:55:39,915 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 21:55:40,019 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-03 21:55:40,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:40,020 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:40,020 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-03 21:55:40,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:40,962 INFO  L124   PetriNetUnfolderBase]: 1564/2416 cut-off events.
[2024-06-03 21:55:40,963 INFO  L125   PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES.
[2024-06-03 21:55:40,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5445 conditions, 2416 events. 1564/2416 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11779 event pairs, 981 based on Foata normal form. 3/2382 useless extension candidates. Maximal degree in co-relation 5430. Up to 2310 conditions per place. 
[2024-06-03 21:55:40,974 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 42 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-03 21:55:40,975 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 248 flow
[2024-06-03 21:55:40,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 21:55:40,976 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 21:55:40,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-06-03 21:55:40,977 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5348837209302325
[2024-06-03 21:55:40,977 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 92 transitions.
[2024-06-03 21:55:40,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 248 flow
[2024-06-03 21:55:40,978 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 21:55:40,979 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-03 21:55:40,979 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-03 21:55:40,979 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-03 21:55:40,980 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-03 21:55:40,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:40,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:40,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:40,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 21:55:40,981 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-03 21:55:40,981 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:40,981 INFO  L85        PathProgramCache]: Analyzing trace with hash -1224514155, now seen corresponding path program 1 times
[2024-06-03 21:55:40,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:40,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405597820]
[2024-06-03 21:55:40,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:40,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:41,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:45,704 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-03 21:55:45,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:45,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405597820]
[2024-06-03 21:55:45,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405597820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:45,705 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:45,706 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 21:55:45,706 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591469122]
[2024-06-03 21:55:45,706 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:45,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 21:55:45,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:45,707 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 21:55:45,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-03 21:55:45,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-03 21:55:45,812 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:45,813 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:45,813 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-03 21:55:45,813 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:46,756 INFO  L124   PetriNetUnfolderBase]: 1552/2400 cut-off events.
[2024-06-03 21:55:46,756 INFO  L125   PetriNetUnfolderBase]: For 1262/1262 co-relation queries the response was YES.
[2024-06-03 21:55:46,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5997 conditions, 2400 events. 1552/2400 cut-off events. For 1262/1262 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11685 event pairs, 697 based on Foata normal form. 6/2369 useless extension candidates. Maximal degree in co-relation 5980. Up to 2262 conditions per place. 
[2024-06-03 21:55:46,770 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 50 selfloop transitions, 10 changer transitions 0/65 dead transitions.
[2024-06-03 21:55:46,770 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 330 flow
[2024-06-03 21:55:46,771 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:55:46,772 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:55:46,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions.
[2024-06-03 21:55:46,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5255813953488372
[2024-06-03 21:55:46,773 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 113 transitions.
[2024-06-03 21:55:46,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 330 flow
[2024-06-03 21:55:46,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 316 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-03 21:55:46,776 INFO  L231             Difference]: Finished difference. Result has 50 places, 43 transitions, 176 flow
[2024-06-03 21:55:46,776 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=43}
[2024-06-03 21:55:46,777 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places.
[2024-06-03 21:55:46,777 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 176 flow
[2024-06-03 21:55:46,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:46,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:46,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:46,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 21:55:46,778 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-03 21:55:46,778 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:46,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 62973076, now seen corresponding path program 1 times
[2024-06-03 21:55:46,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:46,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373723058]
[2024-06-03 21:55:46,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:46,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:46,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:52,185 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-03 21:55:52,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:52,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373723058]
[2024-06-03 21:55:52,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373723058] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:52,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:52,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:55:52,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242069431]
[2024-06-03 21:55:52,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:52,193 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:55:52,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:52,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:55:52,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:55:52,316 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-03 21:55:52,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 176 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:52,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:52,317 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-03 21:55:52,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:53,463 INFO  L124   PetriNetUnfolderBase]: 1543/2383 cut-off events.
[2024-06-03 21:55:53,463 INFO  L125   PetriNetUnfolderBase]: For 2338/2338 co-relation queries the response was YES.
[2024-06-03 21:55:53,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6527 conditions, 2383 events. 1543/2383 cut-off events. For 2338/2338 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11595 event pairs, 534 based on Foata normal form. 6/2352 useless extension candidates. Maximal degree in co-relation 6509. Up to 2217 conditions per place. 
[2024-06-03 21:55:53,476 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 54 selfloop transitions, 12 changer transitions 0/71 dead transitions.
[2024-06-03 21:55:53,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 384 flow
[2024-06-03 21:55:53,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:55:53,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:55:53,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions.
[2024-06-03 21:55:53,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 21:55:53,480 INFO  L175             Difference]: Start difference. First operand has 50 places, 43 transitions, 176 flow. Second operand 6 states and 129 transitions.
[2024-06-03 21:55:53,480 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 384 flow
[2024-06-03 21:55:53,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 360 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-03 21:55:53,484 INFO  L231             Difference]: Finished difference. Result has 52 places, 44 transitions, 195 flow
[2024-06-03 21:55:53,484 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=52, PETRI_TRANSITIONS=44}
[2024-06-03 21:55:53,485 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places.
[2024-06-03 21:55:53,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 195 flow
[2024-06-03 21:55:53,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:55:53,486 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:53,486 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:53,486 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 21:55:53,486 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-03 21:55:53,487 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:53,487 INFO  L85        PathProgramCache]: Analyzing trace with hash -548304503, now seen corresponding path program 1 times
[2024-06-03 21:55:53,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:53,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872284843]
[2024-06-03 21:55:53,487 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:53,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:53,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:02,364 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-03 21:56:02,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:02,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872284843]
[2024-06-03 21:56:02,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872284843] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:02,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:02,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:56:02,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674385427]
[2024-06-03 21:56:02,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:02,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:56:02,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:02,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:56:02,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:56:02,508 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-03 21:56:02,508 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 195 flow. Second operand  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:02,508 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:02,509 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-03 21:56:02,509 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:03,359 INFO  L124   PetriNetUnfolderBase]: 1331/2197 cut-off events.
[2024-06-03 21:56:03,359 INFO  L125   PetriNetUnfolderBase]: For 3113/3113 co-relation queries the response was YES.
[2024-06-03 21:56:03,362 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6203 conditions, 2197 events. 1331/2197 cut-off events. For 3113/3113 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11373 event pairs, 638 based on Foata normal form. 2/2191 useless extension candidates. Maximal degree in co-relation 6184. Up to 1979 conditions per place. 
[2024-06-03 21:56:03,369 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 44 selfloop transitions, 8 changer transitions 0/58 dead transitions.
[2024-06-03 21:56:03,369 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 343 flow
[2024-06-03 21:56:03,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:56:03,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:56:03,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions.
[2024-06-03 21:56:03,370 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44651162790697674
[2024-06-03 21:56:03,370 INFO  L175             Difference]: Start difference. First operand has 52 places, 44 transitions, 195 flow. Second operand 5 states and 96 transitions.
[2024-06-03 21:56:03,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 343 flow
[2024-06-03 21:56:03,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 310 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-03 21:56:03,372 INFO  L231             Difference]: Finished difference. Result has 53 places, 47 transitions, 208 flow
[2024-06-03 21:56:03,374 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=53, PETRI_TRANSITIONS=47}
[2024-06-03 21:56:03,374 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places.
[2024-06-03 21:56:03,374 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 208 flow
[2024-06-03 21:56:03,375 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:03,375 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:03,375 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:03,375 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 21:56:03,375 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-03 21:56:03,375 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:03,376 INFO  L85        PathProgramCache]: Analyzing trace with hash 1381613626, now seen corresponding path program 1 times
[2024-06-03 21:56:03,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:03,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166539306]
[2024-06-03 21:56:03,376 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:03,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:03,419 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:12,261 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-03 21:56:12,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:12,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166539306]
[2024-06-03 21:56:12,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166539306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:12,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:12,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:56:12,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597807724]
[2024-06-03 21:56:12,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:12,262 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:56:12,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:12,263 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:56:12,263 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:56:12,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:56:12,412 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 208 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:12,412 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:12,412 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:56:12,412 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:13,391 INFO  L124   PetriNetUnfolderBase]: 1549/2421 cut-off events.
[2024-06-03 21:56:13,391 INFO  L125   PetriNetUnfolderBase]: For 5049/5049 co-relation queries the response was YES.
[2024-06-03 21:56:13,394 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7489 conditions, 2421 events. 1549/2421 cut-off events. For 5049/5049 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11888 event pairs, 737 based on Foata normal form. 2/2410 useless extension candidates. Maximal degree in co-relation 7468. Up to 2277 conditions per place. 
[2024-06-03 21:56:13,402 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 52 selfloop transitions, 11 changer transitions 0/68 dead transitions.
[2024-06-03 21:56:13,402 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 400 flow
[2024-06-03 21:56:13,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:56:13,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:56:13,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-03 21:56:13,403 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-03 21:56:13,403 INFO  L175             Difference]: Start difference. First operand has 53 places, 47 transitions, 208 flow. Second operand 6 states and 111 transitions.
[2024-06-03 21:56:13,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 400 flow
[2024-06-03 21:56:13,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 378 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-03 21:56:13,406 INFO  L231             Difference]: Finished difference. Result has 56 places, 50 transitions, 242 flow
[2024-06-03 21:56:13,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=56, PETRI_TRANSITIONS=50}
[2024-06-03 21:56:13,406 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places.
[2024-06-03 21:56:13,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 242 flow
[2024-06-03 21:56:13,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:13,407 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:13,407 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:13,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 21:56:13,407 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-03 21:56:13,407 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:13,408 INFO  L85        PathProgramCache]: Analyzing trace with hash 529202596, now seen corresponding path program 2 times
[2024-06-03 21:56:13,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:13,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032093289]
[2024-06-03 21:56:13,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:13,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:13,449 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:22,526 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-03 21:56:22,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:22,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032093289]
[2024-06-03 21:56:22,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032093289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:22,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:22,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:56:22,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121612374]
[2024-06-03 21:56:22,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:22,528 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:56:22,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:22,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:56:22,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:56:22,654 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:56:22,654 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 242 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:22,654 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:22,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:56:22,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:23,617 INFO  L124   PetriNetUnfolderBase]: 1544/2421 cut-off events.
[2024-06-03 21:56:23,617 INFO  L125   PetriNetUnfolderBase]: For 6864/6874 co-relation queries the response was YES.
[2024-06-03 21:56:23,620 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8032 conditions, 2421 events. 1544/2421 cut-off events. For 6864/6874 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11982 event pairs, 735 based on Foata normal form. 10/2421 useless extension candidates. Maximal degree in co-relation 8010. Up to 2252 conditions per place. 
[2024-06-03 21:56:23,627 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 47 selfloop transitions, 16 changer transitions 0/68 dead transitions.
[2024-06-03 21:56:23,627 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 68 transitions, 432 flow
[2024-06-03 21:56:23,627 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:56:23,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:56:23,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-03 21:56:23,628 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4263565891472868
[2024-06-03 21:56:23,628 INFO  L175             Difference]: Start difference. First operand has 56 places, 50 transitions, 242 flow. Second operand 6 states and 110 transitions.
[2024-06-03 21:56:23,628 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 68 transitions, 432 flow
[2024-06-03 21:56:23,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 400 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-03 21:56:23,631 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 282 flow
[2024-06-03 21:56:23,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=282, PETRI_PLACES=58, PETRI_TRANSITIONS=53}
[2024-06-03 21:56:23,631 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places.
[2024-06-03 21:56:23,632 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 282 flow
[2024-06-03 21:56:23,632 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:23,632 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:23,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:23,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 21:56:23,632 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-03 21:56:23,633 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:23,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 529210532, now seen corresponding path program 1 times
[2024-06-03 21:56:23,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:23,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937193959]
[2024-06-03 21:56:23,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:23,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:23,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:33,303 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:33,303 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:33,303 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937193959]
[2024-06-03 21:56:33,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937193959] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:33,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:33,304 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:56:33,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671173272]
[2024-06-03 21:56:33,304 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:33,304 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:56:33,304 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:33,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:56:33,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:56:33,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:56:33,500 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 282 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:33,500 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:33,500 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:56:33,500 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:34,576 INFO  L124   PetriNetUnfolderBase]: 1629/2627 cut-off events.
[2024-06-03 21:56:34,576 INFO  L125   PetriNetUnfolderBase]: For 8931/8931 co-relation queries the response was YES.
[2024-06-03 21:56:34,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8989 conditions, 2627 events. 1629/2627 cut-off events. For 8931/8931 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 13358 event pairs, 757 based on Foata normal form. 2/2617 useless extension candidates. Maximal degree in co-relation 8966. Up to 2393 conditions per place. 
[2024-06-03 21:56:34,587 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 59 selfloop transitions, 14 changer transitions 0/78 dead transitions.
[2024-06-03 21:56:34,587 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 78 transitions, 515 flow
[2024-06-03 21:56:34,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:56:34,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:56:34,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-03 21:56:34,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4119601328903654
[2024-06-03 21:56:34,591 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 282 flow. Second operand 7 states and 124 transitions.
[2024-06-03 21:56:34,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 78 transitions, 515 flow
[2024-06-03 21:56:34,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 464 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-03 21:56:34,595 INFO  L231             Difference]: Finished difference. Result has 62 places, 59 transitions, 318 flow
[2024-06-03 21:56:34,595 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=62, PETRI_TRANSITIONS=59}
[2024-06-03 21:56:34,596 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 18 predicate places.
[2024-06-03 21:56:34,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 318 flow
[2024-06-03 21:56:34,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:34,596 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:34,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:34,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 21:56:34,596 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:34,597 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:34,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -119654472, now seen corresponding path program 1 times
[2024-06-03 21:56:34,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:34,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074192989]
[2024-06-03 21:56:34,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:34,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:34,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:43,721 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:43,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:43,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074192989]
[2024-06-03 21:56:43,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074192989] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:43,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:43,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:56:43,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089943803]
[2024-06-03 21:56:43,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:43,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:56:43,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:43,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:56:43,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:56:43,906 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:56:43,907 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 318 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:43,907 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:43,907 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:56:43,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:45,139 INFO  L124   PetriNetUnfolderBase]: 1838/2843 cut-off events.
[2024-06-03 21:56:45,139 INFO  L125   PetriNetUnfolderBase]: For 13450/13460 co-relation queries the response was YES.
[2024-06-03 21:56:45,143 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10840 conditions, 2843 events. 1838/2843 cut-off events. For 13450/13460 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14143 event pairs, 668 based on Foata normal form. 4/2826 useless extension candidates. Maximal degree in co-relation 10815. Up to 2652 conditions per place. 
[2024-06-03 21:56:45,151 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 75 selfloop transitions, 17 changer transitions 0/98 dead transitions.
[2024-06-03 21:56:45,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 98 transitions, 626 flow
[2024-06-03 21:56:45,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:56:45,152 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:56:45,153 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-03 21:56:45,153 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.436046511627907
[2024-06-03 21:56:45,153 INFO  L175             Difference]: Start difference. First operand has 62 places, 59 transitions, 318 flow. Second operand 8 states and 150 transitions.
[2024-06-03 21:56:45,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 98 transitions, 626 flow
[2024-06-03 21:56:45,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 98 transitions, 586 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-03 21:56:45,158 INFO  L231             Difference]: Finished difference. Result has 67 places, 65 transitions, 372 flow
[2024-06-03 21:56:45,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=372, PETRI_PLACES=67, PETRI_TRANSITIONS=65}
[2024-06-03 21:56:45,158 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places.
[2024-06-03 21:56:45,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 372 flow
[2024-06-03 21:56:45,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:45,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:45,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:45,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 21:56:45,159 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:45,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:45,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -781017066, now seen corresponding path program 2 times
[2024-06-03 21:56:45,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:45,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269282147]
[2024-06-03 21:56:45,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:45,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:45,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:54,037 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-03 21:56:54,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:54,037 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269282147]
[2024-06-03 21:56:54,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269282147] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:54,038 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:54,038 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:56:54,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565726839]
[2024-06-03 21:56:54,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:54,038 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:56:54,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:54,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:56:54,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:56:54,191 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:56:54,191 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 372 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:54,191 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:54,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:56:54,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:55,500 INFO  L124   PetriNetUnfolderBase]: 1951/3021 cut-off events.
[2024-06-03 21:56:55,501 INFO  L125   PetriNetUnfolderBase]: For 18019/18029 co-relation queries the response was YES.
[2024-06-03 21:56:55,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12585 conditions, 3021 events. 1951/3021 cut-off events. For 18019/18029 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15046 event pairs, 594 based on Foata normal form. 18/3021 useless extension candidates. Maximal degree in co-relation 12558. Up to 2705 conditions per place. 
[2024-06-03 21:56:55,512 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 76 selfloop transitions, 25 changer transitions 0/107 dead transitions.
[2024-06-03 21:56:55,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 784 flow
[2024-06-03 21:56:55,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:56:55,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:56:55,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-03 21:56:55,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-03 21:56:55,514 INFO  L175             Difference]: Start difference. First operand has 67 places, 65 transitions, 372 flow. Second operand 8 states and 154 transitions.
[2024-06-03 21:56:55,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 784 flow
[2024-06-03 21:56:55,518 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 732 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-03 21:56:55,520 INFO  L231             Difference]: Finished difference. Result has 71 places, 73 transitions, 480 flow
[2024-06-03 21:56:55,520 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=480, PETRI_PLACES=71, PETRI_TRANSITIONS=73}
[2024-06-03 21:56:55,521 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 27 predicate places.
[2024-06-03 21:56:55,521 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 480 flow
[2024-06-03 21:56:55,521 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:55,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:55,521 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:55,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 21:56:55,521 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-03 21:56:55,522 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:55,522 INFO  L85        PathProgramCache]: Analyzing trace with hash -774587976, now seen corresponding path program 3 times
[2024-06-03 21:56:55,522 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:55,522 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99132830]
[2024-06-03 21:56:55,522 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:55,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:55,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:04,759 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-03 21:57:04,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:04,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99132830]
[2024-06-03 21:57:04,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99132830] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:04,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:04,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:57:04,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950719507]
[2024-06-03 21:57:04,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:04,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:57:04,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:04,760 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:57:04,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:57:04,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:57:04,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 480 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:04,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:04,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:57:04,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:06,233 INFO  L124   PetriNetUnfolderBase]: 1959/3019 cut-off events.
[2024-06-03 21:57:06,234 INFO  L125   PetriNetUnfolderBase]: For 23226/23254 co-relation queries the response was YES.
[2024-06-03 21:57:06,238 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13663 conditions, 3019 events. 1959/3019 cut-off events. For 23226/23254 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15059 event pairs, 555 based on Foata normal form. 23/3022 useless extension candidates. Maximal degree in co-relation 13634. Up to 2576 conditions per place. 
[2024-06-03 21:57:06,247 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 71 selfloop transitions, 38 changer transitions 0/115 dead transitions.
[2024-06-03 21:57:06,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 115 transitions, 970 flow
[2024-06-03 21:57:06,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:57:06,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:57:06,248 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-03 21:57:06,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45930232558139533
[2024-06-03 21:57:06,248 INFO  L175             Difference]: Start difference. First operand has 71 places, 73 transitions, 480 flow. Second operand 8 states and 158 transitions.
[2024-06-03 21:57:06,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 115 transitions, 970 flow
[2024-06-03 21:57:06,255 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 115 transitions, 922 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 21:57:06,257 INFO  L231             Difference]: Finished difference. Result has 76 places, 81 transitions, 632 flow
[2024-06-03 21:57:06,257 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=76, PETRI_TRANSITIONS=81}
[2024-06-03 21:57:06,258 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places.
[2024-06-03 21:57:06,258 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 632 flow
[2024-06-03 21:57:06,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:06,258 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:06,258 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:06,258 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 21:57:06,258 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-03 21:57:06,259 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:06,259 INFO  L85        PathProgramCache]: Analyzing trace with hash -774341712, now seen corresponding path program 1 times
[2024-06-03 21:57:06,259 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:06,259 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015797754]
[2024-06-03 21:57:06,259 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:06,259 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:06,305 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:16,671 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-03 21:57:16,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:16,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015797754]
[2024-06-03 21:57:16,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015797754] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:16,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:16,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:57:16,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710254059]
[2024-06-03 21:57:16,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:16,673 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:57:16,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:16,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:57:16,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:57:16,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:57:16,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 632 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:16,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:16,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:57:16,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:18,053 INFO  L124   PetriNetUnfolderBase]: 1825/2906 cut-off events.
[2024-06-03 21:57:18,053 INFO  L125   PetriNetUnfolderBase]: For 23468/23468 co-relation queries the response was YES.
[2024-06-03 21:57:18,057 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13420 conditions, 2906 events. 1825/2906 cut-off events. For 23468/23468 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14635 event pairs, 569 based on Foata normal form. 4/2894 useless extension candidates. Maximal degree in co-relation 13388. Up to 2662 conditions per place. 
[2024-06-03 21:57:18,064 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 86 selfloop transitions, 16 changer transitions 0/107 dead transitions.
[2024-06-03 21:57:18,064 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 107 transitions, 928 flow
[2024-06-03 21:57:18,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:57:18,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:57:18,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-03 21:57:18,065 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4069767441860465
[2024-06-03 21:57:18,065 INFO  L175             Difference]: Start difference. First operand has 76 places, 81 transitions, 632 flow. Second operand 8 states and 140 transitions.
[2024-06-03 21:57:18,065 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 107 transitions, 928 flow
[2024-06-03 21:57:18,078 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 822 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-03 21:57:18,079 INFO  L231             Difference]: Finished difference. Result has 79 places, 83 transitions, 601 flow
[2024-06-03 21:57:18,079 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=601, PETRI_PLACES=79, PETRI_TRANSITIONS=83}
[2024-06-03 21:57:18,079 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 35 predicate places.
[2024-06-03 21:57:18,080 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 83 transitions, 601 flow
[2024-06-03 21:57:18,080 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:18,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:18,080 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:18,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 21:57:18,080 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-03 21:57:18,081 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:18,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187539917, now seen corresponding path program 1 times
[2024-06-03 21:57:18,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:18,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689081789]
[2024-06-03 21:57:18,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:18,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:18,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:31,127 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-03 21:57:31,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:31,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689081789]
[2024-06-03 21:57:31,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689081789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:31,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:31,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:57:31,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034095282]
[2024-06-03 21:57:31,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:31,128 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:57:31,128 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:31,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:57:31,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:57:31,235 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:57:31,236 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 83 transitions, 601 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:31,236 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:31,236 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:57:31,236 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:32,329 INFO  L124   PetriNetUnfolderBase]: 1822/2902 cut-off events.
[2024-06-03 21:57:32,329 INFO  L125   PetriNetUnfolderBase]: For 23914/23914 co-relation queries the response was YES.
[2024-06-03 21:57:32,333 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13092 conditions, 2902 events. 1822/2902 cut-off events. For 23914/23914 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 14543 event pairs, 583 based on Foata normal form. 1/2887 useless extension candidates. Maximal degree in co-relation 13059. Up to 2700 conditions per place. 
[2024-06-03 21:57:32,340 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 81 selfloop transitions, 8 changer transitions 0/94 dead transitions.
[2024-06-03 21:57:32,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 94 transitions, 821 flow
[2024-06-03 21:57:32,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:57:32,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:57:32,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions.
[2024-06-03 21:57:32,341 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40930232558139534
[2024-06-03 21:57:32,341 INFO  L175             Difference]: Start difference. First operand has 79 places, 83 transitions, 601 flow. Second operand 5 states and 88 transitions.
[2024-06-03 21:57:32,341 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 94 transitions, 821 flow
[2024-06-03 21:57:32,351 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 766 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-03 21:57:32,352 INFO  L231             Difference]: Finished difference. Result has 78 places, 86 transitions, 596 flow
[2024-06-03 21:57:32,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=596, PETRI_PLACES=78, PETRI_TRANSITIONS=86}
[2024-06-03 21:57:32,353 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places.
[2024-06-03 21:57:32,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 596 flow
[2024-06-03 21:57:32,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:32,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:32,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:32,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 21:57:32,353 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-03 21:57:32,353 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:32,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 585675707, now seen corresponding path program 1 times
[2024-06-03 21:57:32,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:32,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078317011]
[2024-06-03 21:57:32,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:32,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:32,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:41,977 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-03 21:57:41,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:41,978 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078317011]
[2024-06-03 21:57:41,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078317011] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:41,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:41,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:57:41,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295170160]
[2024-06-03 21:57:41,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:41,978 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:57:41,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:41,979 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:57:41,979 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:57:42,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:57:42,179 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 596 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:42,179 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:42,179 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:57:42,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:43,514 INFO  L124   PetriNetUnfolderBase]: 1920/2970 cut-off events.
[2024-06-03 21:57:43,514 INFO  L125   PetriNetUnfolderBase]: For 31528/31548 co-relation queries the response was YES.
[2024-06-03 21:57:43,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14649 conditions, 2970 events. 1920/2970 cut-off events. For 31528/31548 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14809 event pairs, 605 based on Foata normal form. 7/2976 useless extension candidates. Maximal degree in co-relation 14615. Up to 2767 conditions per place. 
[2024-06-03 21:57:43,527 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 90 selfloop transitions, 19 changer transitions 0/115 dead transitions.
[2024-06-03 21:57:43,527 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 928 flow
[2024-06-03 21:57:43,527 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:57:43,527 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:57:43,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-03 21:57:43,528 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43853820598006643
[2024-06-03 21:57:43,528 INFO  L175             Difference]: Start difference. First operand has 78 places, 86 transitions, 596 flow. Second operand 7 states and 132 transitions.
[2024-06-03 21:57:43,528 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 928 flow
[2024-06-03 21:57:43,536 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 115 transitions, 900 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-03 21:57:43,538 INFO  L231             Difference]: Finished difference. Result has 82 places, 89 transitions, 670 flow
[2024-06-03 21:57:43,538 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=670, PETRI_PLACES=82, PETRI_TRANSITIONS=89}
[2024-06-03 21:57:43,538 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places.
[2024-06-03 21:57:43,539 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 670 flow
[2024-06-03 21:57:43,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:57:43,539 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:43,539 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:43,539 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 21:57:43,539 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-03 21:57:43,540 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:43,540 INFO  L85        PathProgramCache]: Analyzing trace with hash 561473411, now seen corresponding path program 1 times
[2024-06-03 21:57:43,540 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:43,540 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570245987]
[2024-06-03 21:57:43,540 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:43,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:43,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:54,318 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-03 21:57:54,318 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:54,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570245987]
[2024-06-03 21:57:54,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570245987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:54,318 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:54,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:57:54,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096814836]
[2024-06-03 21:57:54,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:54,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:57:54,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:54,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:57:54,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:57:54,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:57:54,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 670 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:57:54,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:54,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:57:54,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:55,718 INFO  L124   PetriNetUnfolderBase]: 2053/3135 cut-off events.
[2024-06-03 21:57:55,718 INFO  L125   PetriNetUnfolderBase]: For 34576/34576 co-relation queries the response was YES.
[2024-06-03 21:57:55,724 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15340 conditions, 3135 events. 2053/3135 cut-off events. For 34576/34576 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14950 event pairs, 645 based on Foata normal form. 2/3136 useless extension candidates. Maximal degree in co-relation 15305. Up to 2990 conditions per place. 
[2024-06-03 21:57:55,733 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 99 selfloop transitions, 17 changer transitions 0/120 dead transitions.
[2024-06-03 21:57:55,733 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 120 transitions, 1019 flow
[2024-06-03 21:57:55,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:57:55,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:57:55,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-03 21:57:55,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3953488372093023
[2024-06-03 21:57:55,734 INFO  L175             Difference]: Start difference. First operand has 82 places, 89 transitions, 670 flow. Second operand 8 states and 136 transitions.
[2024-06-03 21:57:55,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 120 transitions, 1019 flow
[2024-06-03 21:57:55,749 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 120 transitions, 961 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-03 21:57:55,751 INFO  L231             Difference]: Finished difference. Result has 86 places, 94 transitions, 715 flow
[2024-06-03 21:57:55,751 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=715, PETRI_PLACES=86, PETRI_TRANSITIONS=94}
[2024-06-03 21:57:55,752 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places.
[2024-06-03 21:57:55,752 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 94 transitions, 715 flow
[2024-06-03 21:57:55,752 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:57:55,752 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:55,752 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:55,752 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 21:57:55,752 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-03 21:57:55,753 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:55,753 INFO  L85        PathProgramCache]: Analyzing trace with hash 1448673115, now seen corresponding path program 2 times
[2024-06-03 21:57:55,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:55,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143632067]
[2024-06-03 21:57:55,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:55,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:55,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:06,757 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-03 21:58:06,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:06,757 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143632067]
[2024-06-03 21:58:06,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143632067] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:06,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:06,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:58:06,760 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116622093]
[2024-06-03 21:58:06,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:06,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:58:06,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:06,760 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:58:06,760 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:58:06,944 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:58:06,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 94 transitions, 715 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:58:06,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:06,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:58:06,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:08,194 INFO  L124   PetriNetUnfolderBase]: 2075/3169 cut-off events.
[2024-06-03 21:58:08,194 INFO  L125   PetriNetUnfolderBase]: For 38673/38681 co-relation queries the response was YES.
[2024-06-03 21:58:08,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15873 conditions, 3169 events. 2075/3169 cut-off events. For 38673/38681 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15121 event pairs, 647 based on Foata normal form. 8/3175 useless extension candidates. Maximal degree in co-relation 15836. Up to 2977 conditions per place. 
[2024-06-03 21:58:08,209 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 93 selfloop transitions, 27 changer transitions 0/124 dead transitions.
[2024-06-03 21:58:08,209 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 124 transitions, 1080 flow
[2024-06-03 21:58:08,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:58:08,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:58:08,210 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions.
[2024-06-03 21:58:08,211 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39825581395348836
[2024-06-03 21:58:08,211 INFO  L175             Difference]: Start difference. First operand has 86 places, 94 transitions, 715 flow. Second operand 8 states and 137 transitions.
[2024-06-03 21:58:08,211 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 124 transitions, 1080 flow
[2024-06-03 21:58:08,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 124 transitions, 1022 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 21:58:08,225 INFO  L231             Difference]: Finished difference. Result has 90 places, 101 transitions, 800 flow
[2024-06-03 21:58:08,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=800, PETRI_PLACES=90, PETRI_TRANSITIONS=101}
[2024-06-03 21:58:08,226 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places.
[2024-06-03 21:58:08,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 101 transitions, 800 flow
[2024-06-03 21:58:08,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:58:08,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:08,226 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:08,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 21:58:08,227 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:08,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:08,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1448874925, now seen corresponding path program 3 times
[2024-06-03 21:58:08,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:08,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193059295]
[2024-06-03 21:58:08,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:08,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:08,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:19,224 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-03 21:58:19,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:19,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193059295]
[2024-06-03 21:58:19,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193059295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:19,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:19,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:58:19,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438807297]
[2024-06-03 21:58:19,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:19,225 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:58:19,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:19,226 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:58:19,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:58:19,332 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:58:19,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 101 transitions, 800 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:58:19,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:19,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:58:19,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:20,573 INFO  L124   PetriNetUnfolderBase]: 2086/3185 cut-off events.
[2024-06-03 21:58:20,574 INFO  L125   PetriNetUnfolderBase]: For 43213/43221 co-relation queries the response was YES.
[2024-06-03 21:58:20,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16477 conditions, 3185 events. 2086/3185 cut-off events. For 43213/43221 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15185 event pairs, 642 based on Foata normal form. 8/3191 useless extension candidates. Maximal degree in co-relation 16438. Up to 2993 conditions per place. 
[2024-06-03 21:58:20,587 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 95 selfloop transitions, 30 changer transitions 0/129 dead transitions.
[2024-06-03 21:58:20,587 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 129 transitions, 1177 flow
[2024-06-03 21:58:20,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:58:20,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:58:20,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-03 21:58:20,589 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3953488372093023
[2024-06-03 21:58:20,589 INFO  L175             Difference]: Start difference. First operand has 90 places, 101 transitions, 800 flow. Second operand 8 states and 136 transitions.
[2024-06-03 21:58:20,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 129 transitions, 1177 flow
[2024-06-03 21:58:20,604 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 129 transitions, 1095 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 21:58:20,605 INFO  L231             Difference]: Finished difference. Result has 93 places, 106 transitions, 861 flow
[2024-06-03 21:58:20,606 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=861, PETRI_PLACES=93, PETRI_TRANSITIONS=106}
[2024-06-03 21:58:20,606 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places.
[2024-06-03 21:58:20,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 106 transitions, 861 flow
[2024-06-03 21:58:20,606 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:58:20,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:20,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:20,607 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 21:58:20,607 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:20,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:20,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 1765201795, now seen corresponding path program 4 times
[2024-06-03 21:58:20,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:20,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881372365]
[2024-06-03 21:58:20,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:20,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:20,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:31,784 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-03 21:58:31,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:31,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881372365]
[2024-06-03 21:58:31,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881372365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:31,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:31,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:58:31,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59843414]
[2024-06-03 21:58:31,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:31,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:58:31,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:31,785 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:58:31,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:58:31,881 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:58:31,882 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 106 transitions, 861 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:58:31,882 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:31,882 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:58:31,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:33,186 INFO  L124   PetriNetUnfolderBase]: 2075/3168 cut-off events.
[2024-06-03 21:58:33,187 INFO  L125   PetriNetUnfolderBase]: For 46957/46965 co-relation queries the response was YES.
[2024-06-03 21:58:33,193 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16629 conditions, 3168 events. 2075/3168 cut-off events. For 46957/46965 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15124 event pairs, 642 based on Foata normal form. 8/3174 useless extension candidates. Maximal degree in co-relation 16589. Up to 2940 conditions per place. 
[2024-06-03 21:58:33,201 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 89 selfloop transitions, 42 changer transitions 0/135 dead transitions.
[2024-06-03 21:58:33,201 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 135 transitions, 1229 flow
[2024-06-03 21:58:33,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:58:33,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:58:33,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions.
[2024-06-03 21:58:33,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39276485788113696
[2024-06-03 21:58:33,202 INFO  L175             Difference]: Start difference. First operand has 93 places, 106 transitions, 861 flow. Second operand 9 states and 152 transitions.
[2024-06-03 21:58:33,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 135 transitions, 1229 flow
[2024-06-03 21:58:33,220 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 135 transitions, 1155 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 21:58:33,221 INFO  L231             Difference]: Finished difference. Result has 98 places, 108 transitions, 925 flow
[2024-06-03 21:58:33,221 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=925, PETRI_PLACES=98, PETRI_TRANSITIONS=108}
[2024-06-03 21:58:33,222 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places.
[2024-06-03 21:58:33,222 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 925 flow
[2024-06-03 21:58:33,222 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-03 21:58:33,222 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:33,222 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:33,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 21:58:33,223 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-03 21:58:33,223 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:33,223 INFO  L85        PathProgramCache]: Analyzing trace with hash 1840969671, now seen corresponding path program 1 times
[2024-06-03 21:58:33,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:33,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528871883]
[2024-06-03 21:58:33,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:33,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:33,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:48,276 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-03 21:58:48,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:48,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528871883]
[2024-06-03 21:58:48,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528871883] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:48,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:48,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:58:48,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870324344]
[2024-06-03 21:58:48,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:48,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:58:48,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:48,277 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:58:48,277 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:58:48,409 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:58:48,410 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 925 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:48,410 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:48,410 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:58:48,410 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:49,625 INFO  L124   PetriNetUnfolderBase]: 2072/3179 cut-off events.
[2024-06-03 21:58:49,626 INFO  L125   PetriNetUnfolderBase]: For 51033/51033 co-relation queries the response was YES.
[2024-06-03 21:58:49,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16926 conditions, 3179 events. 2072/3179 cut-off events. For 51033/51033 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15243 event pairs, 629 based on Foata normal form. 1/3179 useless extension candidates. Maximal degree in co-relation 16885. Up to 3053 conditions per place. 
[2024-06-03 21:58:49,641 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 105 selfloop transitions, 11 changer transitions 0/120 dead transitions.
[2024-06-03 21:58:49,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 120 transitions, 1205 flow
[2024-06-03 21:58:49,642 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:58:49,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:58:49,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-03 21:58:49,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37209302325581395
[2024-06-03 21:58:49,643 INFO  L175             Difference]: Start difference. First operand has 98 places, 108 transitions, 925 flow. Second operand 6 states and 96 transitions.
[2024-06-03 21:58:49,643 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 120 transitions, 1205 flow
[2024-06-03 21:58:49,662 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 120 transitions, 1089 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-03 21:58:49,663 INFO  L231             Difference]: Finished difference. Result has 97 places, 111 transitions, 869 flow
[2024-06-03 21:58:49,664 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=97, PETRI_TRANSITIONS=111}
[2024-06-03 21:58:49,664 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places.
[2024-06-03 21:58:49,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 869 flow
[2024-06-03 21:58:49,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:49,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:49,665 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:49,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 21:58:49,665 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:49,665 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:49,665 INFO  L85        PathProgramCache]: Analyzing trace with hash 107474709, now seen corresponding path program 1 times
[2024-06-03 21:58:49,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:49,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135921444]
[2024-06-03 21:58:49,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:49,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:49,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:59,392 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-03 21:58:59,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:59,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135921444]
[2024-06-03 21:58:59,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135921444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:59,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:59,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:59,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416842955]
[2024-06-03 21:58:59,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:59,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:59,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:59,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:59,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:59,741 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:58:59,741 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 111 transitions, 869 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:58:59,741 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:59,741 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:58:59,741 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:01,304 INFO  L124   PetriNetUnfolderBase]: 2064/3166 cut-off events.
[2024-06-03 21:59:01,304 INFO  L125   PetriNetUnfolderBase]: For 60987/60993 co-relation queries the response was YES.
[2024-06-03 21:59:01,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18074 conditions, 3166 events. 2064/3166 cut-off events. For 60987/60993 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 15910 event pairs, 486 based on Foata normal form. 4/3149 useless extension candidates. Maximal degree in co-relation 18032. Up to 2921 conditions per place. 
[2024-06-03 21:59:01,319 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 118 selfloop transitions, 17 changer transitions 0/144 dead transitions.
[2024-06-03 21:59:01,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 144 transitions, 1257 flow
[2024-06-03 21:59:01,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:59:01,322 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:59:01,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-03 21:59:01,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4273255813953488
[2024-06-03 21:59:01,322 INFO  L175             Difference]: Start difference. First operand has 97 places, 111 transitions, 869 flow. Second operand 8 states and 147 transitions.
[2024-06-03 21:59:01,322 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 144 transitions, 1257 flow
[2024-06-03 21:59:01,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 144 transitions, 1219 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-03 21:59:01,345 INFO  L231             Difference]: Finished difference. Result has 101 places, 113 transitions, 916 flow
[2024-06-03 21:59:01,345 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=916, PETRI_PLACES=101, PETRI_TRANSITIONS=113}
[2024-06-03 21:59:01,346 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places.
[2024-06-03 21:59:01,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 916 flow
[2024-06-03 21:59:01,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:01,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:01,346 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:01,346 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 21:59:01,346 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:01,346 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:01,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 107535159, now seen corresponding path program 2 times
[2024-06-03 21:59:01,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:01,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131361846]
[2024-06-03 21:59:01,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:01,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:01,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:11,362 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-03 21:59:11,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:11,363 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131361846]
[2024-06-03 21:59:11,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131361846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:11,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:11,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:11,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023951256]
[2024-06-03 21:59:11,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:11,364 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:11,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:11,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:11,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:11,657 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:59:11,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 916 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:11,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:11,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:59:11,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:13,124 INFO  L124   PetriNetUnfolderBase]: 2081/3189 cut-off events.
[2024-06-03 21:59:13,124 INFO  L125   PetriNetUnfolderBase]: For 67900/67906 co-relation queries the response was YES.
[2024-06-03 21:59:13,131 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18850 conditions, 3189 events. 2081/3189 cut-off events. For 67900/67906 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16022 event pairs, 604 based on Foata normal form. 4/3175 useless extension candidates. Maximal degree in co-relation 18807. Up to 2951 conditions per place. 
[2024-06-03 21:59:13,141 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 116 selfloop transitions, 21 changer transitions 0/146 dead transitions.
[2024-06-03 21:59:13,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 146 transitions, 1314 flow
[2024-06-03 21:59:13,143 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:59:13,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:59:13,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-03 21:59:13,143 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-03 21:59:13,143 INFO  L175             Difference]: Start difference. First operand has 101 places, 113 transitions, 916 flow. Second operand 8 states and 148 transitions.
[2024-06-03 21:59:13,143 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 146 transitions, 1314 flow
[2024-06-03 21:59:13,164 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 146 transitions, 1247 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-03 21:59:13,165 INFO  L231             Difference]: Finished difference. Result has 103 places, 115 transitions, 947 flow
[2024-06-03 21:59:13,165 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=947, PETRI_PLACES=103, PETRI_TRANSITIONS=115}
[2024-06-03 21:59:13,166 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places.
[2024-06-03 21:59:13,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 115 transitions, 947 flow
[2024-06-03 21:59:13,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:13,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:13,166 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:13,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 21:59:13,166 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-03 21:59:13,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:13,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 110336629, now seen corresponding path program 1 times
[2024-06-03 21:59:13,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:13,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183536358]
[2024-06-03 21:59:13,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:13,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:13,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:23,336 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-03 21:59:23,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:23,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183536358]
[2024-06-03 21:59:23,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183536358] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:23,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:23,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:59:23,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513988075]
[2024-06-03 21:59:23,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:23,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:59:23,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:23,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:59:23,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:59:23,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:59:23,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 115 transitions, 947 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:23,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:23,543 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:59:23,543 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:25,002 INFO  L124   PetriNetUnfolderBase]: 2202/3346 cut-off events.
[2024-06-03 21:59:25,002 INFO  L125   PetriNetUnfolderBase]: For 73500/73500 co-relation queries the response was YES.
[2024-06-03 21:59:25,010 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19388 conditions, 3346 events. 2202/3346 cut-off events. For 73500/73500 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 16174 event pairs, 570 based on Foata normal form. 4/3349 useless extension candidates. Maximal degree in co-relation 19344. Up to 3011 conditions per place. 
[2024-06-03 21:59:25,019 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 116 selfloop transitions, 39 changer transitions 0/160 dead transitions.
[2024-06-03 21:59:25,019 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 160 transitions, 1427 flow
[2024-06-03 21:59:25,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:59:25,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:59:25,021 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-03 21:59:25,022 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4160206718346253
[2024-06-03 21:59:25,022 INFO  L175             Difference]: Start difference. First operand has 103 places, 115 transitions, 947 flow. Second operand 9 states and 161 transitions.
[2024-06-03 21:59:25,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 160 transitions, 1427 flow
[2024-06-03 21:59:25,052 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 160 transitions, 1325 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-03 21:59:25,053 INFO  L231             Difference]: Finished difference. Result has 107 places, 124 transitions, 1029 flow
[2024-06-03 21:59:25,053 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1029, PETRI_PLACES=107, PETRI_TRANSITIONS=124}
[2024-06-03 21:59:25,054 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 63 predicate places.
[2024-06-03 21:59:25,054 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 124 transitions, 1029 flow
[2024-06-03 21:59:25,054 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:25,054 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:25,054 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:25,054 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 21:59:25,055 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:25,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:25,055 INFO  L85        PathProgramCache]: Analyzing trace with hash 1793370753, now seen corresponding path program 3 times
[2024-06-03 21:59:25,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:25,055 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574531078]
[2024-06-03 21:59:25,055 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:25,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:25,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:35,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:59:35,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:35,401 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574531078]
[2024-06-03 21:59:35,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574531078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:35,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:35,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:35,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532877132]
[2024-06-03 21:59:35,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:35,405 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:35,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:35,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:35,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:35,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 21:59:35,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 124 transitions, 1029 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:35,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:35,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 21:59:35,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:37,190 INFO  L124   PetriNetUnfolderBase]: 2092/3251 cut-off events.
[2024-06-03 21:59:37,190 INFO  L125   PetriNetUnfolderBase]: For 81282/81287 co-relation queries the response was YES.
[2024-06-03 21:59:37,197 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19528 conditions, 3251 events. 2092/3251 cut-off events. For 81282/81287 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16380 event pairs, 529 based on Foata normal form. 8/3251 useless extension candidates. Maximal degree in co-relation 19482. Up to 2915 conditions per place. 
[2024-06-03 21:59:37,207 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 117 selfloop transitions, 35 changer transitions 0/162 dead transitions.
[2024-06-03 21:59:37,207 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 162 transitions, 1475 flow
[2024-06-03 21:59:37,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:59:37,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:59:37,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-03 21:59:37,211 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4289405684754522
[2024-06-03 21:59:37,211 INFO  L175             Difference]: Start difference. First operand has 107 places, 124 transitions, 1029 flow. Second operand 9 states and 166 transitions.
[2024-06-03 21:59:37,211 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 162 transitions, 1475 flow
[2024-06-03 21:59:37,235 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 162 transitions, 1417 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-03 21:59:37,237 INFO  L231             Difference]: Finished difference. Result has 111 places, 126 transitions, 1101 flow
[2024-06-03 21:59:37,237 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=111, PETRI_TRANSITIONS=126}
[2024-06-03 21:59:37,237 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places.
[2024-06-03 21:59:37,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 126 transitions, 1101 flow
[2024-06-03 21:59:37,238 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:37,238 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:37,238 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:37,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 21:59:37,238 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:37,238 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:37,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 1928323979, now seen corresponding path program 1 times
[2024-06-03 21:59:37,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:37,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587111059]
[2024-06-03 21:59:37,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:37,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:37,283 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:47,407 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-03 21:59:47,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:47,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587111059]
[2024-06-03 21:59:47,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587111059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:47,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:47,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:47,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829471479]
[2024-06-03 21:59:47,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:47,408 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:47,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:47,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:47,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:47,698 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 21:59:47,698 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 126 transitions, 1101 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:47,698 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:47,698 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 21:59:47,698 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:49,339 INFO  L124   PetriNetUnfolderBase]: 2328/3552 cut-off events.
[2024-06-03 21:59:49,339 INFO  L125   PetriNetUnfolderBase]: For 88377/88377 co-relation queries the response was YES.
[2024-06-03 21:59:49,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21009 conditions, 3552 events. 2328/3552 cut-off events. For 88377/88377 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17456 event pairs, 587 based on Foata normal form. 24/3575 useless extension candidates. Maximal degree in co-relation 20961. Up to 3079 conditions per place. 
[2024-06-03 21:59:49,355 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 127 selfloop transitions, 41 changer transitions 0/173 dead transitions.
[2024-06-03 21:59:49,355 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 173 transitions, 1607 flow
[2024-06-03 21:59:49,357 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:59:49,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:59:49,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-03 21:59:49,358 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186046511627907
[2024-06-03 21:59:49,358 INFO  L175             Difference]: Start difference. First operand has 111 places, 126 transitions, 1101 flow. Second operand 10 states and 180 transitions.
[2024-06-03 21:59:49,358 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 173 transitions, 1607 flow
[2024-06-03 21:59:49,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 173 transitions, 1504 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-03 21:59:49,397 INFO  L231             Difference]: Finished difference. Result has 115 places, 128 transitions, 1135 flow
[2024-06-03 21:59:49,397 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1135, PETRI_PLACES=115, PETRI_TRANSITIONS=128}
[2024-06-03 21:59:49,397 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 71 predicate places.
[2024-06-03 21:59:49,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 128 transitions, 1135 flow
[2024-06-03 21:59:49,397 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:49,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:49,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:49,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 21:59:49,398 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:49,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:49,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 1224044690, now seen corresponding path program 1 times
[2024-06-03 21:59:49,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:49,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002262847]
[2024-06-03 21:59:49,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:49,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:49,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:04,646 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-03 22:00:04,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:04,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002262847]
[2024-06-03 22:00:04,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002262847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:04,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:04,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:00:04,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590735229]
[2024-06-03 22:00:04,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:04,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:00:04,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:04,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:00:04,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:00:04,758 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:00:04,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 128 transitions, 1135 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:04,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:04,759 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:00:04,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:06,227 INFO  L124   PetriNetUnfolderBase]: 2374/3600 cut-off events.
[2024-06-03 22:00:06,227 INFO  L125   PetriNetUnfolderBase]: For 88238/88238 co-relation queries the response was YES.
[2024-06-03 22:00:06,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21661 conditions, 3600 events. 2374/3600 cut-off events. For 88238/88238 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17539 event pairs, 607 based on Foata normal form. 1/3600 useless extension candidates. Maximal degree in co-relation 21612. Up to 3455 conditions per place. 
[2024-06-03 22:00:06,253 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 129 selfloop transitions, 16 changer transitions 0/150 dead transitions.
[2024-06-03 22:00:06,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 150 transitions, 1573 flow
[2024-06-03 22:00:06,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:00:06,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:00:06,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-03 22:00:06,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4069767441860465
[2024-06-03 22:00:06,255 INFO  L175             Difference]: Start difference. First operand has 115 places, 128 transitions, 1135 flow. Second operand 6 states and 105 transitions.
[2024-06-03 22:00:06,255 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 150 transitions, 1573 flow
[2024-06-03 22:00:06,300 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 150 transitions, 1466 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-03 22:00:06,302 INFO  L231             Difference]: Finished difference. Result has 113 places, 134 transitions, 1136 flow
[2024-06-03 22:00:06,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1136, PETRI_PLACES=113, PETRI_TRANSITIONS=134}
[2024-06-03 22:00:06,303 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places.
[2024-06-03 22:00:06,303 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 134 transitions, 1136 flow
[2024-06-03 22:00:06,303 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:06,303 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:06,303 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:06,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:00:06,304 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-03 22:00:06,304 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:06,304 INFO  L85        PathProgramCache]: Analyzing trace with hash -247071393, now seen corresponding path program 2 times
[2024-06-03 22:00:06,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:06,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835439379]
[2024-06-03 22:00:06,304 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:06,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:06,347 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:18,377 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-03 22:00:18,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:18,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835439379]
[2024-06-03 22:00:18,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835439379] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:18,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:18,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:00:18,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523540008]
[2024-06-03 22:00:18,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:18,378 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:00:18,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:18,378 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:00:18,379 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:00:18,620 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:00:18,620 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 134 transitions, 1136 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:18,620 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:18,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:00:18,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:20,467 INFO  L124   PetriNetUnfolderBase]: 2502/3810 cut-off events.
[2024-06-03 22:00:20,468 INFO  L125   PetriNetUnfolderBase]: For 102220/102231 co-relation queries the response was YES.
[2024-06-03 22:00:20,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23364 conditions, 3810 events. 2502/3810 cut-off events. For 102220/102231 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18807 event pairs, 534 based on Foata normal form. 12/3820 useless extension candidates. Maximal degree in co-relation 23314. Up to 2927 conditions per place. 
[2024-06-03 22:00:20,487 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 109 selfloop transitions, 76 changer transitions 0/190 dead transitions.
[2024-06-03 22:00:20,487 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 190 transitions, 1932 flow
[2024-06-03 22:00:20,490 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:00:20,490 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:00:20,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-03 22:00:20,490 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325581395348837
[2024-06-03 22:00:20,490 INFO  L175             Difference]: Start difference. First operand has 113 places, 134 transitions, 1136 flow. Second operand 10 states and 186 transitions.
[2024-06-03 22:00:20,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 190 transitions, 1932 flow
[2024-06-03 22:00:20,534 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 190 transitions, 1894 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-03 22:00:20,536 INFO  L231             Difference]: Finished difference. Result has 122 places, 143 transitions, 1411 flow
[2024-06-03 22:00:20,537 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1411, PETRI_PLACES=122, PETRI_TRANSITIONS=143}
[2024-06-03 22:00:20,537 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 78 predicate places.
[2024-06-03 22:00:20,537 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 143 transitions, 1411 flow
[2024-06-03 22:00:20,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:20,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:20,537 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:20,538 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:00:20,538 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:20,538 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:20,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -1113318223, now seen corresponding path program 3 times
[2024-06-03 22:00:20,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:20,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253403371]
[2024-06-03 22:00:20,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:20,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:20,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:32,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:00:32,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:32,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253403371]
[2024-06-03 22:00:32,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253403371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:32,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:32,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:00:32,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649936615]
[2024-06-03 22:00:32,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:32,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:00:32,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:32,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:00:32,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:00:32,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:00:32,306 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 143 transitions, 1411 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:32,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:32,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:00:32,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:34,242 INFO  L124   PetriNetUnfolderBase]: 2519/3837 cut-off events.
[2024-06-03 22:00:34,243 INFO  L125   PetriNetUnfolderBase]: For 113318/113329 co-relation queries the response was YES.
[2024-06-03 22:00:34,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24711 conditions, 3837 events. 2519/3837 cut-off events. For 113318/113329 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 19045 event pairs, 622 based on Foata normal form. 12/3847 useless extension candidates. Maximal degree in co-relation 24658. Up to 3321 conditions per place. 
[2024-06-03 22:00:34,263 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 109 selfloop transitions, 71 changer transitions 0/185 dead transitions.
[2024-06-03 22:00:34,264 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 185 transitions, 2017 flow
[2024-06-03 22:00:34,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:00:34,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:00:34,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-03 22:00:34,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41627906976744183
[2024-06-03 22:00:34,267 INFO  L175             Difference]: Start difference. First operand has 122 places, 143 transitions, 1411 flow. Second operand 10 states and 179 transitions.
[2024-06-03 22:00:34,267 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 185 transitions, 2017 flow
[2024-06-03 22:00:34,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 185 transitions, 1895 flow, removed 32 selfloop flow, removed 5 redundant places.
[2024-06-03 22:00:34,337 INFO  L231             Difference]: Finished difference. Result has 127 places, 145 transitions, 1494 flow
[2024-06-03 22:00:34,337 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=127, PETRI_TRANSITIONS=145}
[2024-06-03 22:00:34,337 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 83 predicate places.
[2024-06-03 22:00:34,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 145 transitions, 1494 flow
[2024-06-03 22:00:34,337 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:34,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:34,338 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:34,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:00:34,338 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:34,338 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:34,338 INFO  L85        PathProgramCache]: Analyzing trace with hash -1121599191, now seen corresponding path program 2 times
[2024-06-03 22:00:34,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:34,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137665280]
[2024-06-03 22:00:34,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:34,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:34,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:44,703 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-03 22:00:44,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:44,703 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137665280]
[2024-06-03 22:00:44,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137665280] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:44,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:44,703 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:00:44,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166438012]
[2024-06-03 22:00:44,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:44,704 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:00:44,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:44,705 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:00:44,705 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:00:44,926 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:00:44,927 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 145 transitions, 1494 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:44,927 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:44,927 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:00:44,927 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:46,653 INFO  L124   PetriNetUnfolderBase]: 2563/3901 cut-off events.
[2024-06-03 22:00:46,653 INFO  L125   PetriNetUnfolderBase]: For 118710/118721 co-relation queries the response was YES.
[2024-06-03 22:00:46,664 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24886 conditions, 3901 events. 2563/3901 cut-off events. For 118710/118721 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 19385 event pairs, 635 based on Foata normal form. 12/3911 useless extension candidates. Maximal degree in co-relation 24833. Up to 3470 conditions per place. 
[2024-06-03 22:00:46,676 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 122 selfloop transitions, 58 changer transitions 0/185 dead transitions.
[2024-06-03 22:00:46,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 185 transitions, 2029 flow
[2024-06-03 22:00:46,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:00:46,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:00:46,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-03 22:00:46,678 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42118863049095606
[2024-06-03 22:00:46,679 INFO  L175             Difference]: Start difference. First operand has 127 places, 145 transitions, 1494 flow. Second operand 9 states and 163 transitions.
[2024-06-03 22:00:46,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 185 transitions, 2029 flow
[2024-06-03 22:00:46,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 185 transitions, 1824 flow, removed 22 selfloop flow, removed 9 redundant places.
[2024-06-03 22:00:46,735 INFO  L231             Difference]: Finished difference. Result has 127 places, 151 transitions, 1506 flow
[2024-06-03 22:00:46,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1506, PETRI_PLACES=127, PETRI_TRANSITIONS=151}
[2024-06-03 22:00:46,736 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 83 predicate places.
[2024-06-03 22:00:46,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 151 transitions, 1506 flow
[2024-06-03 22:00:46,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:46,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:46,736 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:46,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:00:46,737 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:46,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:46,737 INFO  L85        PathProgramCache]: Analyzing trace with hash -1349493583, now seen corresponding path program 4 times
[2024-06-03 22:00:46,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:46,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797608559]
[2024-06-03 22:00:46,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:46,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:46,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:57,391 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-03 22:00:57,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:57,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797608559]
[2024-06-03 22:00:57,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797608559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:57,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:57,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:00:57,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600793937]
[2024-06-03 22:00:57,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:57,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:00:57,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:57,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:00:57,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:00:57,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:00:57,586 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 151 transitions, 1506 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:57,586 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:57,586 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:00:57,586 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:59,485 INFO  L124   PetriNetUnfolderBase]: 2645/4039 cut-off events.
[2024-06-03 22:00:59,485 INFO  L125   PetriNetUnfolderBase]: For 134232/134243 co-relation queries the response was YES.
[2024-06-03 22:00:59,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25689 conditions, 4039 events. 2645/4039 cut-off events. For 134232/134243 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 20308 event pairs, 644 based on Foata normal form. 36/4073 useless extension candidates. Maximal degree in co-relation 25636. Up to 3470 conditions per place. 
[2024-06-03 22:00:59,508 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 133 selfloop transitions, 58 changer transitions 0/196 dead transitions.
[2024-06-03 22:00:59,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 196 transitions, 2062 flow
[2024-06-03 22:00:59,510 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:00:59,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:00:59,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-03 22:00:59,511 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-03 22:00:59,511 INFO  L175             Difference]: Start difference. First operand has 127 places, 151 transitions, 1506 flow. Second operand 10 states and 185 transitions.
[2024-06-03 22:00:59,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 196 transitions, 2062 flow
[2024-06-03 22:00:59,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 196 transitions, 1904 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-03 22:00:59,597 INFO  L231             Difference]: Finished difference. Result has 132 places, 153 transitions, 1539 flow
[2024-06-03 22:00:59,597 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1348, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1539, PETRI_PLACES=132, PETRI_TRANSITIONS=153}
[2024-06-03 22:00:59,598 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places.
[2024-06-03 22:00:59,598 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 153 transitions, 1539 flow
[2024-06-03 22:00:59,598 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:00:59,598 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:59,598 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:59,598 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:00:59,599 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:59,599 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:59,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -1349678281, now seen corresponding path program 4 times
[2024-06-03 22:00:59,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:59,599 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908687126]
[2024-06-03 22:00:59,599 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:59,599 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:59,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:01:10,685 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-03 22:01:10,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:01:10,685 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908687126]
[2024-06-03 22:01:10,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908687126] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:01:10,685 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:01:10,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:01:10,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13870125]
[2024-06-03 22:01:10,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:01:10,685 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:01:10,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:01:10,686 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:01:10,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:01:10,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 22:01:10,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 153 transitions, 1539 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:10,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:01:10,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 22:01:10,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:01:12,644 INFO  L124   PetriNetUnfolderBase]: 2557/3983 cut-off events.
[2024-06-03 22:01:12,645 INFO  L125   PetriNetUnfolderBase]: For 153902/153918 co-relation queries the response was YES.
[2024-06-03 22:01:12,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26228 conditions, 3983 events. 2557/3983 cut-off events. For 153902/153918 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 20964 event pairs, 593 based on Foata normal form. 36/4010 useless extension candidates. Maximal degree in co-relation 26173. Up to 3272 conditions per place. 
[2024-06-03 22:01:12,668 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 107 selfloop transitions, 75 changer transitions 0/193 dead transitions.
[2024-06-03 22:01:12,668 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 193 transitions, 2069 flow
[2024-06-03 22:01:12,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:01:12,670 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:01:12,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-03 22:01:12,671 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4496124031007752
[2024-06-03 22:01:12,671 INFO  L175             Difference]: Start difference. First operand has 132 places, 153 transitions, 1539 flow. Second operand 9 states and 174 transitions.
[2024-06-03 22:01:12,671 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 193 transitions, 2069 flow
[2024-06-03 22:01:12,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 193 transitions, 1837 flow, removed 26 selfloop flow, removed 10 redundant places.
[2024-06-03 22:01:12,761 INFO  L231             Difference]: Finished difference. Result has 131 places, 155 transitions, 1528 flow
[2024-06-03 22:01:12,761 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1528, PETRI_PLACES=131, PETRI_TRANSITIONS=155}
[2024-06-03 22:01:12,761 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 87 predicate places.
[2024-06-03 22:01:12,762 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 1528 flow
[2024-06-03 22:01:12,762 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:12,762 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:01:12,762 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:01:12,762 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:01:12,762 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:01:12,762 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:01:12,762 INFO  L85        PathProgramCache]: Analyzing trace with hash 1965450695, now seen corresponding path program 5 times
[2024-06-03 22:01:12,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:01:12,762 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121977443]
[2024-06-03 22:01:12,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:01:12,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:01:12,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:01:24,414 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-03 22:01:24,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:01:24,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121977443]
[2024-06-03 22:01:24,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121977443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:01:24,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:01:24,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:01:24,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339515994]
[2024-06-03 22:01:24,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:01:24,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:01:24,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:01:24,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:01:24,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:01:24,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:01:24,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 155 transitions, 1528 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:24,578 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:01:24,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:01:24,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:01:26,358 INFO  L124   PetriNetUnfolderBase]: 2696/4128 cut-off events.
[2024-06-03 22:01:26,358 INFO  L125   PetriNetUnfolderBase]: For 140925/140936 co-relation queries the response was YES.
[2024-06-03 22:01:26,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26101 conditions, 4128 events. 2696/4128 cut-off events. For 140925/140936 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 20964 event pairs, 692 based on Foata normal form. 12/4138 useless extension candidates. Maximal degree in co-relation 26047. Up to 3901 conditions per place. 
[2024-06-03 22:01:26,379 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 147 selfloop transitions, 32 changer transitions 0/184 dead transitions.
[2024-06-03 22:01:26,379 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 184 transitions, 1994 flow
[2024-06-03 22:01:26,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:01:26,382 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:01:26,382 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-03 22:01:26,382 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39018087855297157
[2024-06-03 22:01:26,382 INFO  L175             Difference]: Start difference. First operand has 131 places, 155 transitions, 1528 flow. Second operand 9 states and 151 transitions.
[2024-06-03 22:01:26,382 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 184 transitions, 1994 flow
[2024-06-03 22:01:26,458 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 184 transitions, 1809 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-03 22:01:26,460 INFO  L231             Difference]: Finished difference. Result has 133 places, 156 transitions, 1454 flow
[2024-06-03 22:01:26,460 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1454, PETRI_PLACES=133, PETRI_TRANSITIONS=156}
[2024-06-03 22:01:26,460 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-03 22:01:26,460 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 156 transitions, 1454 flow
[2024-06-03 22:01:26,460 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:26,460 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:01:26,460 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:01:26,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:01:26,461 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-03 22:01:26,461 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:01:26,461 INFO  L85        PathProgramCache]: Analyzing trace with hash 1235472530, now seen corresponding path program 2 times
[2024-06-03 22:01:26,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:01:26,461 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764303060]
[2024-06-03 22:01:26,461 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:01:26,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:01:26,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:01:40,624 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-03 22:01:40,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:01:40,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764303060]
[2024-06-03 22:01:40,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764303060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:01:40,624 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:01:40,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:01:40,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302339988]
[2024-06-03 22:01:40,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:01:40,625 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:01:40,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:01:40,625 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:01:40,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:01:40,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:01:40,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 156 transitions, 1454 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:40,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:01:40,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:01:40,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:01:42,566 INFO  L124   PetriNetUnfolderBase]: 2693/4124 cut-off events.
[2024-06-03 22:01:42,566 INFO  L125   PetriNetUnfolderBase]: For 143787/143798 co-relation queries the response was YES.
[2024-06-03 22:01:42,577 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25748 conditions, 4124 events. 2693/4124 cut-off events. For 143787/143798 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 21008 event pairs, 697 based on Foata normal form. 9/4131 useless extension candidates. Maximal degree in co-relation 25693. Up to 3978 conditions per place. 
[2024-06-03 22:01:42,589 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 144 selfloop transitions, 16 changer transitions 0/165 dead transitions.
[2024-06-03 22:01:42,589 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 165 transitions, 1796 flow
[2024-06-03 22:01:42,589 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:01:42,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:01:42,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-03 22:01:42,590 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3798449612403101
[2024-06-03 22:01:42,591 INFO  L175             Difference]: Start difference. First operand has 133 places, 156 transitions, 1454 flow. Second operand 6 states and 98 transitions.
[2024-06-03 22:01:42,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 165 transitions, 1796 flow
[2024-06-03 22:01:42,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 165 transitions, 1671 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-03 22:01:42,668 INFO  L231             Difference]: Finished difference. Result has 132 places, 156 transitions, 1367 flow
[2024-06-03 22:01:42,668 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1367, PETRI_PLACES=132, PETRI_TRANSITIONS=156}
[2024-06-03 22:01:42,669 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 88 predicate places.
[2024-06-03 22:01:42,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 1367 flow
[2024-06-03 22:01:42,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:42,669 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:01:42,669 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:01:42,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:01:42,670 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-03 22:01:42,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:01:42,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 1229764562, now seen corresponding path program 1 times
[2024-06-03 22:01:42,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:01:42,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104275537]
[2024-06-03 22:01:42,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:01:42,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:01:42,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:01:55,316 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-03 22:01:55,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:01:55,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104275537]
[2024-06-03 22:01:55,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104275537] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:01:55,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:01:55,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:01:55,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113519440]
[2024-06-03 22:01:55,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:01:55,317 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:01:55,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:01:55,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:01:55,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:01:55,516 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 22:01:55,517 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 1367 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:55,517 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:01:55,517 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 22:01:55,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:01:57,008 INFO  L124   PetriNetUnfolderBase]: 2446/3847 cut-off events.
[2024-06-03 22:01:57,008 INFO  L125   PetriNetUnfolderBase]: For 131102/131102 co-relation queries the response was YES.
[2024-06-03 22:01:57,020 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23422 conditions, 3847 events. 2446/3847 cut-off events. For 131102/131102 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20191 event pairs, 606 based on Foata normal form. 1/3847 useless extension candidates. Maximal degree in co-relation 23366. Up to 3630 conditions per place. 
[2024-06-03 22:01:57,031 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 153 selfloop transitions, 16 changer transitions 0/175 dead transitions.
[2024-06-03 22:01:57,031 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 175 transitions, 1849 flow
[2024-06-03 22:01:57,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:01:57,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:01:57,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-03 22:01:57,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41472868217054265
[2024-06-03 22:01:57,032 INFO  L175             Difference]: Start difference. First operand has 132 places, 156 transitions, 1367 flow. Second operand 6 states and 107 transitions.
[2024-06-03 22:01:57,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 175 transitions, 1849 flow
[2024-06-03 22:01:57,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 175 transitions, 1809 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 22:01:57,110 INFO  L231             Difference]: Finished difference. Result has 133 places, 162 transitions, 1423 flow
[2024-06-03 22:01:57,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1327, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1423, PETRI_PLACES=133, PETRI_TRANSITIONS=162}
[2024-06-03 22:01:57,110 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-03 22:01:57,110 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 162 transitions, 1423 flow
[2024-06-03 22:01:57,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:01:57,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:01:57,110 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:01:57,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:01:57,111 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-03 22:01:57,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:01:57,111 INFO  L85        PathProgramCache]: Analyzing trace with hash 1722561332, now seen corresponding path program 2 times
[2024-06-03 22:01:57,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:01:57,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440808853]
[2024-06-03 22:01:57,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:01:57,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:01:57,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:02:10,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:02:10,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:02:10,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440808853]
[2024-06-03 22:02:10,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440808853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:02:10,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:02:10,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:02:10,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917001959]
[2024-06-03 22:02:10,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:02:10,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:02:10,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:02:10,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:02:10,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:02:10,424 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 22:02:10,425 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 162 transitions, 1423 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:02:10,425 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:02:10,425 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 22:02:10,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:02:11,922 INFO  L124   PetriNetUnfolderBase]: 2443/3843 cut-off events.
[2024-06-03 22:02:11,922 INFO  L125   PetriNetUnfolderBase]: For 138657/138657 co-relation queries the response was YES.
[2024-06-03 22:02:11,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23935 conditions, 3843 events. 2443/3843 cut-off events. For 138657/138657 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 20179 event pairs, 605 based on Foata normal form. 1/3843 useless extension candidates. Maximal degree in co-relation 23878. Up to 3639 conditions per place. 
[2024-06-03 22:02:11,942 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 154 selfloop transitions, 11 changer transitions 0/171 dead transitions.
[2024-06-03 22:02:11,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 171 transitions, 1775 flow
[2024-06-03 22:02:11,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:02:11,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:02:11,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-03 22:02:11,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39147286821705424
[2024-06-03 22:02:11,943 INFO  L175             Difference]: Start difference. First operand has 133 places, 162 transitions, 1423 flow. Second operand 6 states and 101 transitions.
[2024-06-03 22:02:11,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 171 transitions, 1775 flow
[2024-06-03 22:02:12,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 171 transitions, 1731 flow, removed 18 selfloop flow, removed 2 redundant places.
[2024-06-03 22:02:12,018 INFO  L231             Difference]: Finished difference. Result has 137 places, 162 transitions, 1407 flow
[2024-06-03 22:02:12,018 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1407, PETRI_PLACES=137, PETRI_TRANSITIONS=162}
[2024-06-03 22:02:12,019 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places.
[2024-06-03 22:02:12,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 162 transitions, 1407 flow
[2024-06-03 22:02:12,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:02:12,019 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:02:12,019 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:02:12,019 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:02:12,019 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-03 22:02:12,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:02:12,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 1706482128, now seen corresponding path program 1 times
[2024-06-03 22:02:12,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:02:12,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913934933]
[2024-06-03 22:02:12,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:02:12,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:02:12,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:02:28,929 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-03 22:02:28,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:02:28,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913934933]
[2024-06-03 22:02:28,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913934933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:02:28,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:02:28,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:02:28,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419603483]
[2024-06-03 22:02:28,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:02:28,930 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:02:28,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:02:28,930 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:02:28,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:02:29,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:02:29,087 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 162 transitions, 1407 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:02:29,087 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:02:29,087 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:02:29,087 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:02:30,735 INFO  L124   PetriNetUnfolderBase]: 2576/3974 cut-off events.
[2024-06-03 22:02:30,735 INFO  L125   PetriNetUnfolderBase]: For 144095/144095 co-relation queries the response was YES.
[2024-06-03 22:02:30,746 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24759 conditions, 3974 events. 2576/3974 cut-off events. For 144095/144095 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 20249 event pairs, 642 based on Foata normal form. 2/3975 useless extension candidates. Maximal degree in co-relation 24700. Up to 3871 conditions per place. 
[2024-06-03 22:02:30,757 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 158 selfloop transitions, 14 changer transitions 0/176 dead transitions.
[2024-06-03 22:02:30,757 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 176 transitions, 1811 flow
[2024-06-03 22:02:30,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:02:30,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:02:30,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-03 22:02:30,758 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36212624584717606
[2024-06-03 22:02:30,759 INFO  L175             Difference]: Start difference. First operand has 137 places, 162 transitions, 1407 flow. Second operand 7 states and 109 transitions.
[2024-06-03 22:02:30,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 176 transitions, 1811 flow
[2024-06-03 22:02:30,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 176 transitions, 1781 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 22:02:30,835 INFO  L231             Difference]: Finished difference. Result has 139 places, 165 transitions, 1451 flow
[2024-06-03 22:02:30,835 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1451, PETRI_PLACES=139, PETRI_TRANSITIONS=165}
[2024-06-03 22:02:30,836 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places.
[2024-06-03 22:02:30,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 165 transitions, 1451 flow
[2024-06-03 22:02:30,836 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:02:30,836 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:02:30,836 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:02:30,836 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:02:30,836 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-03 22:02:30,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:02:30,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -709617742, now seen corresponding path program 1 times
[2024-06-03 22:02:30,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:02:30,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912656843]
[2024-06-03 22:02:30,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:02:30,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:02:30,869 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:02:47,386 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-03 22:02:47,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:02:47,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912656843]
[2024-06-03 22:02:47,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912656843] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:02:47,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:02:47,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:02:47,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141360891]
[2024-06-03 22:02:47,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:02:47,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:02:47,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:02:47,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:02:47,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:02:47,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:02:47,534 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 165 transitions, 1451 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:02:47,534 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:02:47,534 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:02:47,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:02:49,323 INFO  L124   PetriNetUnfolderBase]: 2696/4127 cut-off events.
[2024-06-03 22:02:49,323 INFO  L125   PetriNetUnfolderBase]: For 173282/173282 co-relation queries the response was YES.
[2024-06-03 22:02:49,336 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27204 conditions, 4127 events. 2696/4127 cut-off events. For 173282/173282 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 20963 event pairs, 686 based on Foata normal form. 2/4128 useless extension candidates. Maximal degree in co-relation 27144. Up to 3934 conditions per place. 
[2024-06-03 22:02:49,349 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 165 selfloop transitions, 26 changer transitions 0/196 dead transitions.
[2024-06-03 22:02:49,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 196 transitions, 2033 flow
[2024-06-03 22:02:49,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:02:49,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:02:49,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-03 22:02:49,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4186046511627907
[2024-06-03 22:02:49,350 INFO  L175             Difference]: Start difference. First operand has 139 places, 165 transitions, 1451 flow. Second operand 7 states and 126 transitions.
[2024-06-03 22:02:49,350 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 196 transitions, 2033 flow
[2024-06-03 22:02:49,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 196 transitions, 1981 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-03 22:02:49,439 INFO  L231             Difference]: Finished difference. Result has 141 places, 171 transitions, 1532 flow
[2024-06-03 22:02:49,440 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1532, PETRI_PLACES=141, PETRI_TRANSITIONS=171}
[2024-06-03 22:02:49,440 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 97 predicate places.
[2024-06-03 22:02:49,440 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 171 transitions, 1532 flow
[2024-06-03 22:02:49,440 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:02:49,440 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:02:49,441 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:02:49,441 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:02:49,441 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:02:49,441 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:02:49,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -1589900213, now seen corresponding path program 1 times
[2024-06-03 22:02:49,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:02:49,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818718514]
[2024-06-03 22:02:49,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:02:49,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:02:49,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:03:00,291 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-03 22:03:00,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:03:00,291 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818718514]
[2024-06-03 22:03:00,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818718514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:03:00,291 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:03:00,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:03:00,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803277713]
[2024-06-03 22:03:00,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:03:00,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:03:00,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:03:00,292 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:03:00,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:03:00,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:03:00,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 171 transitions, 1532 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:03:00,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:03:00,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:03:00,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:03:02,584 INFO  L124   PetriNetUnfolderBase]: 2899/4460 cut-off events.
[2024-06-03 22:03:02,584 INFO  L125   PetriNetUnfolderBase]: For 204656/204656 co-relation queries the response was YES.
[2024-06-03 22:03:02,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30080 conditions, 4460 events. 2899/4460 cut-off events. For 204656/204656 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 23236 event pairs, 717 based on Foata normal form. 16/4475 useless extension candidates. Maximal degree in co-relation 30019. Up to 3650 conditions per place. 
[2024-06-03 22:03:02,611 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 179 selfloop transitions, 43 changer transitions 0/227 dead transitions.
[2024-06-03 22:03:02,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 227 transitions, 2332 flow
[2024-06-03 22:03:02,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:03:02,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:03:02,614 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-03 22:03:02,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42790697674418604
[2024-06-03 22:03:02,614 INFO  L175             Difference]: Start difference. First operand has 141 places, 171 transitions, 1532 flow. Second operand 10 states and 184 transitions.
[2024-06-03 22:03:02,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 227 transitions, 2332 flow
[2024-06-03 22:03:02,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 227 transitions, 2280 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-03 22:03:02,735 INFO  L231             Difference]: Finished difference. Result has 149 places, 175 transitions, 1671 flow
[2024-06-03 22:03:02,735 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1671, PETRI_PLACES=149, PETRI_TRANSITIONS=175}
[2024-06-03 22:03:02,735 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 105 predicate places.
[2024-06-03 22:03:02,735 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 175 transitions, 1671 flow
[2024-06-03 22:03:02,736 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:03:02,736 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:03:02,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-03 22:03:02,736 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 22:03:02,736 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:03:02,736 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:03:02,736 INFO  L85        PathProgramCache]: Analyzing trace with hash -234362575, now seen corresponding path program 2 times
[2024-06-03 22:03:02,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:03:02,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248695158]
[2024-06-03 22:03:02,736 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:03:02,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:03:02,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:03:13,590 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-03 22:03:13,590 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:03:13,590 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248695158]
[2024-06-03 22:03:13,590 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248695158] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:03:13,590 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:03:13,591 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:03:13,591 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673238391]
[2024-06-03 22:03:13,591 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:03:13,591 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:03:13,591 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:03:13,591 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:03:13,591 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:03:13,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:03:13,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 175 transitions, 1671 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:03:13,773 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:03:13,773 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:03:13,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:03:15,856 INFO  L124   PetriNetUnfolderBase]: 2963/4566 cut-off events.
[2024-06-03 22:03:15,857 INFO  L125   PetriNetUnfolderBase]: For 215587/215587 co-relation queries the response was YES.
[2024-06-03 22:03:15,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30946 conditions, 4566 events. 2963/4566 cut-off events. For 215587/215587 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24045 event pairs, 749 based on Foata normal form. 20/4585 useless extension candidates. Maximal degree in co-relation 30882. Up to 4052 conditions per place. 
[2024-06-03 22:03:15,886 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 176 selfloop transitions, 45 changer transitions 0/226 dead transitions.
[2024-06-03 22:03:15,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 226 transitions, 2326 flow
[2024-06-03 22:03:15,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:03:15,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:03:15,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-03 22:03:15,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42093023255813955
[2024-06-03 22:03:15,889 INFO  L175             Difference]: Start difference. First operand has 149 places, 175 transitions, 1671 flow. Second operand 10 states and 181 transitions.
[2024-06-03 22:03:15,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 226 transitions, 2326 flow
[2024-06-03 22:03:16,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 226 transitions, 2270 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-03 22:03:16,058 INFO  L231             Difference]: Finished difference. Result has 155 places, 181 transitions, 1814 flow
[2024-06-03 22:03:16,058 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1814, PETRI_PLACES=155, PETRI_TRANSITIONS=181}
[2024-06-03 22:03:16,059 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places.
[2024-06-03 22:03:16,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 181 transitions, 1814 flow
[2024-06-03 22:03:16,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:03:16,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:03:16,059 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:03:16,059 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 22:03:16,059 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-03 22:03:16,059 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:03:16,059 INFO  L85        PathProgramCache]: Analyzing trace with hash -709319212, now seen corresponding path program 2 times
[2024-06-03 22:03:16,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:03:16,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305618844]
[2024-06-03 22:03:16,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:03:16,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:03:16,092 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:03:32,877 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-03 22:03:32,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:03:32,878 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305618844]
[2024-06-03 22:03:32,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305618844] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:03:32,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:03:32,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:03:32,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938076843]
[2024-06-03 22:03:32,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:03:32,878 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:03:32,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:03:32,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:03:32,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:03:32,992 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:03:32,992 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 181 transitions, 1814 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:03:32,992 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:03:32,992 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:03:32,992 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:03:35,129 INFO  L124   PetriNetUnfolderBase]: 2973/4580 cut-off events.
[2024-06-03 22:03:35,129 INFO  L125   PetriNetUnfolderBase]: For 216531/216531 co-relation queries the response was YES.
[2024-06-03 22:03:35,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31437 conditions, 4580 events. 2973/4580 cut-off events. For 216531/216531 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24161 event pairs, 770 based on Foata normal form. 2/4581 useless extension candidates. Maximal degree in co-relation 31370. Up to 4383 conditions per place. 
[2024-06-03 22:03:35,158 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 177 selfloop transitions, 30 changer transitions 0/212 dead transitions.
[2024-06-03 22:03:35,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 212 transitions, 2408 flow
[2024-06-03 22:03:35,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:03:35,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:03:35,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-03 22:03:35,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39018087855297157
[2024-06-03 22:03:35,159 INFO  L175             Difference]: Start difference. First operand has 155 places, 181 transitions, 1814 flow. Second operand 9 states and 151 transitions.
[2024-06-03 22:03:35,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 212 transitions, 2408 flow
[2024-06-03 22:03:35,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 212 transitions, 2292 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-03 22:03:35,324 INFO  L231             Difference]: Finished difference. Result has 156 places, 184 transitions, 1798 flow
[2024-06-03 22:03:35,324 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1698, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1798, PETRI_PLACES=156, PETRI_TRANSITIONS=184}
[2024-06-03 22:03:35,325 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 112 predicate places.
[2024-06-03 22:03:35,325 INFO  L495      AbstractCegarLoop]: Abstraction has has 156 places, 184 transitions, 1798 flow
[2024-06-03 22:03:35,325 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:03:35,325 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:03:35,325 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:03:35,325 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 22:03:35,325 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-03 22:03:35,325 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:03:35,326 INFO  L85        PathProgramCache]: Analyzing trace with hash 1487473022, now seen corresponding path program 1 times
[2024-06-03 22:03:35,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:03:35,326 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610753125]
[2024-06-03 22:03:35,326 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:03:35,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:03:35,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:03:51,668 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-03 22:03:51,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:03:51,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610753125]
[2024-06-03 22:03:51,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610753125] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:03:51,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:03:51,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:03:51,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127431594]
[2024-06-03 22:03:51,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:03:51,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:03:51,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:03:51,669 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:03:51,669 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:03:51,840 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43
[2024-06-03 22:03:51,841 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 184 transitions, 1798 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:03:51,841 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:03:51,841 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43
[2024-06-03 22:03:51,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:03:53,728 INFO  L124   PetriNetUnfolderBase]: 3117/4726 cut-off events.
[2024-06-03 22:03:53,728 INFO  L125   PetriNetUnfolderBase]: For 222049/222049 co-relation queries the response was YES.
[2024-06-03 22:03:53,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32122 conditions, 4726 events. 3117/4726 cut-off events. For 222049/222049 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 24329 event pairs, 808 based on Foata normal form. 1/4726 useless extension candidates. Maximal degree in co-relation 32054. Up to 4677 conditions per place. 
[2024-06-03 22:03:53,759 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 181 selfloop transitions, 25 changer transitions 0/209 dead transitions.
[2024-06-03 22:03:53,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 209 transitions, 2406 flow
[2024-06-03 22:03:53,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:03:53,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:03:53,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions.
[2024-06-03 22:03:53,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.34366925064599485
[2024-06-03 22:03:53,760 INFO  L175             Difference]: Start difference. First operand has 156 places, 184 transitions, 1798 flow. Second operand 9 states and 133 transitions.
[2024-06-03 22:03:53,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 209 transitions, 2406 flow
[2024-06-03 22:03:53,920 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 209 transitions, 2324 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-03 22:03:53,923 INFO  L231             Difference]: Finished difference. Result has 158 places, 190 transitions, 1854 flow
[2024-06-03 22:03:53,923 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1854, PETRI_PLACES=158, PETRI_TRANSITIONS=190}
[2024-06-03 22:03:53,923 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places.
[2024-06-03 22:03:53,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 190 transitions, 1854 flow
[2024-06-03 22:03:53,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:03:53,923 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:03:53,924 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:03:53,924 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 22:03:53,924 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:03:53,924 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:03:53,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -409835573, now seen corresponding path program 3 times
[2024-06-03 22:03:53,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:03:53,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825123442]
[2024-06-03 22:03:53,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:03:53,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:03:53,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:04:05,775 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-03 22:04:05,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:04:05,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825123442]
[2024-06-03 22:04:05,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825123442] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:04:05,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:04:05,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:04:05,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146636868]
[2024-06-03 22:04:05,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:04:05,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:04:05,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:04:05,776 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:04:05,776 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:04:06,019 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:04:06,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 190 transitions, 1854 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:06,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:04:06,019 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:04:06,019 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:04:07,999 INFO  L124   PetriNetUnfolderBase]: 2954/4545 cut-off events.
[2024-06-03 22:04:07,999 INFO  L125   PetriNetUnfolderBase]: For 233291/233299 co-relation queries the response was YES.
[2024-06-03 22:04:08,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31040 conditions, 4545 events. 2954/4545 cut-off events. For 233291/233299 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23810 event pairs, 703 based on Foata normal form. 26/4569 useless extension candidates. Maximal degree in co-relation 30971. Up to 3961 conditions per place. 
[2024-06-03 22:04:08,029 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 162 selfloop transitions, 64 changer transitions 0/233 dead transitions.
[2024-06-03 22:04:08,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 233 transitions, 2432 flow
[2024-06-03 22:04:08,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:04:08,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:04:08,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-03 22:04:08,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4232558139534884
[2024-06-03 22:04:08,033 INFO  L175             Difference]: Start difference. First operand has 158 places, 190 transitions, 1854 flow. Second operand 10 states and 182 transitions.
[2024-06-03 22:04:08,033 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 233 transitions, 2432 flow
[2024-06-03 22:04:08,193 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 233 transitions, 2350 flow, removed 29 selfloop flow, removed 5 redundant places.
[2024-06-03 22:04:08,196 INFO  L231             Difference]: Finished difference. Result has 163 places, 190 transitions, 1910 flow
[2024-06-03 22:04:08,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1910, PETRI_PLACES=163, PETRI_TRANSITIONS=190}
[2024-06-03 22:04:08,196 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 119 predicate places.
[2024-06-03 22:04:08,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 190 transitions, 1910 flow
[2024-06-03 22:04:08,197 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:08,197 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:04:08,197 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:04:08,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 22:04:08,197 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:04:08,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:04:08,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 673962161, now seen corresponding path program 4 times
[2024-06-03 22:04:08,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:04:08,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932671511]
[2024-06-03 22:04:08,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:04:08,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:04:08,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:04:20,482 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-03 22:04:20,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:04:20,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932671511]
[2024-06-03 22:04:20,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932671511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:04:20,482 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:04:20,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:04:20,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750491545]
[2024-06-03 22:04:20,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:04:20,483 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:04:20,483 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:04:20,483 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:04:20,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:04:20,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:04:20,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 190 transitions, 1910 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:20,663 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:04:20,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:04:20,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:04:22,916 INFO  L124   PetriNetUnfolderBase]: 3187/4930 cut-off events.
[2024-06-03 22:04:22,916 INFO  L125   PetriNetUnfolderBase]: For 251777/251785 co-relation queries the response was YES.
[2024-06-03 22:04:22,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33655 conditions, 4930 events. 3187/4930 cut-off events. For 251777/251785 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 26543 event pairs, 737 based on Foata normal form. 22/4950 useless extension candidates. Maximal degree in co-relation 33584. Up to 3827 conditions per place. 
[2024-06-03 22:04:22,948 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 156 selfloop transitions, 82 changer transitions 0/245 dead transitions.
[2024-06-03 22:04:22,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 245 transitions, 2783 flow
[2024-06-03 22:04:22,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:04:22,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:04:22,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-03 22:04:22,951 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43488372093023253
[2024-06-03 22:04:22,951 INFO  L175             Difference]: Start difference. First operand has 163 places, 190 transitions, 1910 flow. Second operand 10 states and 187 transitions.
[2024-06-03 22:04:22,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 245 transitions, 2783 flow
[2024-06-03 22:04:23,125 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 245 transitions, 2623 flow, removed 8 selfloop flow, removed 9 redundant places.
[2024-06-03 22:04:23,128 INFO  L231             Difference]: Finished difference. Result has 165 places, 196 transitions, 2054 flow
[2024-06-03 22:04:23,129 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2054, PETRI_PLACES=165, PETRI_TRANSITIONS=196}
[2024-06-03 22:04:23,129 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 121 predicate places.
[2024-06-03 22:04:23,129 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 196 transitions, 2054 flow
[2024-06-03 22:04:23,129 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:23,129 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:04:23,129 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:04:23,129 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 22:04:23,129 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:04:23,130 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:04:23,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -2096006193, now seen corresponding path program 5 times
[2024-06-03 22:04:23,130 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:04:23,130 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503704365]
[2024-06-03 22:04:23,130 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:04:23,130 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:04:23,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:04:34,944 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-03 22:04:34,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:04:34,946 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503704365]
[2024-06-03 22:04:34,946 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503704365] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:04:34,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:04:34,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:04:34,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351073905]
[2024-06-03 22:04:34,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:04:34,947 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:04:34,947 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:04:34,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:04:34,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:04:35,221 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:04:35,222 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 196 transitions, 2054 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:35,222 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:04:35,222 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:04:35,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:04:37,408 INFO  L124   PetriNetUnfolderBase]: 3323/5158 cut-off events.
[2024-06-03 22:04:37,408 INFO  L125   PetriNetUnfolderBase]: For 264204/264212 co-relation queries the response was YES.
[2024-06-03 22:04:37,425 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35475 conditions, 5158 events. 3323/5158 cut-off events. For 264204/264212 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 28224 event pairs, 796 based on Foata normal form. 22/5178 useless extension candidates. Maximal degree in co-relation 35402. Up to 4083 conditions per place. 
[2024-06-03 22:04:37,440 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 164 selfloop transitions, 77 changer transitions 0/248 dead transitions.
[2024-06-03 22:04:37,440 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 248 transitions, 2916 flow
[2024-06-03 22:04:37,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:04:37,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:04:37,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-03 22:04:37,443 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43953488372093025
[2024-06-03 22:04:37,443 INFO  L175             Difference]: Start difference. First operand has 165 places, 196 transitions, 2054 flow. Second operand 10 states and 189 transitions.
[2024-06-03 22:04:37,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 248 transitions, 2916 flow
[2024-06-03 22:04:37,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 248 transitions, 2850 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 22:04:37,637 INFO  L231             Difference]: Finished difference. Result has 172 places, 199 transitions, 2256 flow
[2024-06-03 22:04:37,637 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1988, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2256, PETRI_PLACES=172, PETRI_TRANSITIONS=199}
[2024-06-03 22:04:37,637 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 128 predicate places.
[2024-06-03 22:04:37,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 199 transitions, 2256 flow
[2024-06-03 22:04:37,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:37,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:04:37,638 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:04:37,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 22:04:37,638 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:04:37,638 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:04:37,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -143929043, now seen corresponding path program 6 times
[2024-06-03 22:04:37,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:04:37,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933503136]
[2024-06-03 22:04:37,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:04:37,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:04:37,682 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:04:48,927 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-03 22:04:48,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:04:48,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933503136]
[2024-06-03 22:04:48,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933503136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:04:48,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:04:48,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:04:48,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993963877]
[2024-06-03 22:04:48,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:04:48,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:04:48,928 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:04:48,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:04:48,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:04:49,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:04:49,153 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 199 transitions, 2256 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:49,154 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:04:49,154 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:04:49,154 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:04:51,401 INFO  L124   PetriNetUnfolderBase]: 3331/5178 cut-off events.
[2024-06-03 22:04:51,402 INFO  L125   PetriNetUnfolderBase]: For 272341/272349 co-relation queries the response was YES.
[2024-06-03 22:04:51,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35866 conditions, 5178 events. 3331/5178 cut-off events. For 272341/272349 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28319 event pairs, 712 based on Foata normal form. 22/5198 useless extension candidates. Maximal degree in co-relation 35790. Up to 2955 conditions per place. 
[2024-06-03 22:04:51,433 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 150 selfloop transitions, 94 changer transitions 0/251 dead transitions.
[2024-06-03 22:04:51,433 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 251 transitions, 3084 flow
[2024-06-03 22:04:51,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:04:51,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:04:51,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-03 22:04:51,435 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-03 22:04:51,435 INFO  L175             Difference]: Start difference. First operand has 172 places, 199 transitions, 2256 flow. Second operand 10 states and 185 transitions.
[2024-06-03 22:04:51,435 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 251 transitions, 3084 flow
[2024-06-03 22:04:51,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 251 transitions, 2938 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 22:04:51,627 INFO  L231             Difference]: Finished difference. Result has 176 places, 200 transitions, 2348 flow
[2024-06-03 22:04:51,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2348, PETRI_PLACES=176, PETRI_TRANSITIONS=200}
[2024-06-03 22:04:51,628 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 132 predicate places.
[2024-06-03 22:04:51,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 200 transitions, 2348 flow
[2024-06-03 22:04:51,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 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-03 22:04:51,628 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:04:51,628 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:04:51,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:04:51,628 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-03 22:04:51,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:04:51,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -354640090, now seen corresponding path program 2 times
[2024-06-03 22:04:51,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:04:51,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853327299]
[2024-06-03 22:04:51,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:04:51,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:04:51,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:05:06,069 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-03 22:05:06,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:05:06,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853327299]
[2024-06-03 22:05:06,069 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853327299] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:05:06,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:05:06,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:05:06,070 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106379028]
[2024-06-03 22:05:06,070 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:05:06,070 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:05:06,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:05:06,070 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:05:06,070 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:05:06,154 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43
[2024-06-03 22:05:06,155 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 200 transitions, 2348 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:06,155 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:05:06,155 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43
[2024-06-03 22:05:06,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:05:08,298 INFO  L124   PetriNetUnfolderBase]: 3463/5312 cut-off events.
[2024-06-03 22:05:08,298 INFO  L125   PetriNetUnfolderBase]: For 271982/271990 co-relation queries the response was YES.
[2024-06-03 22:05:08,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37094 conditions, 5312 events. 3463/5312 cut-off events. For 271982/271990 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28700 event pairs, 912 based on Foata normal form. 7/5317 useless extension candidates. Maximal degree in co-relation 37016. Up to 5260 conditions per place. 
[2024-06-03 22:05:08,333 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 184 selfloop transitions, 27 changer transitions 0/214 dead transitions.
[2024-06-03 22:05:08,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 214 transitions, 2914 flow
[2024-06-03 22:05:08,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:05:08,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:05:08,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions.
[2024-06-03 22:05:08,334 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3521594684385382
[2024-06-03 22:05:08,334 INFO  L175             Difference]: Start difference. First operand has 176 places, 200 transitions, 2348 flow. Second operand 7 states and 106 transitions.
[2024-06-03 22:05:08,334 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 214 transitions, 2914 flow
[2024-06-03 22:05:08,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 214 transitions, 2694 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-03 22:05:08,504 INFO  L231             Difference]: Finished difference. Result has 175 places, 203 transitions, 2224 flow
[2024-06-03 22:05:08,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2224, PETRI_PLACES=175, PETRI_TRANSITIONS=203}
[2024-06-03 22:05:08,505 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 131 predicate places.
[2024-06-03 22:05:08,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 203 transitions, 2224 flow
[2024-06-03 22:05:08,505 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:08,505 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:05:08,505 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:05:08,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 22:05:08,506 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-03 22:05:08,506 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:05:08,506 INFO  L85        PathProgramCache]: Analyzing trace with hash 1360908950, now seen corresponding path program 3 times
[2024-06-03 22:05:08,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:05:08,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606641087]
[2024-06-03 22:05:08,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:05:08,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:05:08,540 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:05:25,549 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-03 22:05:25,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:05:25,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606641087]
[2024-06-03 22:05:25,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606641087] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:05:25,550 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:05:25,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:05:25,550 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722460782]
[2024-06-03 22:05:25,550 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:05:25,550 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:05:25,550 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:05:25,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:05:25,551 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:05:25,700 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:05:25,700 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 203 transitions, 2224 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:25,700 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:05:25,700 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:05:25,700 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:05:27,881 INFO  L124   PetriNetUnfolderBase]: 3330/5177 cut-off events.
[2024-06-03 22:05:27,881 INFO  L125   PetriNetUnfolderBase]: For 277122/277130 co-relation queries the response was YES.
[2024-06-03 22:05:27,900 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35782 conditions, 5177 events. 3330/5177 cut-off events. For 277122/277130 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28533 event pairs, 877 based on Foata normal form. 8/5183 useless extension candidates. Maximal degree in co-relation 35703. Up to 4977 conditions per place. 
[2024-06-03 22:05:27,916 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 185 selfloop transitions, 30 changer transitions 0/223 dead transitions.
[2024-06-03 22:05:27,916 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 223 transitions, 2706 flow
[2024-06-03 22:05:27,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:05:27,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:05:27,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions.
[2024-06-03 22:05:27,917 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3695090439276486
[2024-06-03 22:05:27,917 INFO  L175             Difference]: Start difference. First operand has 175 places, 203 transitions, 2224 flow. Second operand 9 states and 143 transitions.
[2024-06-03 22:05:27,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 223 transitions, 2706 flow
[2024-06-03 22:05:28,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 223 transitions, 2628 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-06-03 22:05:28,131 INFO  L231             Difference]: Finished difference. Result has 180 places, 203 transitions, 2212 flow
[2024-06-03 22:05:28,131 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2146, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2212, PETRI_PLACES=180, PETRI_TRANSITIONS=203}
[2024-06-03 22:05:28,131 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places.
[2024-06-03 22:05:28,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 203 transitions, 2212 flow
[2024-06-03 22:05:28,131 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:28,132 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:05:28,132 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:05:28,132 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 22:05:28,132 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-03 22:05:28,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:05:28,132 INFO  L85        PathProgramCache]: Analyzing trace with hash -355055800, now seen corresponding path program 3 times
[2024-06-03 22:05:28,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:05:28,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853720290]
[2024-06-03 22:05:28,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:05:28,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:05:28,168 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:05:43,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:05:43,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:05:43,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853720290]
[2024-06-03 22:05:43,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853720290] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:05:43,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:05:43,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:05:43,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755042912]
[2024-06-03 22:05:43,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:05:43,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:05:43,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:05:43,241 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:05:43,241 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:05:43,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43
[2024-06-03 22:05:43,372 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 203 transitions, 2212 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:43,372 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:05:43,372 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43
[2024-06-03 22:05:43,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:05:45,360 INFO  L124   PetriNetUnfolderBase]: 3454/5300 cut-off events.
[2024-06-03 22:05:45,360 INFO  L125   PetriNetUnfolderBase]: For 285737/285742 co-relation queries the response was YES.
[2024-06-03 22:05:45,380 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36596 conditions, 5300 events. 3454/5300 cut-off events. For 285737/285742 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28629 event pairs, 916 based on Foata normal form. 5/5303 useless extension candidates. Maximal degree in co-relation 36516. Up to 5249 conditions per place. 
[2024-06-03 22:05:45,398 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 184 selfloop transitions, 26 changer transitions 0/213 dead transitions.
[2024-06-03 22:05:45,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 213 transitions, 2656 flow
[2024-06-03 22:05:45,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:05:45,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:05:45,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions.
[2024-06-03 22:05:45,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3521594684385382
[2024-06-03 22:05:45,399 INFO  L175             Difference]: Start difference. First operand has 180 places, 203 transitions, 2212 flow. Second operand 7 states and 106 transitions.
[2024-06-03 22:05:45,399 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 213 transitions, 2656 flow
[2024-06-03 22:05:45,617 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 213 transitions, 2560 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-03 22:05:45,620 INFO  L231             Difference]: Finished difference. Result has 179 places, 203 transitions, 2174 flow
[2024-06-03 22:05:45,620 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2174, PETRI_PLACES=179, PETRI_TRANSITIONS=203}
[2024-06-03 22:05:45,620 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places.
[2024-06-03 22:05:45,620 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 203 transitions, 2174 flow
[2024-06-03 22:05:45,620 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:45,621 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:05:45,621 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:05:45,621 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 22:05:45,621 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-03 22:05:45,621 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:05:45,621 INFO  L85        PathProgramCache]: Analyzing trace with hash -532122964, now seen corresponding path program 1 times
[2024-06-03 22:05:45,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:05:45,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267834301]
[2024-06-03 22:05:45,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:05:45,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:05:45,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:05:58,723 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-03 22:05:58,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:05:58,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267834301]
[2024-06-03 22:05:58,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267834301] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:05:58,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:05:58,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:05:58,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255757518]
[2024-06-03 22:05:58,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:05:58,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:05:58,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:05:58,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:05:58,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:05:58,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 22:05:58,960 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 203 transitions, 2174 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:05:58,960 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:05:58,960 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 22:05:58,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:06:00,776 INFO  L124   PetriNetUnfolderBase]: 3083/4900 cut-off events.
[2024-06-03 22:06:00,776 INFO  L125   PetriNetUnfolderBase]: For 260810/260810 co-relation queries the response was YES.
[2024-06-03 22:06:00,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33283 conditions, 4900 events. 3083/4900 cut-off events. For 260810/260810 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27733 event pairs, 786 based on Foata normal form. 1/4900 useless extension candidates. Maximal degree in co-relation 33202. Up to 4678 conditions per place. 
[2024-06-03 22:06:00,811 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 199 selfloop transitions, 14 changer transitions 0/222 dead transitions.
[2024-06-03 22:06:00,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 222 transitions, 2692 flow
[2024-06-03 22:06:00,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:06:00,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:06:00,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-03 22:06:00,812 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39867109634551495
[2024-06-03 22:06:00,813 INFO  L175             Difference]: Start difference. First operand has 179 places, 203 transitions, 2174 flow. Second operand 7 states and 120 transitions.
[2024-06-03 22:06:00,813 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 222 transitions, 2692 flow
[2024-06-03 22:06:01,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 222 transitions, 2624 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-03 22:06:01,004 INFO  L231             Difference]: Finished difference. Result has 179 places, 206 transitions, 2198 flow
[2024-06-03 22:06:01,004 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2198, PETRI_PLACES=179, PETRI_TRANSITIONS=206}
[2024-06-03 22:06:01,005 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 135 predicate places.
[2024-06-03 22:06:01,005 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 206 transitions, 2198 flow
[2024-06-03 22:06:01,005 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:01,005 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:06:01,005 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:06:01,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 22:06:01,005 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-03 22:06:01,006 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:06:01,006 INFO  L85        PathProgramCache]: Analyzing trace with hash 623949068, now seen corresponding path program 2 times
[2024-06-03 22:06:01,006 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:06:01,006 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18563591]
[2024-06-03 22:06:01,006 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:06:01,006 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:06:01,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:06:14,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:06:14,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:06:14,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18563591]
[2024-06-03 22:06:14,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18563591] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:06:14,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:06:14,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:06:14,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101016341]
[2024-06-03 22:06:14,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:06:14,924 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:06:14,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:06:14,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:06:14,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:06:15,118 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 22:06:15,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 206 transitions, 2198 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:15,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:06:15,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 22:06:15,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:06:17,077 INFO  L124   PetriNetUnfolderBase]: 3088/4907 cut-off events.
[2024-06-03 22:06:17,077 INFO  L125   PetriNetUnfolderBase]: For 271391/271391 co-relation queries the response was YES.
[2024-06-03 22:06:17,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33846 conditions, 4907 events. 3088/4907 cut-off events. For 271391/271391 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27777 event pairs, 787 based on Foata normal form. 1/4907 useless extension candidates. Maximal degree in co-relation 33764. Up to 4669 conditions per place. 
[2024-06-03 22:06:17,110 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 191 selfloop transitions, 26 changer transitions 0/226 dead transitions.
[2024-06-03 22:06:17,110 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 226 transitions, 2872 flow
[2024-06-03 22:06:17,110 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:06:17,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:06:17,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-03 22:06:17,111 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4053156146179402
[2024-06-03 22:06:17,111 INFO  L175             Difference]: Start difference. First operand has 179 places, 206 transitions, 2198 flow. Second operand 7 states and 122 transitions.
[2024-06-03 22:06:17,111 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 226 transitions, 2872 flow
[2024-06-03 22:06:17,353 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 226 transitions, 2802 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-03 22:06:17,356 INFO  L231             Difference]: Finished difference. Result has 181 places, 212 transitions, 2308 flow
[2024-06-03 22:06:17,356 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2308, PETRI_PLACES=181, PETRI_TRANSITIONS=212}
[2024-06-03 22:06:17,357 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 137 predicate places.
[2024-06-03 22:06:17,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 212 transitions, 2308 flow
[2024-06-03 22:06:17,357 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:17,357 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:06:17,357 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:06:17,357 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 22:06:17,357 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-03 22:06:17,357 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:06:17,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -532002808, now seen corresponding path program 1 times
[2024-06-03 22:06:17,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:06:17,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323685954]
[2024-06-03 22:06:17,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:06:17,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:06:17,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:06:30,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:06:30,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:06:30,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323685954]
[2024-06-03 22:06:30,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323685954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:06:30,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:06:30,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:06:30,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405152469]
[2024-06-03 22:06:30,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:06:30,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:06:30,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:06:30,545 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:06:30,545 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:06:30,708 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:06:30,709 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 212 transitions, 2308 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:30,709 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:06:30,709 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:06:30,709 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:06:32,579 INFO  L124   PetriNetUnfolderBase]: 3220/5041 cut-off events.
[2024-06-03 22:06:32,579 INFO  L125   PetriNetUnfolderBase]: For 283130/283130 co-relation queries the response was YES.
[2024-06-03 22:06:32,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35025 conditions, 5041 events. 3220/5041 cut-off events. For 283130/283130 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27955 event pairs, 825 based on Foata normal form. 1/5041 useless extension candidates. Maximal degree in co-relation 34942. Up to 4920 conditions per place. 
[2024-06-03 22:06:32,612 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 205 selfloop transitions, 24 changer transitions 0/233 dead transitions.
[2024-06-03 22:06:32,613 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 233 transitions, 2966 flow
[2024-06-03 22:06:32,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:06:32,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:06:32,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-03 22:06:32,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3691860465116279
[2024-06-03 22:06:32,614 INFO  L175             Difference]: Start difference. First operand has 181 places, 212 transitions, 2308 flow. Second operand 8 states and 127 transitions.
[2024-06-03 22:06:32,614 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 233 transitions, 2966 flow
[2024-06-03 22:06:32,848 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 233 transitions, 2894 flow, removed 28 selfloop flow, removed 3 redundant places.
[2024-06-03 22:06:32,850 INFO  L231             Difference]: Finished difference. Result has 186 places, 218 transitions, 2368 flow
[2024-06-03 22:06:32,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2368, PETRI_PLACES=186, PETRI_TRANSITIONS=218}
[2024-06-03 22:06:32,851 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 142 predicate places.
[2024-06-03 22:06:32,851 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 218 transitions, 2368 flow
[2024-06-03 22:06:32,851 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:32,851 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:06:32,851 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:06:32,851 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:06:32,852 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-03 22:06:32,852 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:06:32,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 1859795174, now seen corresponding path program 2 times
[2024-06-03 22:06:32,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:06:32,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168314866]
[2024-06-03 22:06:32,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:06:32,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:06:32,894 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:06:45,592 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-03 22:06:45,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:06:45,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168314866]
[2024-06-03 22:06:45,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168314866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:06:45,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:06:45,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:06:45,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925729782]
[2024-06-03 22:06:45,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:06:45,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:06:45,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:06:45,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:06:45,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:06:45,767 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:06:45,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 218 transitions, 2368 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:45,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:06:45,768 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:06:45,768 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:06:47,776 INFO  L124   PetriNetUnfolderBase]: 3225/5048 cut-off events.
[2024-06-03 22:06:47,776 INFO  L125   PetriNetUnfolderBase]: For 294891/294891 co-relation queries the response was YES.
[2024-06-03 22:06:47,794 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35642 conditions, 5048 events. 3225/5048 cut-off events. For 294891/294891 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27948 event pairs, 824 based on Foata normal form. 1/5048 useless extension candidates. Maximal degree in co-relation 35557. Up to 4941 conditions per place. 
[2024-06-03 22:06:47,808 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 209 selfloop transitions, 20 changer transitions 0/233 dead transitions.
[2024-06-03 22:06:47,808 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 233 transitions, 2990 flow
[2024-06-03 22:06:47,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:06:47,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:06:47,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-03 22:06:47,809 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3546511627906977
[2024-06-03 22:06:47,809 INFO  L175             Difference]: Start difference. First operand has 186 places, 218 transitions, 2368 flow. Second operand 8 states and 122 transitions.
[2024-06-03 22:06:47,809 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 233 transitions, 2990 flow
[2024-06-03 22:06:48,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 233 transitions, 2936 flow, removed 19 selfloop flow, removed 4 redundant places.
[2024-06-03 22:06:48,065 INFO  L231             Difference]: Finished difference. Result has 190 places, 221 transitions, 2402 flow
[2024-06-03 22:06:48,065 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2402, PETRI_PLACES=190, PETRI_TRANSITIONS=221}
[2024-06-03 22:06:48,065 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 146 predicate places.
[2024-06-03 22:06:48,065 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 221 transitions, 2402 flow
[2024-06-03 22:06:48,065 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:06:48,066 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:06:48,066 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:06:48,066 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 22:06:48,066 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-03 22:06:48,066 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:06:48,066 INFO  L85        PathProgramCache]: Analyzing trace with hash 1361330984, now seen corresponding path program 3 times
[2024-06-03 22:06:48,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:06:48,066 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559219934]
[2024-06-03 22:06:48,066 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:06:48,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:06:48,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:07:00,906 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-03 22:07:00,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:07:00,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559219934]
[2024-06-03 22:07:00,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559219934] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:07:00,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:07:00,907 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:07:00,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215570610]
[2024-06-03 22:07:00,907 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:07:00,907 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:07:00,907 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:07:00,908 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:07:00,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:07:01,122 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:07:01,122 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 221 transitions, 2402 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:01,122 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:07:01,122 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:07:01,122 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:07:02,963 INFO  L124   PetriNetUnfolderBase]: 3222/5044 cut-off events.
[2024-06-03 22:07:02,963 INFO  L125   PetriNetUnfolderBase]: For 304551/304551 co-relation queries the response was YES.
[2024-06-03 22:07:02,982 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35810 conditions, 5044 events. 3222/5044 cut-off events. For 304551/304551 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27936 event pairs, 824 based on Foata normal form. 1/5044 useless extension candidates. Maximal degree in co-relation 35723. Up to 4944 conditions per place. 
[2024-06-03 22:07:02,998 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 213 selfloop transitions, 14 changer transitions 0/231 dead transitions.
[2024-06-03 22:07:02,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 231 transitions, 2880 flow
[2024-06-03 22:07:02,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:07:02,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:07:02,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 108 transitions.
[2024-06-03 22:07:02,999 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3588039867109635
[2024-06-03 22:07:02,999 INFO  L175             Difference]: Start difference. First operand has 190 places, 221 transitions, 2402 flow. Second operand 7 states and 108 transitions.
[2024-06-03 22:07:02,999 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 231 transitions, 2880 flow
[2024-06-03 22:07:03,210 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 231 transitions, 2792 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 22:07:03,213 INFO  L231             Difference]: Finished difference. Result has 191 places, 221 transitions, 2348 flow
[2024-06-03 22:07:03,214 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2314, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2348, PETRI_PLACES=191, PETRI_TRANSITIONS=221}
[2024-06-03 22:07:03,214 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 147 predicate places.
[2024-06-03 22:07:03,214 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 221 transitions, 2348 flow
[2024-06-03 22:07:03,214 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:03,214 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:07:03,214 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:07:03,214 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 22:07:03,214 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-03 22:07:03,214 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:07:03,215 INFO  L85        PathProgramCache]: Analyzing trace with hash -354871474, now seen corresponding path program 3 times
[2024-06-03 22:07:03,215 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:07:03,215 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344075025]
[2024-06-03 22:07:03,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:07:03,215 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:07:03,274 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:07:16,182 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-03 22:07:16,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:07:16,182 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344075025]
[2024-06-03 22:07:16,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344075025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:07:16,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:07:16,182 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:07:16,182 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078871931]
[2024-06-03 22:07:16,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:07:16,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:07:16,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:07:16,183 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:07:16,183 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:07:16,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-03 22:07:16,351 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 221 transitions, 2348 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:16,351 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:07:16,351 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-03 22:07:16,351 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:07:18,251 INFO  L124   PetriNetUnfolderBase]: 3104/4925 cut-off events.
[2024-06-03 22:07:18,251 INFO  L125   PetriNetUnfolderBase]: For 314986/314986 co-relation queries the response was YES.
[2024-06-03 22:07:18,269 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35315 conditions, 4925 events. 3104/4925 cut-off events. For 314986/314986 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27796 event pairs, 789 based on Foata normal form. 1/4925 useless extension candidates. Maximal degree in co-relation 35227. Up to 4712 conditions per place. 
[2024-06-03 22:07:18,284 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 205 selfloop transitions, 14 changer transitions 0/231 dead transitions.
[2024-06-03 22:07:18,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 231 transitions, 2810 flow
[2024-06-03 22:07:18,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:07:18,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:07:18,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-03 22:07:18,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3787375415282392
[2024-06-03 22:07:18,285 INFO  L175             Difference]: Start difference. First operand has 191 places, 221 transitions, 2348 flow. Second operand 7 states and 114 transitions.
[2024-06-03 22:07:18,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 231 transitions, 2810 flow
[2024-06-03 22:07:18,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 231 transitions, 2732 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 22:07:18,526 INFO  L231             Difference]: Finished difference. Result has 192 places, 221 transitions, 2304 flow
[2024-06-03 22:07:18,527 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2304, PETRI_PLACES=192, PETRI_TRANSITIONS=221}
[2024-06-03 22:07:18,527 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 148 predicate places.
[2024-06-03 22:07:18,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 221 transitions, 2304 flow
[2024-06-03 22:07:18,527 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:18,527 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:07:18,527 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-03 22:07:18,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 22:07:18,527 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:07:18,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:07:18,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 204009652, now seen corresponding path program 1 times
[2024-06-03 22:07:18,528 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:07:18,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520174143]
[2024-06-03 22:07:18,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:07:18,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:07:18,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:07:29,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:07:29,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:07:29,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520174143]
[2024-06-03 22:07:29,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520174143] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:07:29,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:07:29,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:07:29,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599206181]
[2024-06-03 22:07:29,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:07:29,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:07:29,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:07:29,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:07:29,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:07:30,071 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:07:30,072 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 221 transitions, 2304 flow. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:30,072 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:07:30,072 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:07:30,072 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:07:32,293 INFO  L124   PetriNetUnfolderBase]: 3401/5281 cut-off events.
[2024-06-03 22:07:32,293 INFO  L125   PetriNetUnfolderBase]: For 386678/386678 co-relation queries the response was YES.
[2024-06-03 22:07:32,315 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39208 conditions, 5281 events. 3401/5281 cut-off events. For 386678/386678 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 28917 event pairs, 665 based on Foata normal form. 12/5292 useless extension candidates. Maximal degree in co-relation 39119. Up to 4965 conditions per place. 
[2024-06-03 22:07:32,332 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 236 selfloop transitions, 20 changer transitions 0/267 dead transitions.
[2024-06-03 22:07:32,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 267 transitions, 2984 flow
[2024-06-03 22:07:32,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:07:32,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:07:32,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions.
[2024-06-03 22:07:32,338 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39767441860465114
[2024-06-03 22:07:32,338 INFO  L175             Difference]: Start difference. First operand has 192 places, 221 transitions, 2304 flow. Second operand 10 states and 171 transitions.
[2024-06-03 22:07:32,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 267 transitions, 2984 flow
[2024-06-03 22:07:32,654 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 267 transitions, 2940 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-03 22:07:32,657 INFO  L231             Difference]: Finished difference. Result has 197 places, 224 transitions, 2371 flow
[2024-06-03 22:07:32,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2371, PETRI_PLACES=197, PETRI_TRANSITIONS=224}
[2024-06-03 22:07:32,657 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places.
[2024-06-03 22:07:32,657 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 224 transitions, 2371 flow
[2024-06-03 22:07:32,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:32,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:07:32,658 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-03 22:07:32,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 22:07:32,658 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:07:32,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:07:32,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 262217422, now seen corresponding path program 2 times
[2024-06-03 22:07:32,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:07:32,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748729821]
[2024-06-03 22:07:32,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:07:32,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:07:32,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:07:44,666 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-03 22:07:44,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:07:44,666 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748729821]
[2024-06-03 22:07:44,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748729821] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:07:44,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:07:44,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:07:44,667 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579166601]
[2024-06-03 22:07:44,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:07:44,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:07:44,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:07:44,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:07:44,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:07:44,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:07:44,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 224 transitions, 2371 flow. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:44,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:07:44,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:07:44,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:07:47,115 INFO  L124   PetriNetUnfolderBase]: 3381/5249 cut-off events.
[2024-06-03 22:07:47,115 INFO  L125   PetriNetUnfolderBase]: For 389864/389864 co-relation queries the response was YES.
[2024-06-03 22:07:47,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39062 conditions, 5249 events. 3381/5249 cut-off events. For 389864/389864 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 28875 event pairs, 807 based on Foata normal form. 12/5260 useless extension candidates. Maximal degree in co-relation 38971. Up to 4794 conditions per place. 
[2024-06-03 22:07:47,157 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 215 selfloop transitions, 43 changer transitions 0/269 dead transitions.
[2024-06-03 22:07:47,157 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 269 transitions, 3011 flow
[2024-06-03 22:07:47,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:07:47,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:07:47,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions.
[2024-06-03 22:07:47,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4069767441860465
[2024-06-03 22:07:47,160 INFO  L175             Difference]: Start difference. First operand has 197 places, 224 transitions, 2371 flow. Second operand 10 states and 175 transitions.
[2024-06-03 22:07:47,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 269 transitions, 3011 flow
[2024-06-03 22:07:47,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 269 transitions, 2911 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-03 22:07:47,513 INFO  L231             Difference]: Finished difference. Result has 201 places, 226 transitions, 2389 flow
[2024-06-03 22:07:47,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2389, PETRI_PLACES=201, PETRI_TRANSITIONS=226}
[2024-06-03 22:07:47,515 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 157 predicate places.
[2024-06-03 22:07:47,515 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 226 transitions, 2389 flow
[2024-06-03 22:07:47,515 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:47,515 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:07:47,516 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-03 22:07:47,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 22:07:47,516 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:07:47,516 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:07:47,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -665673440, now seen corresponding path program 3 times
[2024-06-03 22:07:47,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:07:47,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911103135]
[2024-06-03 22:07:47,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:07:47,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:07:47,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:07:58,930 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-03 22:07:58,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:07:58,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911103135]
[2024-06-03 22:07:58,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911103135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:07:58,930 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:07:58,930 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:07:58,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700239856]
[2024-06-03 22:07:58,930 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:07:58,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:07:58,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:07:58,931 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:07:58,931 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:07:59,204 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:07:59,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 226 transitions, 2389 flow. Second operand  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:07:59,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:07:59,205 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:07:59,205 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:08:01,469 INFO  L124   PetriNetUnfolderBase]: 3422/5320 cut-off events.
[2024-06-03 22:08:01,469 INFO  L125   PetriNetUnfolderBase]: For 406851/406851 co-relation queries the response was YES.
[2024-06-03 22:08:01,493 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39629 conditions, 5320 events. 3422/5320 cut-off events. For 406851/406851 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29383 event pairs, 817 based on Foata normal form. 12/5331 useless extension candidates. Maximal degree in co-relation 39536. Up to 4788 conditions per place. 
[2024-06-03 22:08:01,510 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 214 selfloop transitions, 48 changer transitions 0/273 dead transitions.
[2024-06-03 22:08:01,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 273 transitions, 3095 flow
[2024-06-03 22:08:01,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:08:01,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:08:01,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions.
[2024-06-03 22:08:01,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4069767441860465
[2024-06-03 22:08:01,513 INFO  L175             Difference]: Start difference. First operand has 201 places, 226 transitions, 2389 flow. Second operand 10 states and 175 transitions.
[2024-06-03 22:08:01,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 273 transitions, 3095 flow
[2024-06-03 22:08:01,839 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 273 transitions, 2993 flow, removed 7 selfloop flow, removed 8 redundant places.
[2024-06-03 22:08:01,842 INFO  L231             Difference]: Finished difference. Result has 204 places, 230 transitions, 2480 flow
[2024-06-03 22:08:01,842 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2287, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2480, PETRI_PLACES=204, PETRI_TRANSITIONS=230}
[2024-06-03 22:08:01,842 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 160 predicate places.
[2024-06-03 22:08:01,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 230 transitions, 2480 flow
[2024-06-03 22:08:01,843 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.6) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:01,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:08:01,843 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-03 22:08:01,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 22:08:01,843 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-03 22:08:01,843 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:08:01,843 INFO  L85        PathProgramCache]: Analyzing trace with hash -523312088, now seen corresponding path program 1 times
[2024-06-03 22:08:01,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:08:01,843 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125294042]
[2024-06-03 22:08:01,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:08:01,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:08:01,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:08:19,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:08:19,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:08:19,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125294042]
[2024-06-03 22:08:19,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125294042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:08:19,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:08:19,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:08:19,719 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781162823]
[2024-06-03 22:08:19,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:08:19,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:08:19,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:08:19,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:08:19,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:08:19,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43
[2024-06-03 22:08:19,828 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 230 transitions, 2480 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:19,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:08:19,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43
[2024-06-03 22:08:19,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:08:22,362 INFO  L124   PetriNetUnfolderBase]: 3540/5442 cut-off events.
[2024-06-03 22:08:22,362 INFO  L125   PetriNetUnfolderBase]: For 412662/412662 co-relation queries the response was YES.
[2024-06-03 22:08:22,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40733 conditions, 5442 events. 3540/5442 cut-off events. For 412662/412662 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29535 event pairs, 875 based on Foata normal form. 2/5443 useless extension candidates. Maximal degree in co-relation 40638. Up to 5314 conditions per place. 
[2024-06-03 22:08:22,403 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 217 selfloop transitions, 47 changer transitions 0/267 dead transitions.
[2024-06-03 22:08:22,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 267 transitions, 3276 flow
[2024-06-03 22:08:22,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:08:22,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:08:22,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions.
[2024-06-03 22:08:22,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35095137420718814
[2024-06-03 22:08:22,405 INFO  L175             Difference]: Start difference. First operand has 204 places, 230 transitions, 2480 flow. Second operand 11 states and 166 transitions.
[2024-06-03 22:08:22,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 267 transitions, 3276 flow
[2024-06-03 22:08:22,714 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 267 transitions, 3134 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-03 22:08:22,717 INFO  L231             Difference]: Finished difference. Result has 208 places, 236 transitions, 2524 flow
[2024-06-03 22:08:22,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2338, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2524, PETRI_PLACES=208, PETRI_TRANSITIONS=236}
[2024-06-03 22:08:22,717 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 164 predicate places.
[2024-06-03 22:08:22,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 236 transitions, 2524 flow
[2024-06-03 22:08:22,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:22,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:08:22,718 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-03 22:08:22,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 22:08:22,718 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-03 22:08:22,718 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:08:22,718 INFO  L85        PathProgramCache]: Analyzing trace with hash 477040083, now seen corresponding path program 1 times
[2024-06-03 22:08:22,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:08:22,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634358343]
[2024-06-03 22:08:22,718 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:08:22,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:08:22,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:08:35,014 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-03 22:08:35,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:08:35,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634358343]
[2024-06-03 22:08:35,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634358343] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:08:35,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:08:35,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:08:35,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070312387]
[2024-06-03 22:08:35,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:08:35,015 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:08:35,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:08:35,015 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:08:35,015 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:08:35,185 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:08:35,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 236 transitions, 2524 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:35,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:08:35,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:08:35,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:08:37,336 INFO  L124   PetriNetUnfolderBase]: 3457/5364 cut-off events.
[2024-06-03 22:08:37,336 INFO  L125   PetriNetUnfolderBase]: For 425818/425818 co-relation queries the response was YES.
[2024-06-03 22:08:37,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40626 conditions, 5364 events. 3457/5364 cut-off events. For 425818/425818 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29546 event pairs, 848 based on Foata normal form. 1/5364 useless extension candidates. Maximal degree in co-relation 40531. Up to 5192 conditions per place. 
[2024-06-03 22:08:37,376 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 225 selfloop transitions, 24 changer transitions 0/262 dead transitions.
[2024-06-03 22:08:37,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 262 transitions, 3268 flow
[2024-06-03 22:08:37,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:08:37,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:08:37,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-03 22:08:37,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4019933554817276
[2024-06-03 22:08:37,377 INFO  L175             Difference]: Start difference. First operand has 208 places, 236 transitions, 2524 flow. Second operand 7 states and 121 transitions.
[2024-06-03 22:08:37,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 262 transitions, 3268 flow
[2024-06-03 22:08:37,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 262 transitions, 3167 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 22:08:37,714 INFO  L231             Difference]: Finished difference. Result has 208 places, 242 transitions, 2571 flow
[2024-06-03 22:08:37,714 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2423, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2571, PETRI_PLACES=208, PETRI_TRANSITIONS=242}
[2024-06-03 22:08:37,715 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 164 predicate places.
[2024-06-03 22:08:37,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 242 transitions, 2571 flow
[2024-06-03 22:08:37,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:37,715 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:08:37,715 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-03 22:08:37,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 22:08:37,715 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-03 22:08:37,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:08:37,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 1507267667, now seen corresponding path program 2 times
[2024-06-03 22:08:37,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:08:37,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280744423]
[2024-06-03 22:08:37,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:08:37,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:08:37,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:08:49,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:08:49,938 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:08:49,938 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280744423]
[2024-06-03 22:08:49,938 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280744423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:08:49,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:08:49,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:08:49,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396786120]
[2024-06-03 22:08:49,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:08:49,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:08:49,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:08:49,939 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:08:49,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:08:50,118 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-03 22:08:50,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 242 transitions, 2571 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:50,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:08:50,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-03 22:08:50,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:08:52,303 INFO  L124   PetriNetUnfolderBase]: 3462/5371 cut-off events.
[2024-06-03 22:08:52,303 INFO  L125   PetriNetUnfolderBase]: For 441891/441891 co-relation queries the response was YES.
[2024-06-03 22:08:52,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41232 conditions, 5371 events. 3462/5371 cut-off events. For 441891/441891 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 29567 event pairs, 848 based on Foata normal form. 1/5371 useless extension candidates. Maximal degree in co-relation 41135. Up to 5214 conditions per place. 
[2024-06-03 22:08:52,342 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 229 selfloop transitions, 19 changer transitions 0/261 dead transitions.
[2024-06-03 22:08:52,342 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 261 transitions, 3157 flow
[2024-06-03 22:08:52,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:08:52,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:08:52,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-03 22:08:52,343 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3853820598006645
[2024-06-03 22:08:52,343 INFO  L175             Difference]: Start difference. First operand has 208 places, 242 transitions, 2571 flow. Second operand 7 states and 116 transitions.
[2024-06-03 22:08:52,343 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 261 transitions, 3157 flow
[2024-06-03 22:08:52,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 261 transitions, 3057 flow, removed 41 selfloop flow, removed 3 redundant places.
[2024-06-03 22:08:52,775 INFO  L231             Difference]: Finished difference. Result has 212 places, 245 transitions, 2571 flow
[2024-06-03 22:08:52,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2493, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2571, PETRI_PLACES=212, PETRI_TRANSITIONS=245}
[2024-06-03 22:08:52,776 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 168 predicate places.
[2024-06-03 22:08:52,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 245 transitions, 2571 flow
[2024-06-03 22:08:52,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:08:52,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:08:52,776 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-03 22:08:52,776 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 22:08:52,776 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-03 22:08:52,776 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:08:52,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -514057658, now seen corresponding path program 2 times
[2024-06-03 22:08:52,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:08:52,776 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648728570]
[2024-06-03 22:08:52,776 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:08:52,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:08:52,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:09:09,922 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-03 22:09:09,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:09:09,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648728570]
[2024-06-03 22:09:09,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648728570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:09:09,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:09:09,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:09:09,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054208443]
[2024-06-03 22:09:09,923 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:09:09,923 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:09:09,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:09:09,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:09:09,924 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:09:10,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 43
[2024-06-03 22:09:10,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 245 transitions, 2571 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:09:10,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:09:10,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 43
[2024-06-03 22:09:10,069 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:09:12,739 INFO  L124   PetriNetUnfolderBase]: 3584/5503 cut-off events.
[2024-06-03 22:09:12,739 INFO  L125   PetriNetUnfolderBase]: For 459876/459876 co-relation queries the response was YES.
[2024-06-03 22:09:12,763 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42262 conditions, 5503 events. 3584/5503 cut-off events. For 459876/459876 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 29905 event pairs, 874 based on Foata normal form. 2/5504 useless extension candidates. Maximal degree in co-relation 42163. Up to 5364 conditions per place. 
[2024-06-03 22:09:12,781 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 234 selfloop transitions, 52 changer transitions 0/289 dead transitions.
[2024-06-03 22:09:12,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 289 transitions, 3533 flow
[2024-06-03 22:09:12,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-06-03 22:09:12,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-06-03 22:09:12,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 205 transitions.
[2024-06-03 22:09:12,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.34053156146179403
[2024-06-03 22:09:12,782 INFO  L175             Difference]: Start difference. First operand has 212 places, 245 transitions, 2571 flow. Second operand 14 states and 205 transitions.
[2024-06-03 22:09:12,782 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 289 transitions, 3533 flow
[2024-06-03 22:09:13,183 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 289 transitions, 3483 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-03 22:09:13,186 INFO  L231             Difference]: Finished difference. Result has 221 places, 251 transitions, 2695 flow
[2024-06-03 22:09:13,186 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2521, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2695, PETRI_PLACES=221, PETRI_TRANSITIONS=251}
[2024-06-03 22:09:13,187 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 177 predicate places.
[2024-06-03 22:09:13,187 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 251 transitions, 2695 flow
[2024-06-03 22:09:13,187 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:09:13,187 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:09:13,187 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-03 22:09:13,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-03 22:09:13,187 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-03 22:09:13,188 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:09:13,188 INFO  L85        PathProgramCache]: Analyzing trace with hash -514046498, now seen corresponding path program 3 times
[2024-06-03 22:09:13,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:09:13,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449049269]
[2024-06-03 22:09:13,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:09:13,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:09:13,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15