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


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 21:45:36,495 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 21:45:36,561 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 21:45:36,565 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 21:45:36,566 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 21:45:36,611 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 21:45:36,611 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 21:45:36,612 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 21:45:36,612 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 21:45:36,615 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 21:45:36,615 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 21:45:36,616 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 21:45:36,616 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 21:45:36,618 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 21:45:36,618 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 21:45:36,635 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 21:45:36,636 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 21:45:36,636 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 21:45:36,636 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 21:45:36,636 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 21:45:36,638 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 21:45:36,638 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 21:45:36,638 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 21:45:36,638 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 21:45:36,638 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 21:45:36,639 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 21:45:36,639 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 21:45:36,639 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 21:45:36,640 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 21:45:36,640 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 21:45:36,641 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 21:45:36,641 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 21:45:36,641 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:45:36,641 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 21:45:36,641 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 21:45:36,642 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 21:45:36,642 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 21:45:36,642 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 21:45:36,642 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 21:45:36,642 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 21:45:36,642 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 21:45:36,643 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 21:45:36,643 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 21:45:36,643 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:45:36,862 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 21:45:36,888 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 21:45:36,889 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 21:45:36,890 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 21:45:36,891 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 21:45:36,892 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/mix031.opt.yml/witness.yml
[2024-06-03 21:45:37,067 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 21:45:37,067 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 21:45:37,067 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i
[2024-06-03 21:45:38,113 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 21:45:38,341 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 21:45:38,341 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i
[2024-06-03 21:45:38,365 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb15bd8f4/aee6ca44e73140d3a3af8b158b0a722c/FLAG1ad69488c
[2024-06-03 21:45:38,385 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb15bd8f4/aee6ca44e73140d3a3af8b158b0a722c
[2024-06-03 21:45:38,385 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 21:45:38,386 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 21:45:38,389 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 21:45:38,389 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 21:45:38,393 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 21:45:38,393 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:45:37" (1/2) ...
[2024-06-03 21:45:38,394 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ccaded and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:45:38, skipping insertion in model container
[2024-06-03 21:45:38,395 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:45:37" (1/2) ...
[2024-06-03 21:45:38,396 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@716f7959 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:45:38, skipping insertion in model container
[2024-06-03 21:45:38,397 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:45:38" (2/2) ...
[2024-06-03 21:45:38,397 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ccaded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:38, skipping insertion in model container
[2024-06-03 21:45:38,397 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:45:38" (2/2) ...
[2024-06-03 21:45:38,397 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 21:45:38,461 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 21:45:38,465 INFO  L97    edCorrectnessWitness]: Location invariant before [L827-L827] (((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-03 21:45:38,465 INFO  L97    edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (a == 0 || a == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1)))
[2024-06-03 21:45:38,466 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 21:45:38,467 INFO  L106   edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1;
[2024-06-03 21:45:38,506 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 21:45:38,817 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:45:38,840 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 21:45:39,160 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:45:39,195 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 21:45:39,200 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39 WrapperNode
[2024-06-03 21:45:39,200 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 21:45:39,201 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 21:45:39,201 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 21:45:39,201 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 21:45:39,207 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,240 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,446 INFO  L138                Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123
[2024-06-03 21:45:39,446 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 21:45:39,447 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 21:45:39,448 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 21:45:39,448 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 21:45:39,456 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,456 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,478 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,516 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:45:39,517 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,517 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,547 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,548 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,562 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,564 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,586 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 21:45:39,587 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 21:45:39,587 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 21:45:39,587 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 21:45:39,588 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (1/1) ...
[2024-06-03 21:45:39,592 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:45:39,598 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 21:45:39,611 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:45:39,615 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:45:39,639 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 21:45:39,640 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 21:45:39,640 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 21:45:39,640 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 21:45:39,640 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 21:45:39,640 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 21:45:39,641 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 21:45:39,641 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 21:45:39,641 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 21:45:39,641 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 21:45:39,642 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:45:39,728 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 21:45:39,730 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 21:45:40,706 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 21:45:40,706 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 21:45:40,925 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 21:45:40,926 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 21:45:40,927 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:45:40 BoogieIcfgContainer
[2024-06-03 21:45:40,927 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 21:45:40,930 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 21:45:40,930 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 21:45:40,933 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 21:45:40,933 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:45:37" (1/4) ...
[2024-06-03 21:45:40,934 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120a1531 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:45:40, skipping insertion in model container
[2024-06-03 21:45:40,934 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:45:38" (2/4) ...
[2024-06-03 21:45:40,935 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120a1531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:45:40, skipping insertion in model container
[2024-06-03 21:45:40,935 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:45:39" (3/4) ...
[2024-06-03 21:45:40,935 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@120a1531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:45:40, skipping insertion in model container
[2024-06-03 21:45:40,935 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:45:40" (4/4) ...
[2024-06-03 21:45:40,936 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix031.opt.i
[2024-06-03 21:45:40,950 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 21:45:40,950 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-06-03 21:45:40,950 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 21:45:41,063 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 21:45:41,092 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 76 flow
[2024-06-03 21:45:41,131 INFO  L124   PetriNetUnfolderBase]: 0/32 cut-off events.
[2024-06-03 21:45:41,132 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:45:41,133 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 21:45:41,133 INFO  L82        GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 76 flow
[2024-06-03 21:45:41,136 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 58 flow
[2024-06-03 21:45:41,146 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 21:45:41,152 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;@42d1622d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 21:45:41,153 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2024-06-03 21:45:41,160 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 21:45:41,160 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-03 21:45:41,160 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:45:41,161 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:45:41,161 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 21:45:41,162 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:45:41,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:45:41,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1705962069, now seen corresponding path program 1 times
[2024-06-03 21:45:41,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:45:41,178 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457577729]
[2024-06-03 21:45:41,178 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:45:41,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:45:41,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:45:47,640 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:45:47,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:45:47,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457577729]
[2024-06-03 21:45:47,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457577729] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:45:47,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:45:47,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 21:45:47,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955662301]
[2024-06-03 21:45:47,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:45:47,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 21:45:47,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:45:47,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 21:45:47,678 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 21:45:47,761 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 34
[2024-06-03 21:45:47,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 58 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:45:47,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:45:47,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 34
[2024-06-03 21:45:47,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:45:48,020 INFO  L124   PetriNetUnfolderBase]: 162/327 cut-off events.
[2024-06-03 21:45:48,020 INFO  L125   PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES.
[2024-06-03 21:45:48,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 640 conditions, 327 events. 162/327 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1327 event pairs, 97 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 626. Up to 288 conditions per place. 
[2024-06-03 21:45:48,025 INFO  L140   encePairwiseOnDemand]: 29/34 looper letters, 23 selfloop transitions, 3 changer transitions 0/32 dead transitions.
[2024-06-03 21:45:48,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 125 flow
[2024-06-03 21:45:48,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 21:45:48,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 21:45:48,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions.
[2024-06-03 21:45:48,034 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5980392156862745
[2024-06-03 21:45:48,035 INFO  L175             Difference]: Start difference. First operand has 33 places, 26 transitions, 58 flow. Second operand 3 states and 61 transitions.
[2024-06-03 21:45:48,036 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 125 flow
[2024-06-03 21:45:48,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-06-03 21:45:48,039 INFO  L231             Difference]: Finished difference. Result has 34 places, 28 transitions, 77 flow
[2024-06-03 21:45:48,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=28}
[2024-06-03 21:45:48,042 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places.
[2024-06-03 21:45:48,042 INFO  L495      AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 77 flow
[2024-06-03 21:45:48,043 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:45:48,043 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:45:48,043 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:45:48,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 21:45:48,043 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:45:48,044 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:45:48,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -1247929228, now seen corresponding path program 1 times
[2024-06-03 21:45:48,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:45:48,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928712166]
[2024-06-03 21:45:48,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:45:48,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:45:48,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:45:52,687 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:45:52,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:45:52,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928712166]
[2024-06-03 21:45:52,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928712166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:45:52,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:45:52,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 21:45:52,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771726246]
[2024-06-03 21:45:52,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:45:52,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 21:45:52,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:45:52,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 21:45:52,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 21:45:52,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34
[2024-06-03 21:45:52,764 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 77 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:45:52,764 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:45:52,764 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34
[2024-06-03 21:45:52,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:45:53,054 INFO  L124   PetriNetUnfolderBase]: 186/357 cut-off events.
[2024-06-03 21:45:53,054 INFO  L125   PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES.
[2024-06-03 21:45:53,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 801 conditions, 357 events. 186/357 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1447 event pairs, 94 based on Foata normal form. 2/353 useless extension candidates. Maximal degree in co-relation 786. Up to 319 conditions per place. 
[2024-06-03 21:45:53,057 INFO  L140   encePairwiseOnDemand]: 28/34 looper letters, 28 selfloop transitions, 5 changer transitions 0/38 dead transitions.
[2024-06-03 21:45:53,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 169 flow
[2024-06-03 21:45:53,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 21:45:53,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 21:45:53,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions.
[2024-06-03 21:45:53,059 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5514705882352942
[2024-06-03 21:45:53,059 INFO  L175             Difference]: Start difference. First operand has 34 places, 28 transitions, 77 flow. Second operand 4 states and 75 transitions.
[2024-06-03 21:45:53,059 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 169 flow
[2024-06-03 21:45:53,060 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 21:45:53,060 INFO  L231             Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow
[2024-06-03 21:45:53,061 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30}
[2024-06-03 21:45:53,061 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places.
[2024-06-03 21:45:53,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow
[2024-06-03 21:45:53,062 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:45:53,062 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:45:53,062 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:45:53,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 21:45:53,062 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:45:53,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:45:53,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -31099420, now seen corresponding path program 1 times
[2024-06-03 21:45:53,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:45:53,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807047617]
[2024-06-03 21:45:53,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:45:53,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:45:53,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:45:57,697 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:45:57,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:45:57,697 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807047617]
[2024-06-03 21:45:57,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807047617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:45:57,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:45:57,698 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 21:45:57,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696856925]
[2024-06-03 21:45:57,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:45:57,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 21:45:57,699 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:45:57,699 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 21:45:57,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2024-06-03 21:45:57,805 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:45:57,805 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:45:57,805 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:45:57,806 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:45:57,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:45:58,192 INFO  L124   PetriNetUnfolderBase]: 219/413 cut-off events.
[2024-06-03 21:45:58,192 INFO  L125   PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES.
[2024-06-03 21:45:58,194 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 413 events. 219/413 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1641 event pairs, 99 based on Foata normal form. 2/411 useless extension candidates. Maximal degree in co-relation 1004. Up to 366 conditions per place. 
[2024-06-03 21:45:58,195 INFO  L140   encePairwiseOnDemand]: 27/34 looper letters, 33 selfloop transitions, 7 changer transitions 0/44 dead transitions.
[2024-06-03 21:45:58,195 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 219 flow
[2024-06-03 21:45:58,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:45:58,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:45:58,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions.
[2024-06-03 21:45:58,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5117647058823529
[2024-06-03 21:45:58,200 INFO  L175             Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 5 states and 87 transitions.
[2024-06-03 21:45:58,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 219 flow
[2024-06-03 21:45:58,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-06-03 21:45:58,202 INFO  L231             Difference]: Finished difference. Result has 40 places, 32 transitions, 125 flow
[2024-06-03 21:45:58,202 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=32}
[2024-06-03 21:45:58,203 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2024-06-03 21:45:58,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 125 flow
[2024-06-03 21:45:58,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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:45:58,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:45:58,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:45:58,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 21:45:58,204 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:45:58,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:45:58,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -964081005, now seen corresponding path program 1 times
[2024-06-03 21:45:58,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:45:58,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273790496]
[2024-06-03 21:45:58,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:45:58,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:45:58,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:03,539 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:46:03,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:03,544 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273790496]
[2024-06-03 21:46:03,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273790496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:03,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:03,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:46:03,545 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425174102]
[2024-06-03 21:46:03,545 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:03,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:46:03,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:03,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:46:03,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:46:03,665 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:46:03,665 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 125 flow. Second operand  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:46:03,666 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:03,666 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:46:03,666 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:03,935 INFO  L124   PetriNetUnfolderBase]: 216/410 cut-off events.
[2024-06-03 21:46:03,935 INFO  L125   PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES.
[2024-06-03 21:46:03,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 410 events. 216/410 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1604 event pairs, 78 based on Foata normal form. 2/408 useless extension candidates. Maximal degree in co-relation 1084. Up to 352 conditions per place. 
[2024-06-03 21:46:03,938 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 9 changer transitions 0/50 dead transitions.
[2024-06-03 21:46:03,938 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 267 flow
[2024-06-03 21:46:03,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:46:03,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:46:03,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-03 21:46:03,941 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-03 21:46:03,941 INFO  L175             Difference]: Start difference. First operand has 40 places, 32 transitions, 125 flow. Second operand 6 states and 102 transitions.
[2024-06-03 21:46:03,941 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 267 flow
[2024-06-03 21:46:03,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-06-03 21:46:03,943 INFO  L231             Difference]: Finished difference. Result has 43 places, 34 transitions, 149 flow
[2024-06-03 21:46:03,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=34}
[2024-06-03 21:46:03,944 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places.
[2024-06-03 21:46:03,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 149 flow
[2024-06-03 21:46:03,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states 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:46:03,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:03,944 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:03,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 21:46:03,945 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:03,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:03,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 176477025, now seen corresponding path program 1 times
[2024-06-03 21:46:03,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:03,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502697220]
[2024-06-03 21:46:03,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:03,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:03,993 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:10,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 21:46:10,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:10,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502697220]
[2024-06-03 21:46:10,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502697220] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:10,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:10,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:46:10,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863147011]
[2024-06-03 21:46:10,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:10,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:46:10,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:10,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:46:10,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:46:10,454 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:46:10,455 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 149 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:46:10,455 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:10,455 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:46:10,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:10,889 INFO  L124   PetriNetUnfolderBase]: 213/404 cut-off events.
[2024-06-03 21:46:10,890 INFO  L125   PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES.
[2024-06-03 21:46:10,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1170 conditions, 404 events. 213/404 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1568 event pairs, 57 based on Foata normal form. 2/401 useless extension candidates. Maximal degree in co-relation 1151. Up to 338 conditions per place. 
[2024-06-03 21:46:10,892 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 41 selfloop transitions, 11 changer transitions 0/56 dead transitions.
[2024-06-03 21:46:10,892 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 315 flow
[2024-06-03 21:46:10,892 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:46:10,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:46:10,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-03 21:46:10,893 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49159663865546216
[2024-06-03 21:46:10,894 INFO  L175             Difference]: Start difference. First operand has 43 places, 34 transitions, 149 flow. Second operand 7 states and 117 transitions.
[2024-06-03 21:46:10,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 315 flow
[2024-06-03 21:46:10,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 294 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-03 21:46:10,896 INFO  L231             Difference]: Finished difference. Result has 46 places, 36 transitions, 173 flow
[2024-06-03 21:46:10,896 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=173, PETRI_PLACES=46, PETRI_TRANSITIONS=36}
[2024-06-03 21:46:10,897 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places.
[2024-06-03 21:46:10,897 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 173 flow
[2024-06-03 21:46:10,897 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:46:10,897 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:10,897 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:10,897 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 21:46:10,898 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:10,898 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:10,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -349451833, now seen corresponding path program 1 times
[2024-06-03 21:46:10,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:10,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984779825]
[2024-06-03 21:46:10,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:10,899 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:10,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:20,899 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:46:20,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:20,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984779825]
[2024-06-03 21:46:20,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984779825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:20,900 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:20,900 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:46:20,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095164894]
[2024-06-03 21:46:20,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:20,901 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:46:20,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:20,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:46:20,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:46:21,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34
[2024-06-03 21:46:21,016 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 173 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:46:21,016 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:21,016 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34
[2024-06-03 21:46:21,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:21,300 INFO  L124   PetriNetUnfolderBase]: 165/350 cut-off events.
[2024-06-03 21:46:21,300 INFO  L125   PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES.
[2024-06-03 21:46:21,301 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 350 events. 165/350 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1427 event pairs, 46 based on Foata normal form. 1/346 useless extension candidates. Maximal degree in co-relation 1032. Up to 291 conditions per place. 
[2024-06-03 21:46:21,302 INFO  L140   encePairwiseOnDemand]: 28/34 looper letters, 30 selfloop transitions, 6 changer transitions 0/43 dead transitions.
[2024-06-03 21:46:21,302 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 263 flow
[2024-06-03 21:46:21,303 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:46:21,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:46:21,303 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions.
[2024-06-03 21:46:21,304 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47058823529411764
[2024-06-03 21:46:21,304 INFO  L175             Difference]: Start difference. First operand has 46 places, 36 transitions, 173 flow. Second operand 5 states and 80 transitions.
[2024-06-03 21:46:21,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 263 flow
[2024-06-03 21:46:21,305 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 236 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 21:46:21,306 INFO  L231             Difference]: Finished difference. Result has 46 places, 38 transitions, 173 flow
[2024-06-03 21:46:21,306 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=46, PETRI_TRANSITIONS=38}
[2024-06-03 21:46:21,307 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places.
[2024-06-03 21:46:21,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 173 flow
[2024-06-03 21:46:21,307 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:46:21,307 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:21,307 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:21,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 21:46:21,308 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:21,308 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:21,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 2068876627, now seen corresponding path program 1 times
[2024-06-03 21:46:21,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:21,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890488107]
[2024-06-03 21:46:21,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:21,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:21,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:31,225 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:46:31,225 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:31,225 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890488107]
[2024-06-03 21:46:31,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890488107] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:31,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:31,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:46:31,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746340261]
[2024-06-03 21:46:31,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:31,226 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:46:31,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:31,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:46:31,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:46:31,373 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:46:31,373 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 173 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:46:31,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:31,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:46:31,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:31,633 INFO  L124   PetriNetUnfolderBase]: 191/384 cut-off events.
[2024-06-03 21:46:31,633 INFO  L125   PetriNetUnfolderBase]: For 994/994 co-relation queries the response was YES.
[2024-06-03 21:46:31,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 384 events. 191/384 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1551 event pairs, 55 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1204. Up to 335 conditions per place. 
[2024-06-03 21:46:31,636 INFO  L140   encePairwiseOnDemand]: 27/34 looper letters, 32 selfloop transitions, 8 changer transitions 0/46 dead transitions.
[2024-06-03 21:46:31,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 275 flow
[2024-06-03 21:46:31,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:46:31,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:46:31,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions.
[2024-06-03 21:46:31,638 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43137254901960786
[2024-06-03 21:46:31,638 INFO  L175             Difference]: Start difference. First operand has 46 places, 38 transitions, 173 flow. Second operand 6 states and 88 transitions.
[2024-06-03 21:46:31,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 275 flow
[2024-06-03 21:46:31,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 46 transitions, 264 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-06-03 21:46:31,641 INFO  L231             Difference]: Finished difference. Result has 49 places, 40 transitions, 195 flow
[2024-06-03 21:46:31,642 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=40}
[2024-06-03 21:46:31,643 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places.
[2024-06-03 21:46:31,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 195 flow
[2024-06-03 21:46:31,643 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:46:31,643 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:31,643 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:31,643 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 21:46:31,644 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:31,644 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:31,644 INFO  L85        PathProgramCache]: Analyzing trace with hash -823368730, now seen corresponding path program 1 times
[2024-06-03 21:46:31,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:31,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637190807]
[2024-06-03 21:46:31,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:31,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:31,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:41,358 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:46:41,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:41,359 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637190807]
[2024-06-03 21:46:41,359 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637190807] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:41,359 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:41,359 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:46:41,359 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119281902]
[2024-06-03 21:46:41,359 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:41,360 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:46:41,360 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:41,360 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:46:41,360 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:46:41,452 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:46:41,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 195 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:46:41,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:41,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:46:41,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:41,829 INFO  L124   PetriNetUnfolderBase]: 209/405 cut-off events.
[2024-06-03 21:46:41,830 INFO  L125   PetriNetUnfolderBase]: For 1514/1514 co-relation queries the response was YES.
[2024-06-03 21:46:41,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 405 events. 209/405 cut-off events. For 1514/1514 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1625 event pairs, 61 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1391. Up to 348 conditions per place. 
[2024-06-03 21:46:41,833 INFO  L140   encePairwiseOnDemand]: 27/34 looper letters, 36 selfloop transitions, 8 changer transitions 0/51 dead transitions.
[2024-06-03 21:46:41,833 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 313 flow
[2024-06-03 21:46:41,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:46:41,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:46:41,834 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions.
[2024-06-03 21:46:41,835 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44607843137254904
[2024-06-03 21:46:41,835 INFO  L175             Difference]: Start difference. First operand has 49 places, 40 transitions, 195 flow. Second operand 6 states and 91 transitions.
[2024-06-03 21:46:41,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 313 flow
[2024-06-03 21:46:41,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 296 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-03 21:46:41,839 INFO  L231             Difference]: Finished difference. Result has 51 places, 42 transitions, 211 flow
[2024-06-03 21:46:41,841 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=51, PETRI_TRANSITIONS=42}
[2024-06-03 21:46:41,844 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places.
[2024-06-03 21:46:41,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 211 flow
[2024-06-03 21:46:41,845 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:46:41,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:41,845 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:41,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 21:46:41,845 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:41,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:41,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 2090730976, now seen corresponding path program 1 times
[2024-06-03 21:46:41,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:41,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021053769]
[2024-06-03 21:46:41,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:41,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:41,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:48,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:46:48,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:48,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021053769]
[2024-06-03 21:46:48,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021053769] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:48,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:48,853 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:46:48,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387777945]
[2024-06-03 21:46:48,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:48,854 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:46:48,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:48,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:46:48,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:46:48,996 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:46:48,996 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 211 flow. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:46:48,996 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:48,996 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:46:48,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:49,510 INFO  L124   PetriNetUnfolderBase]: 223/415 cut-off events.
[2024-06-03 21:46:49,510 INFO  L125   PetriNetUnfolderBase]: For 1864/1864 co-relation queries the response was YES.
[2024-06-03 21:46:49,511 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 415 events. 223/415 cut-off events. For 1864/1864 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1576 event pairs, 39 based on Foata normal form. 4/419 useless extension candidates. Maximal degree in co-relation 1492. Up to 327 conditions per place. 
[2024-06-03 21:46:49,513 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 46 selfloop transitions, 12 changer transitions 0/63 dead transitions.
[2024-06-03 21:46:49,513 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 369 flow
[2024-06-03 21:46:49,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:46:49,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:46:49,514 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions.
[2024-06-03 21:46:49,514 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46691176470588236
[2024-06-03 21:46:49,514 INFO  L175             Difference]: Start difference. First operand has 51 places, 42 transitions, 211 flow. Second operand 8 states and 127 transitions.
[2024-06-03 21:46:49,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 369 flow
[2024-06-03 21:46:49,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 352 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-03 21:46:49,517 INFO  L231             Difference]: Finished difference. Result has 54 places, 41 transitions, 210 flow
[2024-06-03 21:46:49,517 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=210, PETRI_PLACES=54, PETRI_TRANSITIONS=41}
[2024-06-03 21:46:49,518 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places.
[2024-06-03 21:46:49,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 210 flow
[2024-06-03 21:46:49,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:46:49,518 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:49,518 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:49,518 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 21:46:49,519 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:49,519 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:49,519 INFO  L85        PathProgramCache]: Analyzing trace with hash -815750170, now seen corresponding path program 2 times
[2024-06-03 21:46:49,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:49,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220908482]
[2024-06-03 21:46:49,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:49,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:49,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:59,480 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:46:59,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:59,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220908482]
[2024-06-03 21:46:59,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220908482] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:59,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:59,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:46:59,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975660187]
[2024-06-03 21:46:59,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:59,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:46:59,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:59,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:46:59,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:46:59,592 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:46:59,592 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 210 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:46:59,592 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:59,593 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:46:59,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:59,943 INFO  L124   PetriNetUnfolderBase]: 204/395 cut-off events.
[2024-06-03 21:46:59,943 INFO  L125   PetriNetUnfolderBase]: For 2203/2203 co-relation queries the response was YES.
[2024-06-03 21:46:59,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 395 events. 204/395 cut-off events. For 2203/2203 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1533 event pairs, 58 based on Foata normal form. 1/396 useless extension candidates. Maximal degree in co-relation 1483. Up to 332 conditions per place. 
[2024-06-03 21:46:59,946 INFO  L140   encePairwiseOnDemand]: 27/34 looper letters, 34 selfloop transitions, 12 changer transitions 0/53 dead transitions.
[2024-06-03 21:46:59,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 338 flow
[2024-06-03 21:46:59,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:46:59,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:46:59,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions.
[2024-06-03 21:46:59,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4327731092436975
[2024-06-03 21:46:59,948 INFO  L175             Difference]: Start difference. First operand has 54 places, 41 transitions, 210 flow. Second operand 7 states and 103 transitions.
[2024-06-03 21:46:59,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 53 transitions, 338 flow
[2024-06-03 21:46:59,949 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 306 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-03 21:46:59,950 INFO  L231             Difference]: Finished difference. Result has 55 places, 43 transitions, 223 flow
[2024-06-03 21:46:59,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=223, PETRI_PLACES=55, PETRI_TRANSITIONS=43}
[2024-06-03 21:46:59,951 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places.
[2024-06-03 21:46:59,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 223 flow
[2024-06-03 21:46:59,951 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:46:59,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:59,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:59,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 21:46:59,951 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:46:59,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:59,952 INFO  L85        PathProgramCache]: Analyzing trace with hash -289333280, now seen corresponding path program 1 times
[2024-06-03 21:46:59,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:59,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322408146]
[2024-06-03 21:46:59,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:59,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:59,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:10,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:10,084 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:10,084 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322408146]
[2024-06-03 21:47:10,086 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322408146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:10,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:10,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:47:10,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504282692]
[2024-06-03 21:47:10,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:10,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:47:10,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:10,088 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:47:10,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:47:10,244 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34
[2024-06-03 21:47:10,245 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 223 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:47:10,245 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:10,245 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34
[2024-06-03 21:47:10,245 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:10,546 INFO  L124   PetriNetUnfolderBase]: 188/371 cut-off events.
[2024-06-03 21:47:10,546 INFO  L125   PetriNetUnfolderBase]: For 2128/2128 co-relation queries the response was YES.
[2024-06-03 21:47:10,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 371 events. 188/371 cut-off events. For 2128/2128 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1460 event pairs, 49 based on Foata normal form. 1/372 useless extension candidates. Maximal degree in co-relation 1397. Up to 323 conditions per place. 
[2024-06-03 21:47:10,548 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 36 selfloop transitions, 10 changer transitions 0/52 dead transitions.
[2024-06-03 21:47:10,548 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 341 flow
[2024-06-03 21:47:10,549 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:47:10,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:47:10,549 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions.
[2024-06-03 21:47:10,549 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41596638655462187
[2024-06-03 21:47:10,550 INFO  L175             Difference]: Start difference. First operand has 55 places, 43 transitions, 223 flow. Second operand 7 states and 99 transitions.
[2024-06-03 21:47:10,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 341 flow
[2024-06-03 21:47:10,552 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 312 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 21:47:10,552 INFO  L231             Difference]: Finished difference. Result has 57 places, 45 transitions, 233 flow
[2024-06-03 21:47:10,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=57, PETRI_TRANSITIONS=45}
[2024-06-03 21:47:10,553 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places.
[2024-06-03 21:47:10,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 233 flow
[2024-06-03 21:47:10,553 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:47:10,553 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:10,553 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:10,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 21:47:10,553 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:47:10,554 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:10,554 INFO  L85        PathProgramCache]: Analyzing trace with hash 245194100, now seen corresponding path program 1 times
[2024-06-03 21:47:10,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:10,555 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24015212]
[2024-06-03 21:47:10,555 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:10,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:10,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:20,335 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:47:20,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:20,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24015212]
[2024-06-03 21:47:20,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24015212] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:20,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:20,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:47:20,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020662252]
[2024-06-03 21:47:20,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:20,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:47:20,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:20,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:47:20,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:47:20,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:47:20,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 233 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:20,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:20,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:47:20,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:20,849 INFO  L124   PetriNetUnfolderBase]: 220/411 cut-off events.
[2024-06-03 21:47:20,850 INFO  L125   PetriNetUnfolderBase]: For 2980/2980 co-relation queries the response was YES.
[2024-06-03 21:47:20,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 411 events. 220/411 cut-off events. For 2980/2980 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1556 event pairs, 55 based on Foata normal form. 1/412 useless extension candidates. Maximal degree in co-relation 1642. Up to 356 conditions per place. 
[2024-06-03 21:47:20,853 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 10 changer transitions 0/60 dead transitions.
[2024-06-03 21:47:20,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 387 flow
[2024-06-03 21:47:20,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:47:20,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:47:20,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions.
[2024-06-03 21:47:20,854 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41596638655462187
[2024-06-03 21:47:20,854 INFO  L175             Difference]: Start difference. First operand has 57 places, 45 transitions, 233 flow. Second operand 7 states and 99 transitions.
[2024-06-03 21:47:20,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 387 flow
[2024-06-03 21:47:20,856 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 60 transitions, 364 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-03 21:47:20,861 INFO  L231             Difference]: Finished difference. Result has 59 places, 47 transitions, 251 flow
[2024-06-03 21:47:20,861 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=47}
[2024-06-03 21:47:20,862 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places.
[2024-06-03 21:47:20,862 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 251 flow
[2024-06-03 21:47:20,862 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:20,862 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:20,862 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:20,862 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 21:47:20,862 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:47:20,863 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:20,863 INFO  L85        PathProgramCache]: Analyzing trace with hash -387978374, now seen corresponding path program 2 times
[2024-06-03 21:47:20,863 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:20,863 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968601344]
[2024-06-03 21:47:20,863 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:20,863 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:20,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:30,871 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:47:30,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:30,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968601344]
[2024-06-03 21:47:30,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968601344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:30,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:30,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:47:30,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772846511]
[2024-06-03 21:47:30,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:30,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:47:30,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:30,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:47:30,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:47:31,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:47:31,025 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 251 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:31,025 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:31,025 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:47:31,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:31,399 INFO  L124   PetriNetUnfolderBase]: 223/416 cut-off events.
[2024-06-03 21:47:31,399 INFO  L125   PetriNetUnfolderBase]: For 3488/3488 co-relation queries the response was YES.
[2024-06-03 21:47:31,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 416 events. 223/416 cut-off events. For 3488/3488 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1571 event pairs, 55 based on Foata normal form. 1/417 useless extension candidates. Maximal degree in co-relation 1740. Up to 355 conditions per place. 
[2024-06-03 21:47:31,402 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 41 selfloop transitions, 13 changer transitions 0/59 dead transitions.
[2024-06-03 21:47:31,402 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 399 flow
[2024-06-03 21:47:31,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:47:31,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:47:31,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions.
[2024-06-03 21:47:31,403 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4117647058823529
[2024-06-03 21:47:31,403 INFO  L175             Difference]: Start difference. First operand has 59 places, 47 transitions, 251 flow. Second operand 7 states and 98 transitions.
[2024-06-03 21:47:31,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 399 flow
[2024-06-03 21:47:31,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 374 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 21:47:31,406 INFO  L231             Difference]: Finished difference. Result has 61 places, 49 transitions, 277 flow
[2024-06-03 21:47:31,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=61, PETRI_TRANSITIONS=49}
[2024-06-03 21:47:31,406 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places.
[2024-06-03 21:47:31,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 277 flow
[2024-06-03 21:47:31,407 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:31,407 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:31,407 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:31,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 21:47:31,407 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:47:31,407 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:31,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 245373838, now seen corresponding path program 1 times
[2024-06-03 21:47:31,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:31,408 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637720242]
[2024-06-03 21:47:31,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:31,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:31,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:41,212 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:47:41,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:41,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637720242]
[2024-06-03 21:47:41,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637720242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:41,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:41,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:47:41,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737865643]
[2024-06-03 21:47:41,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:41,213 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:47:41,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:41,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:47:41,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:47:41,335 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:47:41,336 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 277 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:41,336 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:41,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:47:41,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:41,763 INFO  L124   PetriNetUnfolderBase]: 226/421 cut-off events.
[2024-06-03 21:47:41,764 INFO  L125   PetriNetUnfolderBase]: For 4005/4005 co-relation queries the response was YES.
[2024-06-03 21:47:41,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 421 events. 226/421 cut-off events. For 4005/4005 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 56 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 1815. Up to 375 conditions per place. 
[2024-06-03 21:47:41,772 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 44 selfloop transitions, 10 changer transitions 0/61 dead transitions.
[2024-06-03 21:47:41,772 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 421 flow
[2024-06-03 21:47:41,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:47:41,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:47:41,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions.
[2024-06-03 21:47:41,773 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40336134453781514
[2024-06-03 21:47:41,773 INFO  L175             Difference]: Start difference. First operand has 61 places, 49 transitions, 277 flow. Second operand 7 states and 96 transitions.
[2024-06-03 21:47:41,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 421 flow
[2024-06-03 21:47:41,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 386 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-03 21:47:41,776 INFO  L231             Difference]: Finished difference. Result has 63 places, 51 transitions, 283 flow
[2024-06-03 21:47:41,777 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=63, PETRI_TRANSITIONS=51}
[2024-06-03 21:47:41,777 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places.
[2024-06-03 21:47:41,777 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 283 flow
[2024-06-03 21:47:41,778 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:41,778 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:41,778 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:41,778 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 21:47:41,778 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:47:41,778 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:41,779 INFO  L85        PathProgramCache]: Analyzing trace with hash -379704164, now seen corresponding path program 3 times
[2024-06-03 21:47:41,779 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:41,779 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936650090]
[2024-06-03 21:47:41,779 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:41,779 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:41,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:51,622 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:47:51,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:51,622 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936650090]
[2024-06-03 21:47:51,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936650090] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:51,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:51,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:47:51,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678694532]
[2024-06-03 21:47:51,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:51,623 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:47:51,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:51,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:47:51,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:47:51,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:47:51,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 283 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:51,762 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:51,762 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:47:51,762 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:52,168 INFO  L124   PetriNetUnfolderBase]: 226/420 cut-off events.
[2024-06-03 21:47:52,168 INFO  L125   PetriNetUnfolderBase]: For 4607/4607 co-relation queries the response was YES.
[2024-06-03 21:47:52,170 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 420 events. 226/420 cut-off events. For 4607/4607 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1588 event pairs, 54 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1885. Up to 348 conditions per place. 
[2024-06-03 21:47:52,172 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 40 selfloop transitions, 18 changer transitions 0/64 dead transitions.
[2024-06-03 21:47:52,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 445 flow
[2024-06-03 21:47:52,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:47:52,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:47:52,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions.
[2024-06-03 21:47:52,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40441176470588236
[2024-06-03 21:47:52,174 INFO  L175             Difference]: Start difference. First operand has 63 places, 51 transitions, 283 flow. Second operand 8 states and 110 transitions.
[2024-06-03 21:47:52,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 64 transitions, 445 flow
[2024-06-03 21:47:52,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 420 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 21:47:52,178 INFO  L231             Difference]: Finished difference. Result has 66 places, 53 transitions, 323 flow
[2024-06-03 21:47:52,178 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=323, PETRI_PLACES=66, PETRI_TRANSITIONS=53}
[2024-06-03 21:47:52,180 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places.
[2024-06-03 21:47:52,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 323 flow
[2024-06-03 21:47:52,181 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:47:52,181 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:52,181 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:52,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 21:47:52,181 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:47:52,182 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:52,182 INFO  L85        PathProgramCache]: Analyzing trace with hash -379703916, now seen corresponding path program 2 times
[2024-06-03 21:47:52,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:52,182 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697161968]
[2024-06-03 21:47:52,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:52,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:52,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:02,575 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:48:02,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:02,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697161968]
[2024-06-03 21:48:02,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697161968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:02,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:02,576 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:02,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635317329]
[2024-06-03 21:48:02,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:02,576 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:02,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:02,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:02,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:02,685 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:48:02,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 323 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:48:02,686 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:02,686 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:48:02,686 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:03,084 INFO  L124   PetriNetUnfolderBase]: 227/423 cut-off events.
[2024-06-03 21:48:03,085 INFO  L125   PetriNetUnfolderBase]: For 5107/5107 co-relation queries the response was YES.
[2024-06-03 21:48:03,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 423 events. 227/423 cut-off events. For 5107/5107 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1634 event pairs, 56 based on Foata normal form. 1/424 useless extension candidates. Maximal degree in co-relation 1952. Up to 362 conditions per place. 
[2024-06-03 21:48:03,087 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 43 selfloop transitions, 18 changer transitions 0/69 dead transitions.
[2024-06-03 21:48:03,088 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 535 flow
[2024-06-03 21:48:03,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:48:03,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:48:03,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions.
[2024-06-03 21:48:03,089 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40808823529411764
[2024-06-03 21:48:03,089 INFO  L175             Difference]: Start difference. First operand has 66 places, 53 transitions, 323 flow. Second operand 8 states and 111 transitions.
[2024-06-03 21:48:03,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 535 flow
[2024-06-03 21:48:03,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 486 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-03 21:48:03,093 INFO  L231             Difference]: Finished difference. Result has 68 places, 57 transitions, 351 flow
[2024-06-03 21:48:03,093 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=351, PETRI_PLACES=68, PETRI_TRANSITIONS=57}
[2024-06-03 21:48:03,094 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 35 predicate places.
[2024-06-03 21:48:03,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 351 flow
[2024-06-03 21:48:03,097 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:48:03,097 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:03,097 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:03,097 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 21:48:03,097 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:48:03,098 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:03,098 INFO  L85        PathProgramCache]: Analyzing trace with hash 481845868, now seen corresponding path program 3 times
[2024-06-03 21:48:03,098 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:03,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922453150]
[2024-06-03 21:48:03,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:03,098 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:03,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:13,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:13,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:13,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922453150]
[2024-06-03 21:48:13,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922453150] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:13,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:13,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:13,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732389838]
[2024-06-03 21:48:13,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:13,236 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:13,237 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:13,237 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:13,237 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:13,393 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:48:13,393 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 351 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:48:13,393 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:13,393 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:48:13,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:13,763 INFO  L124   PetriNetUnfolderBase]: 225/420 cut-off events.
[2024-06-03 21:48:13,764 INFO  L125   PetriNetUnfolderBase]: For 5695/5695 co-relation queries the response was YES.
[2024-06-03 21:48:13,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 420 events. 225/420 cut-off events. For 5695/5695 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1624 event pairs, 56 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1987. Up to 360 conditions per place. 
[2024-06-03 21:48:13,767 INFO  L140   encePairwiseOnDemand]: 26/34 looper letters, 41 selfloop transitions, 19 changer transitions 0/68 dead transitions.
[2024-06-03 21:48:13,767 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 68 transitions, 497 flow
[2024-06-03 21:48:13,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:48:13,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:48:13,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions.
[2024-06-03 21:48:13,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4007352941176471
[2024-06-03 21:48:13,768 INFO  L175             Difference]: Start difference. First operand has 68 places, 57 transitions, 351 flow. Second operand 8 states and 109 transitions.
[2024-06-03 21:48:13,768 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 68 transitions, 497 flow
[2024-06-03 21:48:13,771 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 459 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-03 21:48:13,772 INFO  L231             Difference]: Finished difference. Result has 72 places, 57 transitions, 356 flow
[2024-06-03 21:48:13,772 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=72, PETRI_TRANSITIONS=57}
[2024-06-03 21:48:13,772 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places.
[2024-06-03 21:48:13,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 356 flow
[2024-06-03 21:48:13,773 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:48:13,773 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:13,773 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:13,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 21:48:13,773 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:48:13,774 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:13,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 871269377, now seen corresponding path program 1 times
[2024-06-03 21:48:13,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:13,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588232402]
[2024-06-03 21:48:13,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:13,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:13,816 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:22,298 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:48:22,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:22,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588232402]
[2024-06-03 21:48:22,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588232402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:22,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:22,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:22,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219387179]
[2024-06-03 21:48:22,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:22,299 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:22,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:22,300 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:22,300 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:22,426 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:48:22,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 356 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 21:48:22,426 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:22,426 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:48:22,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:22,756 INFO  L124   PetriNetUnfolderBase]: 245/457 cut-off events.
[2024-06-03 21:48:22,756 INFO  L125   PetriNetUnfolderBase]: For 6843/6843 co-relation queries the response was YES.
[2024-06-03 21:48:22,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2251 conditions, 457 events. 245/457 cut-off events. For 6843/6843 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1795 event pairs, 106 based on Foata normal form. 2/458 useless extension candidates. Maximal degree in co-relation 2217. Up to 395 conditions per place. 
[2024-06-03 21:48:22,759 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 56 selfloop transitions, 14 changer transitions 0/78 dead transitions.
[2024-06-03 21:48:22,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 78 transitions, 595 flow
[2024-06-03 21:48:22,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:48:22,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:48:22,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions.
[2024-06-03 21:48:22,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4007352941176471
[2024-06-03 21:48:22,760 INFO  L175             Difference]: Start difference. First operand has 72 places, 57 transitions, 356 flow. Second operand 8 states and 109 transitions.
[2024-06-03 21:48:22,760 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 78 transitions, 595 flow
[2024-06-03 21:48:22,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 546 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-03 21:48:22,765 INFO  L231             Difference]: Finished difference. Result has 77 places, 67 transitions, 437 flow
[2024-06-03 21:48:22,765 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=437, PETRI_PLACES=77, PETRI_TRANSITIONS=67}
[2024-06-03 21:48:22,765 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places.
[2024-06-03 21:48:22,765 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 437 flow
[2024-06-03 21:48:22,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 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 21:48:22,766 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:22,766 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:22,766 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 21:48:22,766 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:48:22,766 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:22,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 1081926461, now seen corresponding path program 2 times
[2024-06-03 21:48:22,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:22,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009880522]
[2024-06-03 21:48:22,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:22,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:22,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:32,405 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:48:32,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:32,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009880522]
[2024-06-03 21:48:32,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009880522] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:32,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:32,406 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:48:32,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122840890]
[2024-06-03 21:48:32,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:32,408 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:48:32,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:32,409 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:48:32,409 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:48:32,551 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:48:32,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 437 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:48:32,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:32,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:48:32,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:32,945 INFO  L124   PetriNetUnfolderBase]: 263/491 cut-off events.
[2024-06-03 21:48:32,946 INFO  L125   PetriNetUnfolderBase]: For 7791/7794 co-relation queries the response was YES.
[2024-06-03 21:48:32,947 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 491 events. 263/491 cut-off events. For 7791/7794 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1983 event pairs, 54 based on Foata normal form. 4/495 useless extension candidates. Maximal degree in co-relation 2467. Up to 393 conditions per place. 
[2024-06-03 21:48:32,949 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 60 selfloop transitions, 24 changer transitions 0/92 dead transitions.
[2024-06-03 21:48:32,949 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 721 flow
[2024-06-03 21:48:32,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:48:32,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:48:32,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions.
[2024-06-03 21:48:32,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4117647058823529
[2024-06-03 21:48:32,950 INFO  L175             Difference]: Start difference. First operand has 77 places, 67 transitions, 437 flow. Second operand 9 states and 126 transitions.
[2024-06-03 21:48:32,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 721 flow
[2024-06-03 21:48:32,954 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 699 flow, removed 7 selfloop flow, removed 1 redundant places.
[2024-06-03 21:48:32,955 INFO  L231             Difference]: Finished difference. Result has 87 places, 76 transitions, 560 flow
[2024-06-03 21:48:32,955 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=560, PETRI_PLACES=87, PETRI_TRANSITIONS=76}
[2024-06-03 21:48:32,956 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places.
[2024-06-03 21:48:32,956 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 560 flow
[2024-06-03 21:48:32,956 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:48:32,956 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:32,956 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:32,956 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 21:48:32,956 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:48:32,956 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:32,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676694463, now seen corresponding path program 3 times
[2024-06-03 21:48:32,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:32,957 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854593557]
[2024-06-03 21:48:32,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:32,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:32,987 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:42,163 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:48:42,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:42,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854593557]
[2024-06-03 21:48:42,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854593557] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:42,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:42,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:48:42,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253729897]
[2024-06-03 21:48:42,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:42,165 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:48:42,165 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:42,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:48:42,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:48:42,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:48:42,304 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 560 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:48:42,304 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:42,305 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:48:42,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:42,734 INFO  L124   PetriNetUnfolderBase]: 269/503 cut-off events.
[2024-06-03 21:48:42,734 INFO  L125   PetriNetUnfolderBase]: For 8855/8855 co-relation queries the response was YES.
[2024-06-03 21:48:42,735 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2704 conditions, 503 events. 269/503 cut-off events. For 8855/8855 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2043 event pairs, 56 based on Foata normal form. 2/505 useless extension candidates. Maximal degree in co-relation 2660. Up to 403 conditions per place. 
[2024-06-03 21:48:42,737 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 63 selfloop transitions, 25 changer transitions 0/96 dead transitions.
[2024-06-03 21:48:42,738 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 96 transitions, 841 flow
[2024-06-03 21:48:42,738 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:48:42,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:48:42,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions.
[2024-06-03 21:48:42,739 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4117647058823529
[2024-06-03 21:48:42,739 INFO  L175             Difference]: Start difference. First operand has 87 places, 76 transitions, 560 flow. Second operand 9 states and 126 transitions.
[2024-06-03 21:48:42,739 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 96 transitions, 841 flow
[2024-06-03 21:48:42,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 96 transitions, 779 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 21:48:42,746 INFO  L231             Difference]: Finished difference. Result has 95 places, 82 transitions, 649 flow
[2024-06-03 21:48:42,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=649, PETRI_PLACES=95, PETRI_TRANSITIONS=82}
[2024-06-03 21:48:42,746 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 62 predicate places.
[2024-06-03 21:48:42,746 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 649 flow
[2024-06-03 21:48:42,747 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:48:42,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:42,747 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:42,747 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 21:48:42,747 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:48:42,747 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:42,748 INFO  L85        PathProgramCache]: Analyzing trace with hash -1498236729, now seen corresponding path program 4 times
[2024-06-03 21:48:42,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:42,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827667485]
[2024-06-03 21:48:42,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:42,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:42,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:51,975 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:48:51,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:51,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827667485]
[2024-06-03 21:48:51,975 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827667485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:51,976 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:51,976 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:48:51,976 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244890348]
[2024-06-03 21:48:51,976 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:51,977 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:48:51,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:51,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:48:51,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:48:52,104 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:48:52,105 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 649 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:48:52,105 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:52,105 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:48:52,105 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:52,507 INFO  L124   PetriNetUnfolderBase]: 274/512 cut-off events.
[2024-06-03 21:48:52,508 INFO  L125   PetriNetUnfolderBase]: For 10095/10096 co-relation queries the response was YES.
[2024-06-03 21:48:52,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 512 events. 274/512 cut-off events. For 10095/10096 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2126 event pairs, 88 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2804. Up to 412 conditions per place. 
[2024-06-03 21:48:52,534 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 64 selfloop transitions, 29 changer transitions 0/101 dead transitions.
[2024-06-03 21:48:52,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 919 flow
[2024-06-03 21:48:52,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:48:52,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:48:52,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions.
[2024-06-03 21:48:52,536 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4117647058823529
[2024-06-03 21:48:52,536 INFO  L175             Difference]: Start difference. First operand has 95 places, 82 transitions, 649 flow. Second operand 9 states and 126 transitions.
[2024-06-03 21:48:52,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 919 flow
[2024-06-03 21:48:52,543 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 858 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-03 21:48:52,549 INFO  L231             Difference]: Finished difference. Result has 102 places, 85 transitions, 709 flow
[2024-06-03 21:48:52,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=709, PETRI_PLACES=102, PETRI_TRANSITIONS=85}
[2024-06-03 21:48:52,550 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places.
[2024-06-03 21:48:52,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 709 flow
[2024-06-03 21:48:52,550 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:48:52,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:52,550 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:52,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 21:48:52,551 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:48:52,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:52,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -233390598, now seen corresponding path program 1 times
[2024-06-03 21:48:52,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:52,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848884050]
[2024-06-03 21:48:52,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:52,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:52,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:02,408 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:49:02,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:02,408 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848884050]
[2024-06-03 21:49:02,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848884050] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:02,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:02,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:49:02,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727322829]
[2024-06-03 21:49:02,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:02,409 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:49:02,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:02,410 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:49:02,410 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:49:02,550 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:49:02,550 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 709 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:49:02,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:02,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:49:02,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:02,892 INFO  L124   PetriNetUnfolderBase]: 296/539 cut-off events.
[2024-06-03 21:49:02,892 INFO  L125   PetriNetUnfolderBase]: For 10650/10650 co-relation queries the response was YES.
[2024-06-03 21:49:02,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 539 events. 296/539 cut-off events. For 10650/10650 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2172 event pairs, 95 based on Foata normal form. 1/540 useless extension candidates. Maximal degree in co-relation 2990. Up to 482 conditions per place. 
[2024-06-03 21:49:02,896 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 77 selfloop transitions, 22 changer transitions 0/102 dead transitions.
[2024-06-03 21:49:02,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 102 transitions, 967 flow
[2024-06-03 21:49:02,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:49:02,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:49:02,897 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions.
[2024-06-03 21:49:02,897 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37254901960784315
[2024-06-03 21:49:02,897 INFO  L175             Difference]: Start difference. First operand has 102 places, 85 transitions, 709 flow. Second operand 9 states and 114 transitions.
[2024-06-03 21:49:02,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 102 transitions, 967 flow
[2024-06-03 21:49:02,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 888 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-03 21:49:02,905 INFO  L231             Difference]: Finished difference. Result has 106 places, 89 transitions, 716 flow
[2024-06-03 21:49:02,905 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=716, PETRI_PLACES=106, PETRI_TRANSITIONS=89}
[2024-06-03 21:49:02,906 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 73 predicate places.
[2024-06-03 21:49:02,906 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 716 flow
[2024-06-03 21:49:02,906 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:49:02,906 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:02,906 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:02,906 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 21:49:02,906 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:49:02,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:02,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529858171, now seen corresponding path program 5 times
[2024-06-03 21:49:02,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:02,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759082430]
[2024-06-03 21:49:02,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:02,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:02,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:12,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:49:12,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:12,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759082430]
[2024-06-03 21:49:12,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759082430] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:12,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:12,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:49:12,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926479118]
[2024-06-03 21:49:12,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:12,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:49:12,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:12,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:49:12,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:49:13,005 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:49:13,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 716 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:49:13,006 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:13,006 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:49:13,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:13,366 INFO  L124   PetriNetUnfolderBase]: 292/542 cut-off events.
[2024-06-03 21:49:13,367 INFO  L125   PetriNetUnfolderBase]: For 12395/12397 co-relation queries the response was YES.
[2024-06-03 21:49:13,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3128 conditions, 542 events. 292/542 cut-off events. For 12395/12397 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2262 event pairs, 86 based on Foata normal form. 2/541 useless extension candidates. Maximal degree in co-relation 3076. Up to 423 conditions per place. 
[2024-06-03 21:49:13,371 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 65 selfloop transitions, 32 changer transitions 0/106 dead transitions.
[2024-06-03 21:49:13,371 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 106 transitions, 986 flow
[2024-06-03 21:49:13,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:49:13,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:49:13,372 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions.
[2024-06-03 21:49:13,372 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4150326797385621
[2024-06-03 21:49:13,372 INFO  L175             Difference]: Start difference. First operand has 106 places, 89 transitions, 716 flow. Second operand 9 states and 127 transitions.
[2024-06-03 21:49:13,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 106 transitions, 986 flow
[2024-06-03 21:49:13,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 106 transitions, 908 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-03 21:49:13,381 INFO  L231             Difference]: Finished difference. Result has 107 places, 91 transitions, 745 flow
[2024-06-03 21:49:13,381 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=107, PETRI_TRANSITIONS=91}
[2024-06-03 21:49:13,382 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 74 predicate places.
[2024-06-03 21:49:13,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 745 flow
[2024-06-03 21:49:13,382 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:49:13,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:13,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:13,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 21:49:13,383 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:49:13,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:13,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676688883, now seen corresponding path program 6 times
[2024-06-03 21:49:13,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:13,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335389716]
[2024-06-03 21:49:13,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:13,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:13,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:22,837 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:49:22,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:22,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335389716]
[2024-06-03 21:49:22,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335389716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:22,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:22,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:49:22,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741843571]
[2024-06-03 21:49:22,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:22,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:49:22,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:22,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:49:22,838 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:49:22,972 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:49:22,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 745 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:49:22,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:22,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:49:22,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:23,338 INFO  L124   PetriNetUnfolderBase]: 298/555 cut-off events.
[2024-06-03 21:49:23,339 INFO  L125   PetriNetUnfolderBase]: For 13330/13330 co-relation queries the response was YES.
[2024-06-03 21:49:23,340 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 555 events. 298/555 cut-off events. For 13330/13330 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2309 event pairs, 56 based on Foata normal form. 2/557 useless extension candidates. Maximal degree in co-relation 3188. Up to 439 conditions per place. 
[2024-06-03 21:49:23,343 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 71 selfloop transitions, 29 changer transitions 0/109 dead transitions.
[2024-06-03 21:49:23,343 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 109 transitions, 1035 flow
[2024-06-03 21:49:23,343 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:49:23,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:49:23,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions.
[2024-06-03 21:49:23,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41830065359477125
[2024-06-03 21:49:23,344 INFO  L175             Difference]: Start difference. First operand has 107 places, 91 transitions, 745 flow. Second operand 9 states and 128 transitions.
[2024-06-03 21:49:23,344 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 109 transitions, 1035 flow
[2024-06-03 21:49:23,352 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 944 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 21:49:23,353 INFO  L231             Difference]: Finished difference. Result has 110 places, 95 transitions, 781 flow
[2024-06-03 21:49:23,354 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=781, PETRI_PLACES=110, PETRI_TRANSITIONS=95}
[2024-06-03 21:49:23,354 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 77 predicate places.
[2024-06-03 21:49:23,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 95 transitions, 781 flow
[2024-06-03 21:49:23,354 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:49:23,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:23,355 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:23,355 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 21:49:23,355 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:49:23,355 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:23,355 INFO  L85        PathProgramCache]: Analyzing trace with hash 2086509280, now seen corresponding path program 2 times
[2024-06-03 21:49:23,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:23,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604579831]
[2024-06-03 21:49:23,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:23,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:23,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:32,850 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:32,850 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:32,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604579831]
[2024-06-03 21:49:32,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604579831] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:32,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:32,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:49:32,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961200009]
[2024-06-03 21:49:32,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:32,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:49:32,851 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:32,851 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:49:32,851 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:49:32,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:49:32,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 95 transitions, 781 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:49:32,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:32,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:49:32,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:33,332 INFO  L124   PetriNetUnfolderBase]: 314/573 cut-off events.
[2024-06-03 21:49:33,332 INFO  L125   PetriNetUnfolderBase]: For 13980/13980 co-relation queries the response was YES.
[2024-06-03 21:49:33,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 573 events. 314/573 cut-off events. For 13980/13980 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2372 event pairs, 89 based on Foata normal form. 1/574 useless extension candidates. Maximal degree in co-relation 3318. Up to 512 conditions per place. 
[2024-06-03 21:49:33,343 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 85 selfloop transitions, 21 changer transitions 0/109 dead transitions.
[2024-06-03 21:49:33,343 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1047 flow
[2024-06-03 21:49:33,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:49:33,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:49:33,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions.
[2024-06-03 21:49:33,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37254901960784315
[2024-06-03 21:49:33,344 INFO  L175             Difference]: Start difference. First operand has 110 places, 95 transitions, 781 flow. Second operand 9 states and 114 transitions.
[2024-06-03 21:49:33,344 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1047 flow
[2024-06-03 21:49:33,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 960 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 21:49:33,358 INFO  L231             Difference]: Finished difference. Result has 113 places, 97 transitions, 767 flow
[2024-06-03 21:49:33,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=767, PETRI_PLACES=113, PETRI_TRANSITIONS=97}
[2024-06-03 21:49:33,362 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 80 predicate places.
[2024-06-03 21:49:33,362 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 767 flow
[2024-06-03 21:49:33,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:49:33,364 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:33,364 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:33,364 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 21:49:33,365 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:49:33,366 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:33,366 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676479416, now seen corresponding path program 3 times
[2024-06-03 21:49:33,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:33,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491713635]
[2024-06-03 21:49:33,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:33,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:33,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:42,684 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:49:42,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:42,684 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491713635]
[2024-06-03 21:49:42,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491713635] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:42,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:42,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:49:42,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912993587]
[2024-06-03 21:49:42,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:42,685 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:49:42,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:42,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:49:42,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:49:42,856 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:49:42,856 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 767 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:49:42,856 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:42,856 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:49:42,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:43,209 INFO  L124   PetriNetUnfolderBase]: 331/601 cut-off events.
[2024-06-03 21:49:43,210 INFO  L125   PetriNetUnfolderBase]: For 15084/15084 co-relation queries the response was YES.
[2024-06-03 21:49:43,212 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3535 conditions, 601 events. 331/601 cut-off events. For 15084/15084 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2508 event pairs, 91 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 3481. Up to 518 conditions per place. 
[2024-06-03 21:49:43,214 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 83 selfloop transitions, 33 changer transitions 0/119 dead transitions.
[2024-06-03 21:49:43,214 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 119 transitions, 1162 flow
[2024-06-03 21:49:43,215 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:49:43,215 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:49:43,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions.
[2024-06-03 21:49:43,215 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3790849673202614
[2024-06-03 21:49:43,215 INFO  L175             Difference]: Start difference. First operand has 113 places, 97 transitions, 767 flow. Second operand 9 states and 116 transitions.
[2024-06-03 21:49:43,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 119 transitions, 1162 flow
[2024-06-03 21:49:43,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 119 transitions, 1101 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-03 21:49:43,227 INFO  L231             Difference]: Finished difference. Result has 117 places, 106 transitions, 889 flow
[2024-06-03 21:49:43,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=889, PETRI_PLACES=117, PETRI_TRANSITIONS=106}
[2024-06-03 21:49:43,227 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 84 predicate places.
[2024-06-03 21:49:43,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 106 transitions, 889 flow
[2024-06-03 21:49:43,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:49:43,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:43,228 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:43,228 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 21:49:43,228 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:49:43,228 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:43,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676479137, now seen corresponding path program 1 times
[2024-06-03 21:49:43,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:43,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526440606]
[2024-06-03 21:49:43,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:43,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:43,265 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:51,294 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:51,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:51,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526440606]
[2024-06-03 21:49:51,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526440606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:51,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:51,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:49:51,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842515139]
[2024-06-03 21:49:51,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:51,295 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:49:51,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:51,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:49:51,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:49:51,452 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:49:51,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 106 transitions, 889 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:49:51,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:51,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:49:51,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:51,765 INFO  L124   PetriNetUnfolderBase]: 313/581 cut-off events.
[2024-06-03 21:49:51,765 INFO  L125   PetriNetUnfolderBase]: For 16386/16388 co-relation queries the response was YES.
[2024-06-03 21:49:51,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3502 conditions, 581 events. 313/581 cut-off events. For 16386/16388 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2516 event pairs, 98 based on Foata normal form. 3/581 useless extension candidates. Maximal degree in co-relation 3446. Up to 498 conditions per place. 
[2024-06-03 21:49:51,769 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 85 selfloop transitions, 17 changer transitions 0/120 dead transitions.
[2024-06-03 21:49:51,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 120 transitions, 1142 flow
[2024-06-03 21:49:51,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:49:51,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:49:51,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions.
[2024-06-03 21:49:51,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-03 21:49:51,770 INFO  L175             Difference]: Start difference. First operand has 117 places, 106 transitions, 889 flow. Second operand 9 states and 119 transitions.
[2024-06-03 21:49:51,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 120 transitions, 1142 flow
[2024-06-03 21:49:51,781 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 120 transitions, 1099 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-03 21:49:51,783 INFO  L231             Difference]: Finished difference. Result has 123 places, 109 transitions, 915 flow
[2024-06-03 21:49:51,783 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=915, PETRI_PLACES=123, PETRI_TRANSITIONS=109}
[2024-06-03 21:49:51,783 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 90 predicate places.
[2024-06-03 21:49:51,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 109 transitions, 915 flow
[2024-06-03 21:49:51,784 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:49:51,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:51,784 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:51,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 21:49:51,784 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:49:51,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:51,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676487073, now seen corresponding path program 7 times
[2024-06-03 21:49:51,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:51,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191514599]
[2024-06-03 21:49:51,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:51,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:51,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:01,735 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:50:01,735 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:01,736 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191514599]
[2024-06-03 21:50:01,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191514599] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:01,736 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:01,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:01,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864233103]
[2024-06-03 21:50:01,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:01,737 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:01,737 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:01,737 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:01,738 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:01,887 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:50:01,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 109 transitions, 915 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:50:01,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:01,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:50:01,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:02,198 INFO  L124   PetriNetUnfolderBase]: 326/604 cut-off events.
[2024-06-03 21:50:02,198 INFO  L125   PetriNetUnfolderBase]: For 18026/18026 co-relation queries the response was YES.
[2024-06-03 21:50:02,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3785 conditions, 604 events. 326/604 cut-off events. For 18026/18026 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2590 event pairs, 59 based on Foata normal form. 2/606 useless extension candidates. Maximal degree in co-relation 3726. Up to 444 conditions per place. 
[2024-06-03 21:50:02,203 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 71 selfloop transitions, 40 changer transitions 0/124 dead transitions.
[2024-06-03 21:50:02,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 124 transitions, 1215 flow
[2024-06-03 21:50:02,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:50:02,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:50:02,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions.
[2024-06-03 21:50:02,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4150326797385621
[2024-06-03 21:50:02,204 INFO  L175             Difference]: Start difference. First operand has 123 places, 109 transitions, 915 flow. Second operand 9 states and 127 transitions.
[2024-06-03 21:50:02,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 124 transitions, 1215 flow
[2024-06-03 21:50:02,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 124 transitions, 1162 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-03 21:50:02,217 INFO  L231             Difference]: Finished difference. Result has 126 places, 111 transitions, 993 flow
[2024-06-03 21:50:02,217 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=993, PETRI_PLACES=126, PETRI_TRANSITIONS=111}
[2024-06-03 21:50:02,218 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 93 predicate places.
[2024-06-03 21:50:02,218 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 993 flow
[2024-06-03 21:50:02,218 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:50:02,218 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:02,218 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:02,218 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 21:50:02,219 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:50:02,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:02,219 INFO  L85        PathProgramCache]: Analyzing trace with hash -1676486856, now seen corresponding path program 4 times
[2024-06-03 21:50:02,219 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:02,219 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027152392]
[2024-06-03 21:50:02,219 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:02,219 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:02,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:11,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:11,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:11,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027152392]
[2024-06-03 21:50:11,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027152392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:11,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:11,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:11,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562589334]
[2024-06-03 21:50:11,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:11,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:11,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:11,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:11,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:11,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:50:11,738 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 993 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:50:11,738 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:11,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:50:11,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:12,082 INFO  L124   PetriNetUnfolderBase]: 338/616 cut-off events.
[2024-06-03 21:50:12,082 INFO  L125   PetriNetUnfolderBase]: For 18530/18530 co-relation queries the response was YES.
[2024-06-03 21:50:12,085 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3930 conditions, 616 events. 338/616 cut-off events. For 18530/18530 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2604 event pairs, 90 based on Foata normal form. 1/617 useless extension candidates. Maximal degree in co-relation 3871. Up to 531 conditions per place. 
[2024-06-03 21:50:12,086 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 88 selfloop transitions, 31 changer transitions 0/122 dead transitions.
[2024-06-03 21:50:12,087 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 122 transitions, 1259 flow
[2024-06-03 21:50:12,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:50:12,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:50:12,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions.
[2024-06-03 21:50:12,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3790849673202614
[2024-06-03 21:50:12,088 INFO  L175             Difference]: Start difference. First operand has 126 places, 111 transitions, 993 flow. Second operand 9 states and 116 transitions.
[2024-06-03 21:50:12,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 122 transitions, 1259 flow
[2024-06-03 21:50:12,101 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 1127 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 21:50:12,103 INFO  L231             Difference]: Finished difference. Result has 128 places, 111 transitions, 928 flow
[2024-06-03 21:50:12,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=928, PETRI_PLACES=128, PETRI_TRANSITIONS=111}
[2024-06-03 21:50:12,103 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 95 predicate places.
[2024-06-03 21:50:12,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 111 transitions, 928 flow
[2024-06-03 21:50:12,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:50:12,104 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:12,104 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:12,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 21:50:12,104 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:50:12,105 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:12,105 INFO  L85        PathProgramCache]: Analyzing trace with hash -1434923989, now seen corresponding path program 8 times
[2024-06-03 21:50:12,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:12,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059542537]
[2024-06-03 21:50:12,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:12,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:12,134 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:22,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:22,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:22,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059542537]
[2024-06-03 21:50:22,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059542537] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:22,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:22,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:22,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039275691]
[2024-06-03 21:50:22,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:22,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:22,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:22,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:22,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:22,208 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:50:22,208 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 111 transitions, 928 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:50:22,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:22,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:50:22,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:22,663 INFO  L124   PetriNetUnfolderBase]: 333/617 cut-off events.
[2024-06-03 21:50:22,664 INFO  L125   PetriNetUnfolderBase]: For 21073/21075 co-relation queries the response was YES.
[2024-06-03 21:50:22,667 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3951 conditions, 617 events. 333/617 cut-off events. For 21073/21075 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2718 event pairs, 85 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 3891. Up to 454 conditions per place. 
[2024-06-03 21:50:22,670 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 71 selfloop transitions, 42 changer transitions 0/126 dead transitions.
[2024-06-03 21:50:22,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 126 transitions, 1236 flow
[2024-06-03 21:50:22,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:50:22,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:50:22,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions.
[2024-06-03 21:50:22,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41911764705882354
[2024-06-03 21:50:22,672 INFO  L175             Difference]: Start difference. First operand has 128 places, 111 transitions, 928 flow. Second operand 8 states and 114 transitions.
[2024-06-03 21:50:22,672 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 126 transitions, 1236 flow
[2024-06-03 21:50:22,683 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 126 transitions, 1153 flow, removed 6 selfloop flow, removed 8 redundant places.
[2024-06-03 21:50:22,686 INFO  L231             Difference]: Finished difference. Result has 128 places, 113 transitions, 990 flow
[2024-06-03 21:50:22,686 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=990, PETRI_PLACES=128, PETRI_TRANSITIONS=113}
[2024-06-03 21:50:22,686 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 95 predicate places.
[2024-06-03 21:50:22,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 113 transitions, 990 flow
[2024-06-03 21:50:22,687 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:50:22,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:22,687 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:50:22,687 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 21:50:22,687 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:50:22,688 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:22,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 257278963, now seen corresponding path program 1 times
[2024-06-03 21:50:22,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:22,688 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223293583]
[2024-06-03 21:50:22,688 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:22,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:22,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:33,221 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:50:33,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:33,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223293583]
[2024-06-03 21:50:33,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223293583] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:33,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:33,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:50:33,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442009800]
[2024-06-03 21:50:33,223 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:33,223 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:50:33,224 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:33,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:50:33,225 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:50:33,370 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:50:33,370 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 113 transitions, 990 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:50:33,370 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:33,370 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:50:33,370 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:33,717 INFO  L124   PetriNetUnfolderBase]: 347/632 cut-off events.
[2024-06-03 21:50:33,718 INFO  L125   PetriNetUnfolderBase]: For 21101/21101 co-relation queries the response was YES.
[2024-06-03 21:50:33,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4107 conditions, 632 events. 347/632 cut-off events. For 21101/21101 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2718 event pairs, 88 based on Foata normal form. 1/633 useless extension candidates. Maximal degree in co-relation 4046. Up to 564 conditions per place. 
[2024-06-03 21:50:33,722 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 102 selfloop transitions, 23 changer transitions 0/128 dead transitions.
[2024-06-03 21:50:33,722 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 128 transitions, 1294 flow
[2024-06-03 21:50:33,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:50:33,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:50:33,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions.
[2024-06-03 21:50:33,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36470588235294116
[2024-06-03 21:50:33,723 INFO  L175             Difference]: Start difference. First operand has 128 places, 113 transitions, 990 flow. Second operand 10 states and 124 transitions.
[2024-06-03 21:50:33,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 128 transitions, 1294 flow
[2024-06-03 21:50:33,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 1173 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 21:50:33,740 INFO  L231             Difference]: Finished difference. Result has 132 places, 115 transitions, 944 flow
[2024-06-03 21:50:33,740 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=944, PETRI_PLACES=132, PETRI_TRANSITIONS=115}
[2024-06-03 21:50:33,741 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places.
[2024-06-03 21:50:33,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 115 transitions, 944 flow
[2024-06-03 21:50:33,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:50:33,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:33,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:33,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 21:50:33,741 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:50:33,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:33,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -988916800, now seen corresponding path program 5 times
[2024-06-03 21:50:33,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:33,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508405136]
[2024-06-03 21:50:33,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:33,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:33,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:44,124 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:50:44,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:44,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508405136]
[2024-06-03 21:50:44,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508405136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:44,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:44,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:44,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543100444]
[2024-06-03 21:50:44,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:44,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:44,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:44,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:44,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:44,226 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:50:44,227 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 115 transitions, 944 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:50:44,227 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:44,227 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:50:44,227 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:44,632 INFO  L124   PetriNetUnfolderBase]: 350/637 cut-off events.
[2024-06-03 21:50:44,632 INFO  L125   PetriNetUnfolderBase]: For 19145/19145 co-relation queries the response was YES.
[2024-06-03 21:50:44,635 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 637 events. 350/637 cut-off events. For 19145/19145 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2739 event pairs, 95 based on Foata normal form. 1/638 useless extension candidates. Maximal degree in co-relation 3912. Up to 560 conditions per place. 
[2024-06-03 21:50:44,637 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 96 selfloop transitions, 29 changer transitions 0/128 dead transitions.
[2024-06-03 21:50:44,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 128 transitions, 1254 flow
[2024-06-03 21:50:44,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:50:44,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:50:44,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions.
[2024-06-03 21:50:44,638 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3786764705882353
[2024-06-03 21:50:44,638 INFO  L175             Difference]: Start difference. First operand has 132 places, 115 transitions, 944 flow. Second operand 8 states and 103 transitions.
[2024-06-03 21:50:44,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 128 transitions, 1254 flow
[2024-06-03 21:50:44,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 1195 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-03 21:50:44,653 INFO  L231             Difference]: Finished difference. Result has 132 places, 117 transitions, 990 flow
[2024-06-03 21:50:44,653 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=990, PETRI_PLACES=132, PETRI_TRANSITIONS=117}
[2024-06-03 21:50:44,653 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 99 predicate places.
[2024-06-03 21:50:44,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 990 flow
[2024-06-03 21:50:44,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:50:44,654 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:44,654 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:44,654 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 21:50:44,654 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:50:44,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:44,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -983352827, now seen corresponding path program 9 times
[2024-06-03 21:50:44,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:44,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441551974]
[2024-06-03 21:50:44,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:44,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:44,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:55,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:55,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:55,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441551974]
[2024-06-03 21:50:55,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441551974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:55,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:55,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:55,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416377540]
[2024-06-03 21:50:55,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:55,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:55,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:55,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:55,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:55,443 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:50:55,444 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 990 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:50:55,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:55,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:50:55,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:55,844 INFO  L124   PetriNetUnfolderBase]: 341/634 cut-off events.
[2024-06-03 21:50:55,844 INFO  L125   PetriNetUnfolderBase]: For 21202/21202 co-relation queries the response was YES.
[2024-06-03 21:50:55,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4068 conditions, 634 events. 341/634 cut-off events. For 21202/21202 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2783 event pairs, 59 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 4005. Up to 442 conditions per place. 
[2024-06-03 21:50:55,849 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 68 selfloop transitions, 48 changer transitions 0/130 dead transitions.
[2024-06-03 21:50:55,849 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 130 transitions, 1294 flow
[2024-06-03 21:50:55,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:50:55,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:50:55,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions.
[2024-06-03 21:50:55,850 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41544117647058826
[2024-06-03 21:50:55,850 INFO  L175             Difference]: Start difference. First operand has 132 places, 117 transitions, 990 flow. Second operand 8 states and 113 transitions.
[2024-06-03 21:50:55,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 130 transitions, 1294 flow
[2024-06-03 21:50:55,864 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 130 transitions, 1217 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-03 21:50:55,866 INFO  L231             Difference]: Finished difference. Result has 134 places, 119 transitions, 1063 flow
[2024-06-03 21:50:55,866 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1063, PETRI_PLACES=134, PETRI_TRANSITIONS=119}
[2024-06-03 21:50:55,866 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places.
[2024-06-03 21:50:55,867 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 119 transitions, 1063 flow
[2024-06-03 21:50:55,867 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:50:55,867 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:55,867 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:55,867 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 21:50:55,867 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:50:55,868 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:55,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -983352610, now seen corresponding path program 6 times
[2024-06-03 21:50:55,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:55,868 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872575785]
[2024-06-03 21:50:55,868 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:55,868 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:55,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:05,839 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:51:05,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:05,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872575785]
[2024-06-03 21:51:05,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872575785] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:05,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:05,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:05,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020996619]
[2024-06-03 21:51:05,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:05,841 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:05,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:05,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:05,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:05,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:51:05,974 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 119 transitions, 1063 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:51:05,974 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:05,974 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:51:05,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:06,335 INFO  L124   PetriNetUnfolderBase]: 364/663 cut-off events.
[2024-06-03 21:51:06,335 INFO  L125   PetriNetUnfolderBase]: For 20229/20229 co-relation queries the response was YES.
[2024-06-03 21:51:06,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4248 conditions, 663 events. 364/663 cut-off events. For 20229/20229 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2895 event pairs, 90 based on Foata normal form. 1/664 useless extension candidates. Maximal degree in co-relation 4184. Up to 552 conditions per place. 
[2024-06-03 21:51:06,340 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 89 selfloop transitions, 41 changer transitions 0/133 dead transitions.
[2024-06-03 21:51:06,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 133 transitions, 1461 flow
[2024-06-03 21:51:06,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:06,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:06,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions.
[2024-06-03 21:51:06,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3860294117647059
[2024-06-03 21:51:06,345 INFO  L175             Difference]: Start difference. First operand has 134 places, 119 transitions, 1063 flow. Second operand 8 states and 105 transitions.
[2024-06-03 21:51:06,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 133 transitions, 1461 flow
[2024-06-03 21:51:06,361 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 133 transitions, 1315 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-03 21:51:06,362 INFO  L231             Difference]: Finished difference. Result has 134 places, 123 transitions, 1069 flow
[2024-06-03 21:51:06,363 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1069, PETRI_PLACES=134, PETRI_TRANSITIONS=123}
[2024-06-03 21:51:06,363 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places.
[2024-06-03 21:51:06,363 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 1069 flow
[2024-06-03 21:51:06,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:51:06,363 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:06,364 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:06,364 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 21:51:06,364 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:51:06,364 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:06,364 INFO  L85        PathProgramCache]: Analyzing trace with hash -983344891, now seen corresponding path program 2 times
[2024-06-03 21:51:06,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:06,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757341852]
[2024-06-03 21:51:06,365 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:06,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:06,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:16,330 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:51:16,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:16,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757341852]
[2024-06-03 21:51:16,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757341852] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:16,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:16,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:16,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94968883]
[2024-06-03 21:51:16,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:16,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:16,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:16,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:16,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:16,458 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:51:16,458 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 123 transitions, 1069 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:51:16,458 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:16,458 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:51:16,458 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:16,814 INFO  L124   PetriNetUnfolderBase]: 347/643 cut-off events.
[2024-06-03 21:51:16,814 INFO  L125   PetriNetUnfolderBase]: For 19987/19990 co-relation queries the response was YES.
[2024-06-03 21:51:16,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4007 conditions, 643 events. 347/643 cut-off events. For 19987/19990 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2862 event pairs, 98 based on Foata normal form. 4/645 useless extension candidates. Maximal degree in co-relation 3944. Up to 533 conditions per place. 
[2024-06-03 21:51:16,819 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 90 selfloop transitions, 22 changer transitions 0/134 dead transitions.
[2024-06-03 21:51:16,819 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 134 transitions, 1335 flow
[2024-06-03 21:51:16,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:16,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:16,820 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions.
[2024-06-03 21:51:16,820 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39338235294117646
[2024-06-03 21:51:16,820 INFO  L175             Difference]: Start difference. First operand has 134 places, 123 transitions, 1069 flow. Second operand 8 states and 107 transitions.
[2024-06-03 21:51:16,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 134 transitions, 1335 flow
[2024-06-03 21:51:16,835 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 134 transitions, 1267 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-03 21:51:16,837 INFO  L231             Difference]: Finished difference. Result has 137 places, 125 transitions, 1077 flow
[2024-06-03 21:51:16,837 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1077, PETRI_PLACES=137, PETRI_TRANSITIONS=125}
[2024-06-03 21:51:16,837 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places.
[2024-06-03 21:51:16,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 125 transitions, 1077 flow
[2024-06-03 21:51:16,838 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:51:16,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:16,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:16,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 21:51:16,838 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:51:16,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:16,839 INFO  L85        PathProgramCache]: Analyzing trace with hash -983345170, now seen corresponding path program 7 times
[2024-06-03 21:51:16,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:16,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498756507]
[2024-06-03 21:51:16,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:16,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:16,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:26,849 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:51:26,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:26,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498756507]
[2024-06-03 21:51:26,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498756507] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:26,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:26,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:26,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016576680]
[2024-06-03 21:51:26,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:26,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:26,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:26,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:26,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:26,984 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:51:26,985 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 125 transitions, 1077 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:51:26,985 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:26,985 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:51:26,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:27,335 INFO  L124   PetriNetUnfolderBase]: 365/664 cut-off events.
[2024-06-03 21:51:27,335 INFO  L125   PetriNetUnfolderBase]: For 18991/18991 co-relation queries the response was YES.
[2024-06-03 21:51:27,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4145 conditions, 664 events. 365/664 cut-off events. For 18991/18991 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2909 event pairs, 90 based on Foata normal form. 1/665 useless extension candidates. Maximal degree in co-relation 4081. Up to 555 conditions per place. 
[2024-06-03 21:51:27,339 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 87 selfloop transitions, 44 changer transitions 0/134 dead transitions.
[2024-06-03 21:51:27,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 134 transitions, 1361 flow
[2024-06-03 21:51:27,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:51:27,344 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:51:27,345 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions.
[2024-06-03 21:51:27,345 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3786764705882353
[2024-06-03 21:51:27,345 INFO  L175             Difference]: Start difference. First operand has 137 places, 125 transitions, 1077 flow. Second operand 8 states and 103 transitions.
[2024-06-03 21:51:27,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 134 transitions, 1361 flow
[2024-06-03 21:51:27,360 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 134 transitions, 1289 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-03 21:51:27,362 INFO  L231             Difference]: Finished difference. Result has 139 places, 125 transitions, 1101 flow
[2024-06-03 21:51:27,362 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1101, PETRI_PLACES=139, PETRI_TRANSITIONS=125}
[2024-06-03 21:51:27,362 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places.
[2024-06-03 21:51:27,363 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 1101 flow
[2024-06-03 21:51:27,363 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:51:27,363 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:27,363 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:27,363 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 21:51:27,363 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:51:27,364 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:27,364 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043116254, now seen corresponding path program 8 times
[2024-06-03 21:51:27,364 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:27,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145359145]
[2024-06-03 21:51:27,364 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:27,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:27,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:37,711 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:51:37,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:37,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145359145]
[2024-06-03 21:51:37,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145359145] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:37,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:37,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:37,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874828003]
[2024-06-03 21:51:37,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:37,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:37,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:37,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:37,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:37,883 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:51:37,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 1101 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:51:37,884 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:37,884 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:51:37,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:38,223 INFO  L124   PetriNetUnfolderBase]: 368/670 cut-off events.
[2024-06-03 21:51:38,223 INFO  L125   PetriNetUnfolderBase]: For 19159/19159 co-relation queries the response was YES.
[2024-06-03 21:51:38,226 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 670 events. 368/670 cut-off events. For 19159/19159 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2931 event pairs, 90 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 4110. Up to 533 conditions per place. 
[2024-06-03 21:51:38,242 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 88 selfloop transitions, 49 changer transitions 0/140 dead transitions.
[2024-06-03 21:51:38,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 1515 flow
[2024-06-03 21:51:38,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:51:38,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:51:38,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions.
[2024-06-03 21:51:38,260 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38235294117647056
[2024-06-03 21:51:38,260 INFO  L175             Difference]: Start difference. First operand has 139 places, 125 transitions, 1101 flow. Second operand 9 states and 117 transitions.
[2024-06-03 21:51:38,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 1515 flow
[2024-06-03 21:51:38,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 140 transitions, 1412 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-03 21:51:38,280 INFO  L231             Difference]: Finished difference. Result has 140 places, 129 transitions, 1163 flow
[2024-06-03 21:51:38,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1000, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1163, PETRI_PLACES=140, PETRI_TRANSITIONS=129}
[2024-06-03 21:51:38,281 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places.
[2024-06-03 21:51:38,281 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 1163 flow
[2024-06-03 21:51:38,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:51:38,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:38,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:38,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 21:51:38,281 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:51:38,282 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:38,282 INFO  L85        PathProgramCache]: Analyzing trace with hash -782263577, now seen corresponding path program 10 times
[2024-06-03 21:51:38,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:38,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211576022]
[2024-06-03 21:51:38,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:38,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:38,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:48,963 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:51:48,964 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:48,964 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211576022]
[2024-06-03 21:51:48,964 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211576022] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:48,964 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:48,964 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:48,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558814174]
[2024-06-03 21:51:48,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:48,965 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:48,966 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:48,966 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:48,966 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:49,096 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:51:49,097 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 1163 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:51:49,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:49,097 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:51:49,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:49,493 INFO  L124   PetriNetUnfolderBase]: 353/658 cut-off events.
[2024-06-03 21:51:49,493 INFO  L125   PetriNetUnfolderBase]: For 19645/19645 co-relation queries the response was YES.
[2024-06-03 21:51:49,496 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4121 conditions, 658 events. 353/658 cut-off events. For 19645/19645 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2931 event pairs, 59 based on Foata normal form. 2/660 useless extension candidates. Maximal degree in co-relation 4056. Up to 442 conditions per place. 
[2024-06-03 21:51:49,514 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 73 selfloop transitions, 52 changer transitions 0/143 dead transitions.
[2024-06-03 21:51:49,528 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 143 transitions, 1487 flow
[2024-06-03 21:51:49,529 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:51:49,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:51:49,529 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions.
[2024-06-03 21:51:49,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4084967320261438
[2024-06-03 21:51:49,529 INFO  L175             Difference]: Start difference. First operand has 140 places, 129 transitions, 1163 flow. Second operand 9 states and 125 transitions.
[2024-06-03 21:51:49,530 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 143 transitions, 1487 flow
[2024-06-03 21:51:49,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 143 transitions, 1372 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-03 21:51:49,549 INFO  L231             Difference]: Finished difference. Result has 143 places, 131 transitions, 1203 flow
[2024-06-03 21:51:49,549 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1203, PETRI_PLACES=143, PETRI_TRANSITIONS=131}
[2024-06-03 21:51:49,549 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 110 predicate places.
[2024-06-03 21:51:49,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 1203 flow
[2024-06-03 21:51:49,550 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:51:49,550 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:49,550 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:49,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 21:51:49,550 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:51:49,551 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:49,551 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043123694, now seen corresponding path program 9 times
[2024-06-03 21:51:49,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:49,551 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649454423]
[2024-06-03 21:51:49,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:49,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:49,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:59,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:59,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:59,953 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649454423]
[2024-06-03 21:51:59,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649454423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:59,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:59,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:59,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269581136]
[2024-06-03 21:51:59,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:59,954 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:59,954 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:59,954 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:59,954 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:00,110 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:52:00,110 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 1203 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:52:00,110 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:00,110 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:52:00,110 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:00,439 INFO  L124   PetriNetUnfolderBase]: 372/679 cut-off events.
[2024-06-03 21:52:00,439 INFO  L125   PetriNetUnfolderBase]: For 20407/20407 co-relation queries the response was YES.
[2024-06-03 21:52:00,442 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 679 events. 372/679 cut-off events. For 20407/20407 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3000 event pairs, 90 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 4243. Up to 539 conditions per place. 
[2024-06-03 21:52:00,444 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 91 selfloop transitions, 50 changer transitions 0/144 dead transitions.
[2024-06-03 21:52:00,444 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 144 transitions, 1597 flow
[2024-06-03 21:52:00,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:52:00,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:52:00,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions.
[2024-06-03 21:52:00,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38562091503267976
[2024-06-03 21:52:00,445 INFO  L175             Difference]: Start difference. First operand has 143 places, 131 transitions, 1203 flow. Second operand 9 states and 118 transitions.
[2024-06-03 21:52:00,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 144 transitions, 1597 flow
[2024-06-03 21:52:00,463 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 144 transitions, 1458 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-03 21:52:00,465 INFO  L231             Difference]: Finished difference. Result has 145 places, 133 transitions, 1195 flow
[2024-06-03 21:52:00,465 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1195, PETRI_PLACES=145, PETRI_TRANSITIONS=133}
[2024-06-03 21:52:00,465 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places.
[2024-06-03 21:52:00,466 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 133 transitions, 1195 flow
[2024-06-03 21:52:00,466 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:52:00,466 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:00,466 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:00,466 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 21:52:00,466 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:52:00,466 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:00,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 2043123973, now seen corresponding path program 3 times
[2024-06-03 21:52:00,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:00,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921758862]
[2024-06-03 21:52:00,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:00,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:00,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:10,904 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:52:10,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:10,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921758862]
[2024-06-03 21:52:10,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921758862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:10,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:10,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:10,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365221560]
[2024-06-03 21:52:10,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:10,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:10,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:10,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:10,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:11,029 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:52:11,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 133 transitions, 1195 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:52:11,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:11,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:52:11,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:11,380 INFO  L124   PetriNetUnfolderBase]: 355/659 cut-off events.
[2024-06-03 21:52:11,380 INFO  L125   PetriNetUnfolderBase]: For 21454/21456 co-relation queries the response was YES.
[2024-06-03 21:52:11,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 659 events. 355/659 cut-off events. For 21454/21456 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2979 event pairs, 98 based on Foata normal form. 3/659 useless extension candidates. Maximal degree in co-relation 4057. Up to 517 conditions per place. 
[2024-06-03 21:52:11,385 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 94 selfloop transitions, 31 changer transitions 0/150 dead transitions.
[2024-06-03 21:52:11,385 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 150 transitions, 1583 flow
[2024-06-03 21:52:11,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:52:11,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:52:11,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions.
[2024-06-03 21:52:11,387 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40522875816993464
[2024-06-03 21:52:11,387 INFO  L175             Difference]: Start difference. First operand has 145 places, 133 transitions, 1195 flow. Second operand 9 states and 124 transitions.
[2024-06-03 21:52:11,387 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 150 transitions, 1583 flow
[2024-06-03 21:52:11,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 150 transitions, 1476 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-03 21:52:11,406 INFO  L231             Difference]: Finished difference. Result has 149 places, 139 transitions, 1226 flow
[2024-06-03 21:52:11,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1088, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1226, PETRI_PLACES=149, PETRI_TRANSITIONS=139}
[2024-06-03 21:52:11,417 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 116 predicate places.
[2024-06-03 21:52:11,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 139 transitions, 1226 flow
[2024-06-03 21:52:11,417 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:52:11,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:11,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:11,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 21:52:11,418 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:52:11,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:11,418 INFO  L85        PathProgramCache]: Analyzing trace with hash -781996450, now seen corresponding path program 10 times
[2024-06-03 21:52:11,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:11,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773045979]
[2024-06-03 21:52:11,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:11,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:11,457 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:21,785 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:52:21,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:21,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773045979]
[2024-06-03 21:52:21,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773045979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:21,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:21,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:21,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571745560]
[2024-06-03 21:52:21,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:21,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:21,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:21,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:21,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:21,912 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:52:21,912 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 139 transitions, 1226 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:52:21,912 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:21,912 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:52:21,912 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:22,310 INFO  L124   PetriNetUnfolderBase]: 373/680 cut-off events.
[2024-06-03 21:52:22,310 INFO  L125   PetriNetUnfolderBase]: For 21964/21964 co-relation queries the response was YES.
[2024-06-03 21:52:22,312 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4297 conditions, 680 events. 373/680 cut-off events. For 21964/21964 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3003 event pairs, 90 based on Foata normal form. 1/681 useless extension candidates. Maximal degree in co-relation 4228. Up to 542 conditions per place. 
[2024-06-03 21:52:22,314 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 89 selfloop transitions, 57 changer transitions 0/149 dead transitions.
[2024-06-03 21:52:22,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 149 transitions, 1542 flow
[2024-06-03 21:52:22,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:52:22,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:52:22,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions.
[2024-06-03 21:52:22,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3758169934640523
[2024-06-03 21:52:22,324 INFO  L175             Difference]: Start difference. First operand has 149 places, 139 transitions, 1226 flow. Second operand 9 states and 115 transitions.
[2024-06-03 21:52:22,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 149 transitions, 1542 flow
[2024-06-03 21:52:22,346 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 149 transitions, 1492 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-03 21:52:22,348 INFO  L231             Difference]: Finished difference. Result has 154 places, 139 transitions, 1295 flow
[2024-06-03 21:52:22,348 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1295, PETRI_PLACES=154, PETRI_TRANSITIONS=139}
[2024-06-03 21:52:22,349 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places.
[2024-06-03 21:52:22,349 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 139 transitions, 1295 flow
[2024-06-03 21:52:22,349 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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:52:22,349 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:22,349 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:22,350 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 21:52:22,350 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:52:22,350 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:22,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 2052320743, now seen corresponding path program 4 times
[2024-06-03 21:52:22,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:22,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737612961]
[2024-06-03 21:52:22,350 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:22,351 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:22,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:32,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 21:52:32,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:32,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737612961]
[2024-06-03 21:52:32,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737612961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:32,937 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:32,937 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:32,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972645729]
[2024-06-03 21:52:32,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:32,938 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:32,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:32,938 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:32,939 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:33,032 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:52:33,033 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 139 transitions, 1295 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:52:33,033 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:33,033 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:52:33,033 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:33,404 INFO  L124   PetriNetUnfolderBase]: 356/661 cut-off events.
[2024-06-03 21:52:33,405 INFO  L125   PetriNetUnfolderBase]: For 23609/23611 co-relation queries the response was YES.
[2024-06-03 21:52:33,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 661 events. 356/661 cut-off events. For 23609/23611 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2995 event pairs, 98 based on Foata normal form. 3/661 useless extension candidates. Maximal degree in co-relation 4203. Up to 519 conditions per place. 
[2024-06-03 21:52:33,409 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 92 selfloop transitions, 35 changer transitions 0/152 dead transitions.
[2024-06-03 21:52:33,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 152 transitions, 1665 flow
[2024-06-03 21:52:33,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:52:33,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:52:33,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions.
[2024-06-03 21:52:33,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4019607843137255
[2024-06-03 21:52:33,411 INFO  L175             Difference]: Start difference. First operand has 154 places, 139 transitions, 1295 flow. Second operand 9 states and 123 transitions.
[2024-06-03 21:52:33,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 152 transitions, 1665 flow
[2024-06-03 21:52:33,432 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 152 transitions, 1535 flow, removed 1 selfloop flow, removed 9 redundant places.
[2024-06-03 21:52:33,434 INFO  L231             Difference]: Finished difference. Result has 154 places, 141 transitions, 1264 flow
[2024-06-03 21:52:33,434 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1264, PETRI_PLACES=154, PETRI_TRANSITIONS=141}
[2024-06-03 21:52:33,435 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places.
[2024-06-03 21:52:33,435 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 141 transitions, 1264 flow
[2024-06-03 21:52:33,435 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:52:33,435 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:33,435 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:33,435 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 21:52:33,435 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:52:33,436 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:33,436 INFO  L85        PathProgramCache]: Analyzing trace with hash 1123604415, now seen corresponding path program 5 times
[2024-06-03 21:52:33,436 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:33,436 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942061544]
[2024-06-03 21:52:33,436 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:33,436 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:33,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:43,932 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:52:43,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:43,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942061544]
[2024-06-03 21:52:43,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942061544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:43,935 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:43,935 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:43,935 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045954366]
[2024-06-03 21:52:43,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:43,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:43,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:43,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:43,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:44,020 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:52:44,021 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 141 transitions, 1264 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:52:44,021 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:44,021 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:52:44,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:44,411 INFO  L124   PetriNetUnfolderBase]: 354/658 cut-off events.
[2024-06-03 21:52:44,412 INFO  L125   PetriNetUnfolderBase]: For 24335/24337 co-relation queries the response was YES.
[2024-06-03 21:52:44,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4217 conditions, 658 events. 354/658 cut-off events. For 24335/24337 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2981 event pairs, 98 based on Foata normal form. 3/658 useless extension candidates. Maximal degree in co-relation 4145. Up to 517 conditions per place. 
[2024-06-03 21:52:44,416 INFO  L140   encePairwiseOnDemand]: 25/34 looper letters, 88 selfloop transitions, 38 changer transitions 0/151 dead transitions.
[2024-06-03 21:52:44,416 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 151 transitions, 1540 flow
[2024-06-03 21:52:44,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:52:44,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:52:44,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions.
[2024-06-03 21:52:44,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3954248366013072
[2024-06-03 21:52:44,418 INFO  L175             Difference]: Start difference. First operand has 154 places, 141 transitions, 1264 flow. Second operand 9 states and 121 transitions.
[2024-06-03 21:52:44,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 151 transitions, 1540 flow
[2024-06-03 21:52:44,440 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 1455 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 21:52:44,442 INFO  L231             Difference]: Finished difference. Result has 157 places, 141 transitions, 1260 flow
[2024-06-03 21:52:44,442 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1260, PETRI_PLACES=157, PETRI_TRANSITIONS=141}
[2024-06-03 21:52:44,443 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 124 predicate places.
[2024-06-03 21:52:44,443 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 141 transitions, 1260 flow
[2024-06-03 21:52:44,443 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:52:44,443 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:44,443 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:44,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 21:52:44,444 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:52:44,444 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:44,444 INFO  L85        PathProgramCache]: Analyzing trace with hash 2052659077, now seen corresponding path program 1 times
[2024-06-03 21:52:44,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:44,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702259085]
[2024-06-03 21:52:44,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:44,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:44,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:55,425 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:52:55,425 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:55,426 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702259085]
[2024-06-03 21:52:55,426 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702259085] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:55,426 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:55,426 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:52:55,426 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096710381]
[2024-06-03 21:52:55,426 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:55,426 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:52:55,427 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:55,427 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:52:55,427 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:52:55,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:52:55,601 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 141 transitions, 1260 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:52:55,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:55,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:52:55,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:55,930 INFO  L124   PetriNetUnfolderBase]: 351/653 cut-off events.
[2024-06-03 21:52:55,930 INFO  L125   PetriNetUnfolderBase]: For 25122/25124 co-relation queries the response was YES.
[2024-06-03 21:52:55,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4186 conditions, 653 events. 351/653 cut-off events. For 25122/25124 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2968 event pairs, 116 based on Foata normal form. 3/650 useless extension candidates. Maximal degree in co-relation 4113. Up to 555 conditions per place. 
[2024-06-03 21:52:55,935 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 111 selfloop transitions, 15 changer transitions 0/151 dead transitions.
[2024-06-03 21:52:55,936 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 151 transitions, 1542 flow
[2024-06-03 21:52:55,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:52:55,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:52:55,936 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions.
[2024-06-03 21:52:55,937 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3758169934640523
[2024-06-03 21:52:55,937 INFO  L175             Difference]: Start difference. First operand has 157 places, 141 transitions, 1260 flow. Second operand 9 states and 115 transitions.
[2024-06-03 21:52:55,937 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 151 transitions, 1542 flow
[2024-06-03 21:52:55,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 151 transitions, 1476 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-03 21:52:55,964 INFO  L231             Difference]: Finished difference. Result has 159 places, 143 transitions, 1245 flow
[2024-06-03 21:52:55,965 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1194, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1245, PETRI_PLACES=159, PETRI_TRANSITIONS=143}
[2024-06-03 21:52:55,965 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 126 predicate places.
[2024-06-03 21:52:55,965 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 143 transitions, 1245 flow
[2024-06-03 21:52:55,965 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:52:55,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:55,965 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:52:55,966 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 21:52:55,966 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:52:55,966 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:55,966 INFO  L85        PathProgramCache]: Analyzing trace with hash -1323152227, now seen corresponding path program 1 times
[2024-06-03 21:52:55,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:55,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831554696]
[2024-06-03 21:52:55,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:55,967 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:56,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:07,483 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:53:07,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:07,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831554696]
[2024-06-03 21:53:07,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831554696] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:07,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:07,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:07,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957111430]
[2024-06-03 21:53:07,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:07,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:07,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:07,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:07,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:53:07,694 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:53:07,694 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 143 transitions, 1245 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:53:07,694 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:07,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:53:07,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:08,144 INFO  L124   PetriNetUnfolderBase]: 361/674 cut-off events.
[2024-06-03 21:53:08,144 INFO  L125   PetriNetUnfolderBase]: For 26606/26607 co-relation queries the response was YES.
[2024-06-03 21:53:08,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 674 events. 361/674 cut-off events. For 26606/26607 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3068 event pairs, 80 based on Foata normal form. 1/674 useless extension candidates. Maximal degree in co-relation 4288. Up to 524 conditions per place. 
[2024-06-03 21:53:08,149 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 114 selfloop transitions, 33 changer transitions 0/166 dead transitions.
[2024-06-03 21:53:08,149 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 166 transitions, 1651 flow
[2024-06-03 21:53:08,150 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:53:08,150 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:53:08,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions.
[2024-06-03 21:53:08,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4088235294117647
[2024-06-03 21:53:08,150 INFO  L175             Difference]: Start difference. First operand has 159 places, 143 transitions, 1245 flow. Second operand 10 states and 139 transitions.
[2024-06-03 21:53:08,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 166 transitions, 1651 flow
[2024-06-03 21:53:08,177 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 166 transitions, 1553 flow, removed 6 selfloop flow, removed 10 redundant places.
[2024-06-03 21:53:08,179 INFO  L231             Difference]: Finished difference. Result has 160 places, 148 transitions, 1296 flow
[2024-06-03 21:53:08,180 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1296, PETRI_PLACES=160, PETRI_TRANSITIONS=148}
[2024-06-03 21:53:08,180 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 127 predicate places.
[2024-06-03 21:53:08,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 148 transitions, 1296 flow
[2024-06-03 21:53:08,180 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:53:08,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:08,181 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:53:08,181 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 21:53:08,181 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:53:08,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:08,181 INFO  L85        PathProgramCache]: Analyzing trace with hash 813154513, now seen corresponding path program 2 times
[2024-06-03 21:53:08,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:08,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10566518]
[2024-06-03 21:53:08,182 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:08,182 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:08,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:18,322 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:53:18,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:18,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10566518]
[2024-06-03 21:53:18,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10566518] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:18,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:18,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:18,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158437657]
[2024-06-03 21:53:18,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:18,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:18,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:18,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:18,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:53:18,452 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:53:18,453 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 148 transitions, 1296 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:53:18,453 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:18,453 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:53:18,453 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:18,938 INFO  L124   PetriNetUnfolderBase]: 362/680 cut-off events.
[2024-06-03 21:53:18,938 INFO  L125   PetriNetUnfolderBase]: For 27503/27504 co-relation queries the response was YES.
[2024-06-03 21:53:18,941 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4403 conditions, 680 events. 362/680 cut-off events. For 27503/27504 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3149 event pairs, 79 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 4328. Up to 520 conditions per place. 
[2024-06-03 21:53:18,945 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 115 selfloop transitions, 38 changer transitions 0/172 dead transitions.
[2024-06-03 21:53:18,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 172 transitions, 1722 flow
[2024-06-03 21:53:18,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:53:18,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:53:18,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions.
[2024-06-03 21:53:18,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4037433155080214
[2024-06-03 21:53:18,951 INFO  L175             Difference]: Start difference. First operand has 160 places, 148 transitions, 1296 flow. Second operand 11 states and 151 transitions.
[2024-06-03 21:53:18,951 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 172 transitions, 1722 flow
[2024-06-03 21:53:18,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 172 transitions, 1609 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 21:53:18,976 INFO  L231             Difference]: Finished difference. Result has 164 places, 152 transitions, 1338 flow
[2024-06-03 21:53:18,976 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1187, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1338, PETRI_PLACES=164, PETRI_TRANSITIONS=152}
[2024-06-03 21:53:18,976 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 131 predicate places.
[2024-06-03 21:53:18,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 152 transitions, 1338 flow
[2024-06-03 21:53:18,977 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:53:18,977 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:18,977 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:53:18,977 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 21:53:18,977 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:53:18,977 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:18,977 INFO  L85        PathProgramCache]: Analyzing trace with hash 816859819, now seen corresponding path program 1 times
[2024-06-03 21:53:18,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:18,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217341818]
[2024-06-03 21:53:18,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:18,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:19,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:27,259 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:53:27,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:27,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217341818]
[2024-06-03 21:53:27,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217341818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:27,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:27,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:27,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049466325]
[2024-06-03 21:53:27,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:27,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:27,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:27,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:27,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:53:27,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:53:27,421 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 152 transitions, 1338 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:53:27,421 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:27,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:53:27,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:27,797 INFO  L124   PetriNetUnfolderBase]: 384/703 cut-off events.
[2024-06-03 21:53:27,797 INFO  L125   PetriNetUnfolderBase]: For 28683/28683 co-relation queries the response was YES.
[2024-06-03 21:53:27,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4571 conditions, 703 events. 384/703 cut-off events. For 28683/28683 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3170 event pairs, 90 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 4495. Up to 610 conditions per place. 
[2024-06-03 21:53:27,801 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 138 selfloop transitions, 31 changer transitions 0/172 dead transitions.
[2024-06-03 21:53:27,801 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 172 transitions, 1742 flow
[2024-06-03 21:53:27,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:53:27,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:53:27,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions.
[2024-06-03 21:53:27,802 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3735294117647059
[2024-06-03 21:53:27,803 INFO  L175             Difference]: Start difference. First operand has 164 places, 152 transitions, 1338 flow. Second operand 10 states and 127 transitions.
[2024-06-03 21:53:27,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 172 transitions, 1742 flow
[2024-06-03 21:53:27,826 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 172 transitions, 1638 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 21:53:27,828 INFO  L231             Difference]: Finished difference. Result has 168 places, 156 transitions, 1334 flow
[2024-06-03 21:53:27,828 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1334, PETRI_PLACES=168, PETRI_TRANSITIONS=156}
[2024-06-03 21:53:27,828 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 135 predicate places.
[2024-06-03 21:53:27,829 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 156 transitions, 1334 flow
[2024-06-03 21:53:27,829 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:53:27,829 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:27,829 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:53:27,829 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 21:53:27,829 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:53:27,829 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:27,830 INFO  L85        PathProgramCache]: Analyzing trace with hash 175601357, now seen corresponding path program 2 times
[2024-06-03 21:53:27,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:27,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932501695]
[2024-06-03 21:53:27,830 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:27,830 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:27,872 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:37,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:37,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:37,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932501695]
[2024-06-03 21:53:37,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932501695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:37,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:37,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:37,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51820102]
[2024-06-03 21:53:37,892 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:37,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:37,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:37,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:37,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:53:38,013 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:53:38,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 156 transitions, 1334 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:53:38,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:38,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:53:38,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:38,464 INFO  L124   PetriNetUnfolderBase]: 390/714 cut-off events.
[2024-06-03 21:53:38,464 INFO  L125   PetriNetUnfolderBase]: For 29053/29053 co-relation queries the response was YES.
[2024-06-03 21:53:38,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4635 conditions, 714 events. 390/714 cut-off events. For 29053/29053 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3245 event pairs, 92 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 4557. Up to 612 conditions per place. 
[2024-06-03 21:53:38,469 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 143 selfloop transitions, 29 changer transitions 0/175 dead transitions.
[2024-06-03 21:53:38,469 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 175 transitions, 1764 flow
[2024-06-03 21:53:38,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:53:38,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:53:38,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions.
[2024-06-03 21:53:38,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37941176470588234
[2024-06-03 21:53:38,474 INFO  L175             Difference]: Start difference. First operand has 168 places, 156 transitions, 1334 flow. Second operand 10 states and 129 transitions.
[2024-06-03 21:53:38,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 175 transitions, 1764 flow
[2024-06-03 21:53:38,500 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 175 transitions, 1712 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-03 21:53:38,502 INFO  L231             Difference]: Finished difference. Result has 172 places, 158 transitions, 1383 flow
[2024-06-03 21:53:38,503 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1383, PETRI_PLACES=172, PETRI_TRANSITIONS=158}
[2024-06-03 21:53:38,503 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 139 predicate places.
[2024-06-03 21:53:38,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 158 transitions, 1383 flow
[2024-06-03 21:53:38,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:53:38,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:38,503 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:53:38,504 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 21:53:38,504 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:53:38,505 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:38,506 INFO  L85        PathProgramCache]: Analyzing trace with hash 1354826777, now seen corresponding path program 2 times
[2024-06-03 21:53:38,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:38,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660647270]
[2024-06-03 21:53:38,506 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:38,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:38,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:48,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 21:53:48,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:48,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660647270]
[2024-06-03 21:53:48,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660647270] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:48,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:48,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:48,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998519636]
[2024-06-03 21:53:48,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:48,924 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:48,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:48,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:48,925 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:53:49,076 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:53:49,076 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 158 transitions, 1383 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:53:49,076 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:49,076 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:53:49,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:49,429 INFO  L124   PetriNetUnfolderBase]: 393/722 cut-off events.
[2024-06-03 21:53:49,429 INFO  L125   PetriNetUnfolderBase]: For 30067/30067 co-relation queries the response was YES.
[2024-06-03 21:53:49,433 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 722 events. 393/722 cut-off events. For 30067/30067 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3303 event pairs, 96 based on Foata normal form. 1/723 useless extension candidates. Maximal degree in co-relation 4688. Up to 643 conditions per place. 
[2024-06-03 21:53:49,435 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 147 selfloop transitions, 24 changer transitions 0/174 dead transitions.
[2024-06-03 21:53:49,435 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 1785 flow
[2024-06-03 21:53:49,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:53:49,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:53:49,436 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions.
[2024-06-03 21:53:49,436 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36470588235294116
[2024-06-03 21:53:49,436 INFO  L175             Difference]: Start difference. First operand has 172 places, 158 transitions, 1383 flow. Second operand 10 states and 124 transitions.
[2024-06-03 21:53:49,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 1785 flow
[2024-06-03 21:53:49,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 174 transitions, 1700 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-03 21:53:49,467 INFO  L231             Difference]: Finished difference. Result has 174 places, 160 transitions, 1379 flow
[2024-06-03 21:53:49,467 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1379, PETRI_PLACES=174, PETRI_TRANSITIONS=160}
[2024-06-03 21:53:49,468 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 141 predicate places.
[2024-06-03 21:53:49,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 160 transitions, 1379 flow
[2024-06-03 21:53:49,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:53:49,468 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:49,468 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:53:49,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 21:53:49,469 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:53:49,469 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:49,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 181185077, now seen corresponding path program 3 times
[2024-06-03 21:53:49,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:49,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127006199]
[2024-06-03 21:53:49,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:49,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:49,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:59,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:59,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:59,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127006199]
[2024-06-03 21:53:59,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127006199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:59,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:59,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:53:59,960 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13269101]
[2024-06-03 21:53:59,960 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:59,960 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:53:59,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:59,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:53:59,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:00,144 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:54:00,144 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 160 transitions, 1379 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:00,144 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:00,144 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:54:00,145 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:00,532 INFO  L124   PetriNetUnfolderBase]: 409/749 cut-off events.
[2024-06-03 21:54:00,532 INFO  L125   PetriNetUnfolderBase]: For 33970/33970 co-relation queries the response was YES.
[2024-06-03 21:54:00,538 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5050 conditions, 749 events. 409/749 cut-off events. For 33970/33970 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3467 event pairs, 85 based on Foata normal form. 2/751 useless extension candidates. Maximal degree in co-relation 4969. Up to 601 conditions per place. 
[2024-06-03 21:54:00,540 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 138 selfloop transitions, 41 changer transitions 0/182 dead transitions.
[2024-06-03 21:54:00,540 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 182 transitions, 1949 flow
[2024-06-03 21:54:00,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:54:00,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:54:00,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions.
[2024-06-03 21:54:00,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38823529411764707
[2024-06-03 21:54:00,556 INFO  L175             Difference]: Start difference. First operand has 174 places, 160 transitions, 1379 flow. Second operand 10 states and 132 transitions.
[2024-06-03 21:54:00,557 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 182 transitions, 1949 flow
[2024-06-03 21:54:00,602 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 182 transitions, 1884 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-06-03 21:54:00,604 INFO  L231             Difference]: Finished difference. Result has 176 places, 164 transitions, 1481 flow
[2024-06-03 21:54:00,604 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1481, PETRI_PLACES=176, PETRI_TRANSITIONS=164}
[2024-06-03 21:54:00,604 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 143 predicate places.
[2024-06-03 21:54:00,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 164 transitions, 1481 flow
[2024-06-03 21:54:00,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:00,605 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:00,605 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:54:00,605 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 21:54:00,605 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:54:00,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:00,606 INFO  L85        PathProgramCache]: Analyzing trace with hash -363721453, now seen corresponding path program 4 times
[2024-06-03 21:54:00,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:00,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114804608]
[2024-06-03 21:54:00,606 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:00,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:00,635 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:11,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 21:54:11,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:11,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114804608]
[2024-06-03 21:54:11,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114804608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:11,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:11,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:11,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722276767]
[2024-06-03 21:54:11,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:11,015 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:11,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:11,016 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:11,016 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:11,127 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:54:11,127 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 164 transitions, 1481 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:11,127 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:11,127 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:54:11,127 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:11,654 INFO  L124   PetriNetUnfolderBase]: 410/751 cut-off events.
[2024-06-03 21:54:11,654 INFO  L125   PetriNetUnfolderBase]: For 35262/35262 co-relation queries the response was YES.
[2024-06-03 21:54:11,657 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5146 conditions, 751 events. 410/751 cut-off events. For 35262/35262 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3480 event pairs, 87 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 5064. Up to 604 conditions per place. 
[2024-06-03 21:54:11,659 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 141 selfloop transitions, 40 changer transitions 0/184 dead transitions.
[2024-06-03 21:54:11,659 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 2023 flow
[2024-06-03 21:54:11,661 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:54:11,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:54:11,661 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-03 21:54:11,662 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3911764705882353
[2024-06-03 21:54:11,662 INFO  L175             Difference]: Start difference. First operand has 176 places, 164 transitions, 1481 flow. Second operand 10 states and 133 transitions.
[2024-06-03 21:54:11,662 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 2023 flow
[2024-06-03 21:54:11,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 184 transitions, 1942 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 21:54:11,698 INFO  L231             Difference]: Finished difference. Result has 180 places, 166 transitions, 1527 flow
[2024-06-03 21:54:11,699 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1527, PETRI_PLACES=180, PETRI_TRANSITIONS=166}
[2024-06-03 21:54:11,699 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 147 predicate places.
[2024-06-03 21:54:11,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 166 transitions, 1527 flow
[2024-06-03 21:54:11,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:11,699 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:11,700 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:54:11,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 21:54:11,700 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:54:11,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:11,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -437920109, now seen corresponding path program 5 times
[2024-06-03 21:54:11,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:11,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806557190]
[2024-06-03 21:54:11,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:11,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:11,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:21,300 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:54:21,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:21,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806557190]
[2024-06-03 21:54:21,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806557190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:21,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:21,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:21,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715475974]
[2024-06-03 21:54:21,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:21,301 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:21,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:21,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:21,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:21,447 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:54:21,448 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 166 transitions, 1527 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:21,448 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:21,448 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:54:21,448 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:21,939 INFO  L124   PetriNetUnfolderBase]: 416/764 cut-off events.
[2024-06-03 21:54:21,939 INFO  L125   PetriNetUnfolderBase]: For 36892/36892 co-relation queries the response was YES.
[2024-06-03 21:54:21,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5288 conditions, 764 events. 416/764 cut-off events. For 36892/36892 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3571 event pairs, 54 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 5204. Up to 655 conditions per place. 
[2024-06-03 21:54:21,944 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 153 selfloop transitions, 28 changer transitions 0/184 dead transitions.
[2024-06-03 21:54:21,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 184 transitions, 1981 flow
[2024-06-03 21:54:21,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:54:21,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:54:21,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions.
[2024-06-03 21:54:21,945 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37941176470588234
[2024-06-03 21:54:21,946 INFO  L175             Difference]: Start difference. First operand has 180 places, 166 transitions, 1527 flow. Second operand 10 states and 129 transitions.
[2024-06-03 21:54:21,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 184 transitions, 1981 flow
[2024-06-03 21:54:21,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 184 transitions, 1885 flow, removed 16 selfloop flow, removed 7 redundant places.
[2024-06-03 21:54:21,982 INFO  L231             Difference]: Finished difference. Result has 183 places, 168 transitions, 1538 flow
[2024-06-03 21:54:21,982 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1431, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1538, PETRI_PLACES=183, PETRI_TRANSITIONS=168}
[2024-06-03 21:54:21,982 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 150 predicate places.
[2024-06-03 21:54:21,982 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 168 transitions, 1538 flow
[2024-06-03 21:54:21,983 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:21,983 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:21,983 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:54:21,983 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 21:54:21,983 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:54:21,983 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:21,983 INFO  L85        PathProgramCache]: Analyzing trace with hash 257278715, now seen corresponding path program 6 times
[2024-06-03 21:54:21,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:21,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977003810]
[2024-06-03 21:54:21,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:21,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:22,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:30,400 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:54:30,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:30,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977003810]
[2024-06-03 21:54:30,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977003810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:30,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:30,401 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:30,401 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360313207]
[2024-06-03 21:54:30,401 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:30,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:30,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:30,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:30,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:30,549 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:54:30,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 168 transitions, 1538 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:30,550 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:30,550 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:54:30,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:30,970 INFO  L124   PetriNetUnfolderBase]: 432/792 cut-off events.
[2024-06-03 21:54:30,971 INFO  L125   PetriNetUnfolderBase]: For 40895/40895 co-relation queries the response was YES.
[2024-06-03 21:54:30,975 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5598 conditions, 792 events. 432/792 cut-off events. For 40895/40895 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3734 event pairs, 54 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 5513. Up to 652 conditions per place. 
[2024-06-03 21:54:30,977 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 150 selfloop transitions, 36 changer transitions 0/189 dead transitions.
[2024-06-03 21:54:30,977 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 189 transitions, 2142 flow
[2024-06-03 21:54:30,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:54:30,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:54:30,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-03 21:54:30,978 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3911764705882353
[2024-06-03 21:54:30,979 INFO  L175             Difference]: Start difference. First operand has 183 places, 168 transitions, 1538 flow. Second operand 10 states and 133 transitions.
[2024-06-03 21:54:30,979 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 189 transitions, 2142 flow
[2024-06-03 21:54:31,019 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 189 transitions, 2051 flow, removed 19 selfloop flow, removed 8 redundant places.
[2024-06-03 21:54:31,021 INFO  L231             Difference]: Finished difference. Result has 185 places, 172 transitions, 1620 flow
[2024-06-03 21:54:31,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1620, PETRI_PLACES=185, PETRI_TRANSITIONS=172}
[2024-06-03 21:54:31,021 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 152 predicate places.
[2024-06-03 21:54:31,021 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 172 transitions, 1620 flow
[2024-06-03 21:54:31,022 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:31,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:31,022 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:54:31,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 21:54:31,022 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:54:31,022 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:31,023 INFO  L85        PathProgramCache]: Analyzing trace with hash 257272205, now seen corresponding path program 7 times
[2024-06-03 21:54:31,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:31,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319489912]
[2024-06-03 21:54:31,023 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:31,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:31,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:39,356 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:54:39,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:39,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319489912]
[2024-06-03 21:54:39,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319489912] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:39,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:39,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:39,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248089009]
[2024-06-03 21:54:39,358 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:39,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:39,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:39,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:39,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:39,546 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:54:39,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 172 transitions, 1620 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:39,547 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:39,547 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:54:39,547 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:39,995 INFO  L124   PetriNetUnfolderBase]: 428/788 cut-off events.
[2024-06-03 21:54:39,996 INFO  L125   PetriNetUnfolderBase]: For 40883/40883 co-relation queries the response was YES.
[2024-06-03 21:54:40,000 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5516 conditions, 788 events. 428/788 cut-off events. For 40883/40883 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3728 event pairs, 56 based on Foata normal form. 2/790 useless extension candidates. Maximal degree in co-relation 5430. Up to 649 conditions per place. 
[2024-06-03 21:54:40,003 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 150 selfloop transitions, 35 changer transitions 0/188 dead transitions.
[2024-06-03 21:54:40,003 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 188 transitions, 2042 flow
[2024-06-03 21:54:40,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:54:40,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:54:40,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-03 21:54:40,005 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3911764705882353
[2024-06-03 21:54:40,005 INFO  L175             Difference]: Start difference. First operand has 185 places, 172 transitions, 1620 flow. Second operand 10 states and 133 transitions.
[2024-06-03 21:54:40,005 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 188 transitions, 2042 flow
[2024-06-03 21:54:40,048 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 188 transitions, 1929 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-03 21:54:40,050 INFO  L231             Difference]: Finished difference. Result has 189 places, 172 transitions, 1582 flow
[2024-06-03 21:54:40,050 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1582, PETRI_PLACES=189, PETRI_TRANSITIONS=172}
[2024-06-03 21:54:40,051 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 156 predicate places.
[2024-06-03 21:54:40,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 172 transitions, 1582 flow
[2024-06-03 21:54:40,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:40,051 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:40,051 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:54:40,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 21:54:40,051 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:54:40,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:40,052 INFO  L85        PathProgramCache]: Analyzing trace with hash 430007863, now seen corresponding path program 3 times
[2024-06-03 21:54:40,052 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:40,052 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224392293]
[2024-06-03 21:54:40,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:40,052 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:40,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:49,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:49,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:49,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224392293]
[2024-06-03 21:54:49,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224392293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:49,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:49,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:54:49,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826095612]
[2024-06-03 21:54:49,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:49,993 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:54:49,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:49,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:54:49,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:54:50,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:54:50,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 172 transitions, 1582 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:50,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:50,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:54:50,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:50,461 INFO  L124   PetriNetUnfolderBase]: 436/799 cut-off events.
[2024-06-03 21:54:50,461 INFO  L125   PetriNetUnfolderBase]: For 42069/42069 co-relation queries the response was YES.
[2024-06-03 21:54:50,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5647 conditions, 799 events. 436/799 cut-off events. For 42069/42069 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3757 event pairs, 96 based on Foata normal form. 1/800 useless extension candidates. Maximal degree in co-relation 5559. Up to 678 conditions per place. 
[2024-06-03 21:54:50,468 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 144 selfloop transitions, 42 changer transitions 0/189 dead transitions.
[2024-06-03 21:54:50,468 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 189 transitions, 2132 flow
[2024-06-03 21:54:50,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:54:50,468 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:54:50,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions.
[2024-06-03 21:54:50,469 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3735294117647059
[2024-06-03 21:54:50,469 INFO  L175             Difference]: Start difference. First operand has 189 places, 172 transitions, 1582 flow. Second operand 10 states and 127 transitions.
[2024-06-03 21:54:50,469 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 189 transitions, 2132 flow
[2024-06-03 21:54:50,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 189 transitions, 2048 flow, removed 4 selfloop flow, removed 9 redundant places.
[2024-06-03 21:54:50,519 INFO  L231             Difference]: Finished difference. Result has 190 places, 176 transitions, 1647 flow
[2024-06-03 21:54:50,519 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1647, PETRI_PLACES=190, PETRI_TRANSITIONS=176}
[2024-06-03 21:54:50,519 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 157 predicate places.
[2024-06-03 21:54:50,519 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 176 transitions, 1647 flow
[2024-06-03 21:54:50,520 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:54:50,520 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:50,520 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:54:50,520 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 21:54:50,520 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:54:50,520 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:50,520 INFO  L85        PathProgramCache]: Analyzing trace with hash 430008173, now seen corresponding path program 1 times
[2024-06-03 21:54:50,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:50,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523786975]
[2024-06-03 21:54:50,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:50,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:50,570 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:00,216 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:00,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:00,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523786975]
[2024-06-03 21:55:00,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523786975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:00,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:00,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:00,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452130398]
[2024-06-03 21:55:00,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:00,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:00,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:00,217 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:00,217 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:00,442 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:55:00,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 176 transitions, 1647 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:55:00,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:00,443 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:55:00,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:00,782 INFO  L124   PetriNetUnfolderBase]: 415/775 cut-off events.
[2024-06-03 21:55:00,782 INFO  L125   PetriNetUnfolderBase]: For 44701/44702 co-relation queries the response was YES.
[2024-06-03 21:55:00,786 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5524 conditions, 775 events. 415/775 cut-off events. For 44701/44702 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3729 event pairs, 110 based on Foata normal form. 2/773 useless extension candidates. Maximal degree in co-relation 5435. Up to 649 conditions per place. 
[2024-06-03 21:55:00,788 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 143 selfloop transitions, 19 changer transitions 0/190 dead transitions.
[2024-06-03 21:55:00,788 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 190 transitions, 2021 flow
[2024-06-03 21:55:00,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:55:00,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:55:00,789 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions.
[2024-06-03 21:55:00,789 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38235294117647056
[2024-06-03 21:55:00,790 INFO  L175             Difference]: Start difference. First operand has 190 places, 176 transitions, 1647 flow. Second operand 10 states and 130 transitions.
[2024-06-03 21:55:00,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 190 transitions, 2021 flow
[2024-06-03 21:55:00,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 190 transitions, 1951 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-03 21:55:00,839 INFO  L231             Difference]: Finished difference. Result has 194 places, 178 transitions, 1644 flow
[2024-06-03 21:55:00,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1644, PETRI_PLACES=194, PETRI_TRANSITIONS=178}
[2024-06-03 21:55:00,840 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 161 predicate places.
[2024-06-03 21:55:00,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 178 transitions, 1644 flow
[2024-06-03 21:55:00,840 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:55:00,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:00,840 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:55:00,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 21:55:00,841 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:55:00,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:00,841 INFO  L85        PathProgramCache]: Analyzing trace with hash 429999245, now seen corresponding path program 8 times
[2024-06-03 21:55:00,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:00,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636635201]
[2024-06-03 21:55:00,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:00,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:00,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:10,398 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:10,399 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:10,399 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636635201]
[2024-06-03 21:55:10,399 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636635201] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:10,399 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:10,399 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:10,399 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291124914]
[2024-06-03 21:55:10,399 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:10,400 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:10,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:10,400 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:10,400 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:10,486 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:55:10,486 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 178 transitions, 1644 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:10,486 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:10,487 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:55:10,487 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:10,939 INFO  L124   PetriNetUnfolderBase]: 455/832 cut-off events.
[2024-06-03 21:55:10,939 INFO  L125   PetriNetUnfolderBase]: For 49488/49488 co-relation queries the response was YES.
[2024-06-03 21:55:10,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 832 events. 455/832 cut-off events. For 49488/49488 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3957 event pairs, 54 based on Foata normal form. 2/834 useless extension candidates. Maximal degree in co-relation 6029. Up to 598 conditions per place. 
[2024-06-03 21:55:10,946 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 130 selfloop transitions, 65 changer transitions 0/198 dead transitions.
[2024-06-03 21:55:10,946 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 198 transitions, 2278 flow
[2024-06-03 21:55:10,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:55:10,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:55:10,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-03 21:55:10,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3911764705882353
[2024-06-03 21:55:10,948 INFO  L175             Difference]: Start difference. First operand has 194 places, 178 transitions, 1644 flow. Second operand 10 states and 133 transitions.
[2024-06-03 21:55:10,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 198 transitions, 2278 flow
[2024-06-03 21:55:11,000 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 198 transitions, 2227 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-03 21:55:11,003 INFO  L231             Difference]: Finished difference. Result has 196 places, 182 transitions, 1832 flow
[2024-06-03 21:55:11,003 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1832, PETRI_PLACES=196, PETRI_TRANSITIONS=182}
[2024-06-03 21:55:11,003 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 163 predicate places.
[2024-06-03 21:55:11,003 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 182 transitions, 1832 flow
[2024-06-03 21:55:11,003 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:11,003 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:11,004 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:55:11,004 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 21:55:11,004 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:55:11,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:11,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 429768853, now seen corresponding path program 4 times
[2024-06-03 21:55:11,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:11,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294422051]
[2024-06-03 21:55:11,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:11,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:11,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:21,625 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:21,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:21,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294422051]
[2024-06-03 21:55:21,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294422051] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:21,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:21,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:21,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479458330]
[2024-06-03 21:55:21,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:21,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:21,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:21,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:21,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:21,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:55:21,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 182 transitions, 1832 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:21,764 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:21,764 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:55:21,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:22,128 INFO  L124   PetriNetUnfolderBase]: 458/838 cut-off events.
[2024-06-03 21:55:22,129 INFO  L125   PetriNetUnfolderBase]: For 50968/50968 co-relation queries the response was YES.
[2024-06-03 21:55:22,133 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6344 conditions, 838 events. 458/838 cut-off events. For 50968/50968 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3991 event pairs, 98 based on Foata normal form. 1/839 useless extension candidates. Maximal degree in co-relation 6252. Up to 713 conditions per place. 
[2024-06-03 21:55:22,136 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 39 changer transitions 0/197 dead transitions.
[2024-06-03 21:55:22,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 197 transitions, 2378 flow
[2024-06-03 21:55:22,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:55:22,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:55:22,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions.
[2024-06-03 21:55:22,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37941176470588234
[2024-06-03 21:55:22,140 INFO  L175             Difference]: Start difference. First operand has 196 places, 182 transitions, 1832 flow. Second operand 10 states and 129 transitions.
[2024-06-03 21:55:22,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 197 transitions, 2378 flow
[2024-06-03 21:55:22,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 197 transitions, 2270 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-03 21:55:22,203 INFO  L231             Difference]: Finished difference. Result has 200 places, 184 transitions, 1837 flow
[2024-06-03 21:55:22,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1837, PETRI_PLACES=200, PETRI_TRANSITIONS=184}
[2024-06-03 21:55:22,204 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 167 predicate places.
[2024-06-03 21:55:22,204 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 184 transitions, 1837 flow
[2024-06-03 21:55:22,204 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:22,204 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:22,205 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:55:22,205 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 21:55:22,205 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:55:22,205 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:22,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 429999493, now seen corresponding path program 5 times
[2024-06-03 21:55:22,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:22,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979879306]
[2024-06-03 21:55:22,206 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:22,206 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:22,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:32,720 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:32,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:32,721 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979879306]
[2024-06-03 21:55:32,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979879306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:32,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:32,721 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:32,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212219354]
[2024-06-03 21:55:32,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:32,722 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:32,722 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:32,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:32,722 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:32,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:55:32,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 184 transitions, 1837 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:32,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:32,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:55:32,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:33,217 INFO  L124   PetriNetUnfolderBase]: 456/834 cut-off events.
[2024-06-03 21:55:33,217 INFO  L125   PetriNetUnfolderBase]: For 50706/50706 co-relation queries the response was YES.
[2024-06-03 21:55:33,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6250 conditions, 834 events. 456/834 cut-off events. For 50706/50706 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3977 event pairs, 98 based on Foata normal form. 1/835 useless extension candidates. Maximal degree in co-relation 6156. Up to 711 conditions per place. 
[2024-06-03 21:55:33,225 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 152 selfloop transitions, 41 changer transitions 0/196 dead transitions.
[2024-06-03 21:55:33,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 196 transitions, 2253 flow
[2024-06-03 21:55:33,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:55:33,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:55:33,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions.
[2024-06-03 21:55:33,227 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3735294117647059
[2024-06-03 21:55:33,227 INFO  L175             Difference]: Start difference. First operand has 200 places, 184 transitions, 1837 flow. Second operand 10 states and 127 transitions.
[2024-06-03 21:55:33,228 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 196 transitions, 2253 flow
[2024-06-03 21:55:33,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 196 transitions, 2144 flow, removed 22 selfloop flow, removed 7 redundant places.
[2024-06-03 21:55:33,297 INFO  L231             Difference]: Finished difference. Result has 203 places, 184 transitions, 1815 flow
[2024-06-03 21:55:33,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1728, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1815, PETRI_PLACES=203, PETRI_TRANSITIONS=184}
[2024-06-03 21:55:33,297 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 170 predicate places.
[2024-06-03 21:55:33,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 184 transitions, 1815 flow
[2024-06-03 21:55:33,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:33,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:33,298 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:55:33,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 21:55:33,298 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:55:33,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:33,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 1604021997, now seen corresponding path program 9 times
[2024-06-03 21:55:33,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:33,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410325103]
[2024-06-03 21:55:33,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:33,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:33,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:42,596 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:42,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:42,597 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410325103]
[2024-06-03 21:55:42,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410325103] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:42,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:42,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:55:42,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916085316]
[2024-06-03 21:55:42,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:42,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:55:42,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:42,601 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:55:42,601 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:55:42,750 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:55:42,751 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 184 transitions, 1815 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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 21:55:42,751 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:42,751 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:55:42,751 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:43,125 INFO  L124   PetriNetUnfolderBase]: 462/847 cut-off events.
[2024-06-03 21:55:43,125 INFO  L125   PetriNetUnfolderBase]: For 53972/53972 co-relation queries the response was YES.
[2024-06-03 21:55:43,130 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 847 events. 462/847 cut-off events. For 53972/53972 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4072 event pairs, 62 based on Foata normal form. 2/849 useless extension candidates. Maximal degree in co-relation 6267. Up to 606 conditions per place. 
[2024-06-03 21:55:43,132 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 141 selfloop transitions, 59 changer transitions 0/203 dead transitions.
[2024-06-03 21:55:43,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 203 transitions, 2521 flow
[2024-06-03 21:55:43,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:55:43,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:55:43,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions.
[2024-06-03 21:55:43,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41830065359477125
[2024-06-03 21:55:43,135 INFO  L175             Difference]: Start difference. First operand has 203 places, 184 transitions, 1815 flow. Second operand 9 states and 128 transitions.
[2024-06-03 21:55:43,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 203 transitions, 2521 flow
[2024-06-03 21:55:43,205 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 203 transitions, 2417 flow, removed 0 selfloop flow, removed 10 redundant places.
[2024-06-03 21:55:43,207 INFO  L231             Difference]: Finished difference. Result has 202 places, 186 transitions, 1888 flow
[2024-06-03 21:55:43,208 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1711, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1888, PETRI_PLACES=202, PETRI_TRANSITIONS=186}
[2024-06-03 21:55:43,208 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 169 predicate places.
[2024-06-03 21:55:43,208 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 186 transitions, 1888 flow
[2024-06-03 21:55:43,208 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 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 21:55:43,208 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:43,209 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:55:43,209 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-03 21:55:43,209 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:55:43,209 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:43,209 INFO  L85        PathProgramCache]: Analyzing trace with hash 1604028507, now seen corresponding path program 10 times
[2024-06-03 21:55:43,209 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:43,209 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017613249]
[2024-06-03 21:55:43,210 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:43,210 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:43,241 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:52,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:52,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:52,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017613249]
[2024-06-03 21:55:52,683 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017613249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:52,683 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:52,683 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:52,683 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835459286]
[2024-06-03 21:55:52,683 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:52,683 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:52,683 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:52,684 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:52,684 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:52,791 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:55:52,791 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 186 transitions, 1888 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:52,791 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:52,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:55:52,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:53,213 INFO  L124   PetriNetUnfolderBase]: 458/841 cut-off events.
[2024-06-03 21:55:53,215 INFO  L125   PetriNetUnfolderBase]: For 53718/53718 co-relation queries the response was YES.
[2024-06-03 21:55:53,219 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6302 conditions, 841 events. 458/841 cut-off events. For 53718/53718 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4050 event pairs, 61 based on Foata normal form. 2/843 useless extension candidates. Maximal degree in co-relation 6207. Up to 603 conditions per place. 
[2024-06-03 21:55:53,222 INFO  L140   encePairwiseOnDemand]: 22/34 looper letters, 141 selfloop transitions, 59 changer transitions 0/203 dead transitions.
[2024-06-03 21:55:53,222 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 203 transitions, 2446 flow
[2024-06-03 21:55:53,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:55:53,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:55:53,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions.
[2024-06-03 21:55:53,224 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-03 21:55:53,225 INFO  L175             Difference]: Start difference. First operand has 202 places, 186 transitions, 1888 flow. Second operand 10 states and 136 transitions.
[2024-06-03 21:55:53,225 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 203 transitions, 2446 flow
[2024-06-03 21:55:53,304 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 203 transitions, 2201 flow, removed 45 selfloop flow, removed 8 redundant places.
[2024-06-03 21:55:53,306 INFO  L231             Difference]: Finished difference. Result has 204 places, 186 transitions, 1766 flow
[2024-06-03 21:55:53,306 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1766, PETRI_PLACES=204, PETRI_TRANSITIONS=186}
[2024-06-03 21:55:53,307 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 171 predicate places.
[2024-06-03 21:55:53,307 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 186 transitions, 1766 flow
[2024-06-03 21:55:53,308 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:55:53,308 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:53,308 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:55:53,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-03 21:55:53,308 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:55:53,309 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:53,309 INFO  L85        PathProgramCache]: Analyzing trace with hash -425594963, now seen corresponding path program 11 times
[2024-06-03 21:55:53,309 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:53,309 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219079102]
[2024-06-03 21:55:53,309 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:53,309 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:53,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:03,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:03,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:03,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219079102]
[2024-06-03 21:56:03,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219079102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:03,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:03,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:03,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075303184]
[2024-06-03 21:56:03,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:03,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:03,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:03,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:03,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:03,440 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:56:03,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 186 transitions, 1766 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:03,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:03,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:56:03,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:03,937 INFO  L124   PetriNetUnfolderBase]: 462/846 cut-off events.
[2024-06-03 21:56:03,938 INFO  L125   PetriNetUnfolderBase]: For 55122/55122 co-relation queries the response was YES.
[2024-06-03 21:56:03,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6112 conditions, 846 events. 462/846 cut-off events. For 55122/55122 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4073 event pairs, 96 based on Foata normal form. 3/849 useless extension candidates. Maximal degree in co-relation 6017. Up to 690 conditions per place. 
[2024-06-03 21:56:03,944 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 157 selfloop transitions, 44 changer transitions 0/204 dead transitions.
[2024-06-03 21:56:03,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 204 transitions, 2262 flow
[2024-06-03 21:56:03,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:03,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:03,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions.
[2024-06-03 21:56:03,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38562091503267976
[2024-06-03 21:56:03,946 INFO  L175             Difference]: Start difference. First operand has 204 places, 186 transitions, 1766 flow. Second operand 9 states and 118 transitions.
[2024-06-03 21:56:03,946 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 204 transitions, 2262 flow
[2024-06-03 21:56:04,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 204 transitions, 2079 flow, removed 12 selfloop flow, removed 10 redundant places.
[2024-06-03 21:56:04,018 INFO  L231             Difference]: Finished difference. Result has 203 places, 188 transitions, 1737 flow
[2024-06-03 21:56:04,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1737, PETRI_PLACES=203, PETRI_TRANSITIONS=188}
[2024-06-03 21:56:04,019 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 170 predicate places.
[2024-06-03 21:56:04,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 188 transitions, 1737 flow
[2024-06-03 21:56:04,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:04,019 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:04,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 21:56:04,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-03 21:56:04,020 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:56:04,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:04,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -591649253, now seen corresponding path program 12 times
[2024-06-03 21:56:04,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:04,020 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870118736]
[2024-06-03 21:56:04,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:04,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:04,050 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:14,205 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:14,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:14,206 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870118736]
[2024-06-03 21:56:14,206 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870118736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:14,206 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:14,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:14,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979185208]
[2024-06-03 21:56:14,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:14,207 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:14,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:14,207 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:14,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:14,376 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:56:14,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 188 transitions, 1737 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:14,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:14,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:56:14,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:14,829 INFO  L124   PetriNetUnfolderBase]: 478/872 cut-off events.
[2024-06-03 21:56:14,829 INFO  L125   PetriNetUnfolderBase]: For 58864/58864 co-relation queries the response was YES.
[2024-06-03 21:56:14,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6447 conditions, 872 events. 478/872 cut-off events. For 58864/58864 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4198 event pairs, 86 based on Foata normal form. 2/874 useless extension candidates. Maximal degree in co-relation 6351. Up to 635 conditions per place. 
[2024-06-03 21:56:14,836 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 138 selfloop transitions, 67 changer transitions 0/208 dead transitions.
[2024-06-03 21:56:14,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 208 transitions, 2403 flow
[2024-06-03 21:56:14,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:14,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:14,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions.
[2024-06-03 21:56:14,845 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39215686274509803
[2024-06-03 21:56:14,845 INFO  L175             Difference]: Start difference. First operand has 203 places, 188 transitions, 1737 flow. Second operand 9 states and 120 transitions.
[2024-06-03 21:56:14,845 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 208 transitions, 2403 flow
[2024-06-03 21:56:14,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 2255 flow, removed 37 selfloop flow, removed 7 redundant places.
[2024-06-03 21:56:14,925 INFO  L231             Difference]: Finished difference. Result has 205 places, 192 transitions, 1844 flow
[2024-06-03 21:56:14,926 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1844, PETRI_PLACES=205, PETRI_TRANSITIONS=192}
[2024-06-03 21:56:14,926 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 172 predicate places.
[2024-06-03 21:56:14,927 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 192 transitions, 1844 flow
[2024-06-03 21:56:14,927 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:14,927 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:14,927 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:56:14,927 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-03 21:56:14,927 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:56:14,927 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:14,928 INFO  L85        PathProgramCache]: Analyzing trace with hash -591649005, now seen corresponding path program 6 times
[2024-06-03 21:56:14,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:14,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016025770]
[2024-06-03 21:56:14,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:14,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:14,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:25,376 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:25,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:25,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016025770]
[2024-06-03 21:56:25,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016025770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:25,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:25,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:25,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157279285]
[2024-06-03 21:56:25,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:25,379 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:25,379 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:25,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:25,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:25,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:56:25,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 192 transitions, 1844 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:25,515 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:25,515 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:56:25,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:25,962 INFO  L124   PetriNetUnfolderBase]: 481/878 cut-off events.
[2024-06-03 21:56:25,963 INFO  L125   PetriNetUnfolderBase]: For 53321/53321 co-relation queries the response was YES.
[2024-06-03 21:56:25,968 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6383 conditions, 878 events. 481/878 cut-off events. For 53321/53321 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4241 event pairs, 112 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 6286. Up to 771 conditions per place. 
[2024-06-03 21:56:25,971 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 168 selfloop transitions, 35 changer transitions 0/206 dead transitions.
[2024-06-03 21:56:25,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 2312 flow
[2024-06-03 21:56:25,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:25,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:25,972 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions.
[2024-06-03 21:56:25,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.369281045751634
[2024-06-03 21:56:25,972 INFO  L175             Difference]: Start difference. First operand has 205 places, 192 transitions, 1844 flow. Second operand 9 states and 113 transitions.
[2024-06-03 21:56:25,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 2312 flow
[2024-06-03 21:56:26,051 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 206 transitions, 2202 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-03 21:56:26,054 INFO  L231             Difference]: Finished difference. Result has 206 places, 194 transitions, 1851 flow
[2024-06-03 21:56:26,054 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1734, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1851, PETRI_PLACES=206, PETRI_TRANSITIONS=194}
[2024-06-03 21:56:26,054 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 173 predicate places.
[2024-06-03 21:56:26,054 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 194 transitions, 1851 flow
[2024-06-03 21:56:26,054 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:26,055 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:26,055 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:56:26,055 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-03 21:56:26,055 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:56:26,055 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:26,055 INFO  L85        PathProgramCache]: Analyzing trace with hash -591655763, now seen corresponding path program 13 times
[2024-06-03 21:56:26,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:26,056 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858910064]
[2024-06-03 21:56:26,056 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:26,056 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:26,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:36,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:36,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:36,155 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858910064]
[2024-06-03 21:56:36,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858910064] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:36,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:36,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:36,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065415155]
[2024-06-03 21:56:36,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:36,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:36,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:36,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:36,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:36,366 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:56:36,366 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 194 transitions, 1851 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:36,366 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:36,367 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:56:36,367 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:36,826 INFO  L124   PetriNetUnfolderBase]: 477/875 cut-off events.
[2024-06-03 21:56:36,827 INFO  L125   PetriNetUnfolderBase]: For 49645/49645 co-relation queries the response was YES.
[2024-06-03 21:56:36,832 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6209 conditions, 875 events. 477/875 cut-off events. For 49645/49645 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4277 event pairs, 92 based on Foata normal form. 2/877 useless extension candidates. Maximal degree in co-relation 6113. Up to 637 conditions per place. 
[2024-06-03 21:56:36,834 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 144 selfloop transitions, 62 changer transitions 0/209 dead transitions.
[2024-06-03 21:56:36,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 209 transitions, 2311 flow
[2024-06-03 21:56:36,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:36,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:36,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions.
[2024-06-03 21:56:36,836 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39215686274509803
[2024-06-03 21:56:36,836 INFO  L175             Difference]: Start difference. First operand has 206 places, 194 transitions, 1851 flow. Second operand 9 states and 120 transitions.
[2024-06-03 21:56:36,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 209 transitions, 2311 flow
[2024-06-03 21:56:36,901 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 209 transitions, 2200 flow, removed 25 selfloop flow, removed 7 redundant places.
[2024-06-03 21:56:36,903 INFO  L231             Difference]: Finished difference. Result has 208 places, 194 transitions, 1875 flow
[2024-06-03 21:56:36,904 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1740, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1875, PETRI_PLACES=208, PETRI_TRANSITIONS=194}
[2024-06-03 21:56:36,904 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 175 predicate places.
[2024-06-03 21:56:36,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 194 transitions, 1875 flow
[2024-06-03 21:56:36,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:36,905 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:36,905 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:56:36,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-03 21:56:36,905 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:56:36,905 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:36,905 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416685633, now seen corresponding path program 14 times
[2024-06-03 21:56:36,905 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:36,905 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793770988]
[2024-06-03 21:56:36,906 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:36,906 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:36,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:47,065 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:47,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:47,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793770988]
[2024-06-03 21:56:47,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793770988] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:47,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:47,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:47,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773395490]
[2024-06-03 21:56:47,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:47,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:47,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:47,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:47,067 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:47,243 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:56:47,244 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 194 transitions, 1875 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:47,244 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:47,244 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:56:47,244 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:47,712 INFO  L124   PetriNetUnfolderBase]: 503/920 cut-off events.
[2024-06-03 21:56:47,712 INFO  L125   PetriNetUnfolderBase]: For 53598/53598 co-relation queries the response was YES.
[2024-06-03 21:56:47,717 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6697 conditions, 920 events. 503/920 cut-off events. For 53598/53598 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4523 event pairs, 66 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 6600. Up to 591 conditions per place. 
[2024-06-03 21:56:47,719 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 133 selfloop transitions, 80 changer transitions 0/216 dead transitions.
[2024-06-03 21:56:47,719 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 216 transitions, 2681 flow
[2024-06-03 21:56:47,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:47,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:47,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions.
[2024-06-03 21:56:47,720 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40522875816993464
[2024-06-03 21:56:47,722 INFO  L175             Difference]: Start difference. First operand has 208 places, 194 transitions, 1875 flow. Second operand 9 states and 124 transitions.
[2024-06-03 21:56:47,722 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 216 transitions, 2681 flow
[2024-06-03 21:56:47,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 216 transitions, 2494 flow, removed 14 selfloop flow, removed 12 redundant places.
[2024-06-03 21:56:47,794 INFO  L231             Difference]: Finished difference. Result has 205 places, 200 transitions, 2000 flow
[2024-06-03 21:56:47,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2000, PETRI_PLACES=205, PETRI_TRANSITIONS=200}
[2024-06-03 21:56:47,794 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 172 predicate places.
[2024-06-03 21:56:47,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 200 transitions, 2000 flow
[2024-06-03 21:56:47,794 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:47,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:47,795 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:56:47,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-03 21:56:47,795 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:56:47,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:47,795 INFO  L85        PathProgramCache]: Analyzing trace with hash -419159115, now seen corresponding path program 7 times
[2024-06-03 21:56:47,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:47,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087299916]
[2024-06-03 21:56:47,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:47,796 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:47,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:58,444 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:58,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:58,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087299916]
[2024-06-03 21:56:58,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087299916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:58,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:58,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:58,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330301165]
[2024-06-03 21:56:58,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:58,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:58,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:58,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:58,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:58,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:56:58,653 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 200 transitions, 2000 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58,653 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:58,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:56:58,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:59,079 INFO  L124   PetriNetUnfolderBase]: 511/934 cut-off events.
[2024-06-03 21:56:59,079 INFO  L125   PetriNetUnfolderBase]: For 51944/51944 co-relation queries the response was YES.
[2024-06-03 21:56:59,083 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6816 conditions, 934 events. 511/934 cut-off events. For 51944/51944 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4601 event pairs, 105 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 6722. Up to 766 conditions per place. 
[2024-06-03 21:56:59,086 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 158 selfloop transitions, 54 changer transitions 0/215 dead transitions.
[2024-06-03 21:56:59,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 215 transitions, 2602 flow
[2024-06-03 21:56:59,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:56:59,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:56:59,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions.
[2024-06-03 21:56:59,088 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38235294117647056
[2024-06-03 21:56:59,088 INFO  L175             Difference]: Start difference. First operand has 205 places, 200 transitions, 2000 flow. Second operand 9 states and 117 transitions.
[2024-06-03 21:56:59,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 215 transitions, 2602 flow
[2024-06-03 21:56:59,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 215 transitions, 2431 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-03 21:56:59,156 INFO  L231             Difference]: Finished difference. Result has 208 places, 204 transitions, 2007 flow
[2024-06-03 21:56:59,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2007, PETRI_PLACES=208, PETRI_TRANSITIONS=204}
[2024-06-03 21:56:59,157 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 175 predicate places.
[2024-06-03 21:56:59,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 2007 flow
[2024-06-03 21:56:59,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:59,157 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:56:59,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-03 21:56:59,158 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:56:59,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:59,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -419165873, now seen corresponding path program 15 times
[2024-06-03 21:56:59,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:59,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656995475]
[2024-06-03 21:56:59,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:59,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:59,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:09,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:09,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:09,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656995475]
[2024-06-03 21:57:09,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656995475] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:09,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:09,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:09,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84562591]
[2024-06-03 21:57:09,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:09,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:09,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:09,800 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:09,800 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:09,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:57:09,954 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 2007 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:09,954 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:09,954 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:57:09,954 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:10,401 INFO  L124   PetriNetUnfolderBase]: 507/928 cut-off events.
[2024-06-03 21:57:10,401 INFO  L125   PetriNetUnfolderBase]: For 49937/49937 co-relation queries the response was YES.
[2024-06-03 21:57:10,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6559 conditions, 928 events. 507/928 cut-off events. For 49937/49937 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4599 event pairs, 66 based on Foata normal form. 2/930 useless extension candidates. Maximal degree in co-relation 6465. Up to 601 conditions per place. 
[2024-06-03 21:57:10,410 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 133 selfloop transitions, 82 changer transitions 0/218 dead transitions.
[2024-06-03 21:57:10,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 218 transitions, 2577 flow
[2024-06-03 21:57:10,410 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:10,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:10,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions.
[2024-06-03 21:57:10,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3954248366013072
[2024-06-03 21:57:10,411 INFO  L175             Difference]: Start difference. First operand has 208 places, 204 transitions, 2007 flow. Second operand 9 states and 121 transitions.
[2024-06-03 21:57:10,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 218 transitions, 2577 flow
[2024-06-03 21:57:10,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 218 transitions, 2468 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-03 21:57:10,484 INFO  L231             Difference]: Finished difference. Result has 211 places, 204 transitions, 2072 flow
[2024-06-03 21:57:10,484 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2072, PETRI_PLACES=211, PETRI_TRANSITIONS=204}
[2024-06-03 21:57:10,484 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 178 predicate places.
[2024-06-03 21:57:10,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 204 transitions, 2072 flow
[2024-06-03 21:57:10,485 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:10,485 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:10,485 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:57:10,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-03 21:57:10,485 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:57:10,485 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:10,486 INFO  L85        PathProgramCache]: Analyzing trace with hash -418928723, now seen corresponding path program 16 times
[2024-06-03 21:57:10,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:10,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610069582]
[2024-06-03 21:57:10,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:10,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:10,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:21,064 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:21,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:21,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610069582]
[2024-06-03 21:57:21,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610069582] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:21,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:21,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:21,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517784569]
[2024-06-03 21:57:21,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:21,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:21,064 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:21,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:21,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:21,217 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:57:21,217 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 204 transitions, 2072 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:21,217 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:21,217 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:57:21,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:21,629 INFO  L124   PetriNetUnfolderBase]: 503/920 cut-off events.
[2024-06-03 21:57:21,629 INFO  L125   PetriNetUnfolderBase]: For 47574/47574 co-relation queries the response was YES.
[2024-06-03 21:57:21,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6521 conditions, 920 events. 503/920 cut-off events. For 47574/47574 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4544 event pairs, 53 based on Foata normal form. 2/922 useless extension candidates. Maximal degree in co-relation 6426. Up to 598 conditions per place. 
[2024-06-03 21:57:21,637 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 123 selfloop transitions, 91 changer transitions 0/217 dead transitions.
[2024-06-03 21:57:21,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 2542 flow
[2024-06-03 21:57:21,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:21,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:21,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions.
[2024-06-03 21:57:21,639 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-03 21:57:21,639 INFO  L175             Difference]: Start difference. First operand has 211 places, 204 transitions, 2072 flow. Second operand 9 states and 119 transitions.
[2024-06-03 21:57:21,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 2542 flow
[2024-06-03 21:57:21,702 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 2355 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-03 21:57:21,705 INFO  L231             Difference]: Finished difference. Result has 212 places, 204 transitions, 2075 flow
[2024-06-03 21:57:21,705 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2075, PETRI_PLACES=212, PETRI_TRANSITIONS=204}
[2024-06-03 21:57:21,706 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 179 predicate places.
[2024-06-03 21:57:21,706 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 204 transitions, 2075 flow
[2024-06-03 21:57:21,706 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:21,706 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:21,706 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:57:21,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-03 21:57:21,706 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:57:21,707 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:21,707 INFO  L85        PathProgramCache]: Analyzing trace with hash -418928475, now seen corresponding path program 8 times
[2024-06-03 21:57:21,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:21,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017573536]
[2024-06-03 21:57:21,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:21,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:21,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:32,431 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:32,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:32,431 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017573536]
[2024-06-03 21:57:32,431 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017573536] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:32,431 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:32,432 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:32,432 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858868100]
[2024-06-03 21:57:32,432 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:32,432 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:32,432 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:32,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:32,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:32,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:57:32,560 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 204 transitions, 2075 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:32,560 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:32,560 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:57:32,560 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:32,972 INFO  L124   PetriNetUnfolderBase]: 506/927 cut-off events.
[2024-06-03 21:57:32,972 INFO  L125   PetriNetUnfolderBase]: For 46318/46318 co-relation queries the response was YES.
[2024-06-03 21:57:32,977 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6561 conditions, 927 events. 506/927 cut-off events. For 46318/46318 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4575 event pairs, 103 based on Foata normal form. 1/928 useless extension candidates. Maximal degree in co-relation 6466. Up to 758 conditions per place. 
[2024-06-03 21:57:32,980 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 155 selfloop transitions, 59 changer transitions 0/217 dead transitions.
[2024-06-03 21:57:32,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 217 transitions, 2655 flow
[2024-06-03 21:57:32,982 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:32,982 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:32,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions.
[2024-06-03 21:57:32,983 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3790849673202614
[2024-06-03 21:57:32,983 INFO  L175             Difference]: Start difference. First operand has 212 places, 204 transitions, 2075 flow. Second operand 9 states and 116 transitions.
[2024-06-03 21:57:32,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 217 transitions, 2655 flow
[2024-06-03 21:57:33,050 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 217 transitions, 2436 flow, removed 3 selfloop flow, removed 10 redundant places.
[2024-06-03 21:57:33,058 INFO  L231             Difference]: Finished difference. Result has 211 places, 206 transitions, 2014 flow
[2024-06-03 21:57:33,059 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2014, PETRI_PLACES=211, PETRI_TRANSITIONS=206}
[2024-06-03 21:57:33,059 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 178 predicate places.
[2024-06-03 21:57:33,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 2014 flow
[2024-06-03 21:57:33,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:33,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:33,060 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:57:33,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-03 21:57:33,060 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:57:33,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:33,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -418920105, now seen corresponding path program 9 times
[2024-06-03 21:57:33,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:33,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076935165]
[2024-06-03 21:57:33,061 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:33,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:33,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:43,767 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:43,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:43,767 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076935165]
[2024-06-03 21:57:43,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076935165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:43,768 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:43,768 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:43,768 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442258810]
[2024-06-03 21:57:43,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:43,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:43,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:43,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:43,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:43,927 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:57:43,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 2014 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:43,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:43,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:57:43,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:44,370 INFO  L124   PetriNetUnfolderBase]: 504/923 cut-off events.
[2024-06-03 21:57:44,371 INFO  L125   PetriNetUnfolderBase]: For 44733/44733 co-relation queries the response was YES.
[2024-06-03 21:57:44,376 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 923 events. 504/923 cut-off events. For 44733/44733 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4573 event pairs, 103 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 6271. Up to 756 conditions per place. 
[2024-06-03 21:57:44,378 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 149 selfloop transitions, 64 changer transitions 0/216 dead transitions.
[2024-06-03 21:57:44,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 2464 flow
[2024-06-03 21:57:44,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:44,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:44,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions.
[2024-06-03 21:57:44,379 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37254901960784315
[2024-06-03 21:57:44,380 INFO  L175             Difference]: Start difference. First operand has 211 places, 206 transitions, 2014 flow. Second operand 9 states and 114 transitions.
[2024-06-03 21:57:44,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 2464 flow
[2024-06-03 21:57:44,438 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 216 transitions, 2305 flow, removed 18 selfloop flow, removed 8 redundant places.
[2024-06-03 21:57:44,440 INFO  L231             Difference]: Finished difference. Result has 212 places, 206 transitions, 1991 flow
[2024-06-03 21:57:44,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1991, PETRI_PLACES=212, PETRI_TRANSITIONS=206}
[2024-06-03 21:57:44,444 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 179 predicate places.
[2024-06-03 21:57:44,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 206 transitions, 1991 flow
[2024-06-03 21:57:44,445 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:44,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:44,445 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:57:44,445 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-03 21:57:44,445 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:57:44,445 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:44,446 INFO  L85        PathProgramCache]: Analyzing trace with hash -418919795, now seen corresponding path program 2 times
[2024-06-03 21:57:44,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:44,446 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996276465]
[2024-06-03 21:57:44,446 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:44,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:44,476 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:55,106 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:55,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:55,107 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996276465]
[2024-06-03 21:57:55,107 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996276465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:55,107 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:55,107 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:55,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982861512]
[2024-06-03 21:57:55,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:55,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:55,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:55,109 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:55,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:55,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:57:55,252 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 206 transitions, 1991 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:57:55,252 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:55,252 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:57:55,252 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:55,746 INFO  L124   PetriNetUnfolderBase]: 480/896 cut-off events.
[2024-06-03 21:57:55,747 INFO  L125   PetriNetUnfolderBase]: For 44990/44991 co-relation queries the response was YES.
[2024-06-03 21:57:55,751 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6167 conditions, 896 events. 480/896 cut-off events. For 44990/44991 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4535 event pairs, 118 based on Foata normal form. 2/894 useless extension candidates. Maximal degree in co-relation 6072. Up to 737 conditions per place. 
[2024-06-03 21:57:55,753 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 159 selfloop transitions, 26 changer transitions 0/218 dead transitions.
[2024-06-03 21:57:55,753 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 2409 flow
[2024-06-03 21:57:55,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:55,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:55,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions.
[2024-06-03 21:57:55,755 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38562091503267976
[2024-06-03 21:57:55,756 INFO  L175             Difference]: Start difference. First operand has 212 places, 206 transitions, 1991 flow. Second operand 9 states and 118 transitions.
[2024-06-03 21:57:55,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 218 transitions, 2409 flow
[2024-06-03 21:57:55,820 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 218 transitions, 2268 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-03 21:57:55,822 INFO  L231             Difference]: Finished difference. Result has 212 places, 208 transitions, 1938 flow
[2024-06-03 21:57:55,823 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1938, PETRI_PLACES=212, PETRI_TRANSITIONS=208}
[2024-06-03 21:57:55,823 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 179 predicate places.
[2024-06-03 21:57:55,823 INFO  L495      AbstractCegarLoop]: Abstraction has has 212 places, 208 transitions, 1938 flow
[2024-06-03 21:57:55,823 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:57:55,823 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:55,824 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:57:55,824 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-03 21:57:55,824 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:57:55,824 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:55,824 INFO  L85        PathProgramCache]: Analyzing trace with hash -1087904843, now seen corresponding path program 10 times
[2024-06-03 21:57:55,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:55,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312012709]
[2024-06-03 21:57:55,825 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:55,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:55,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:06,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:58:06,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:06,760 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312012709]
[2024-06-03 21:58:06,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312012709] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:06,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:06,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:06,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335681103]
[2024-06-03 21:58:06,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:06,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:06,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:06,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:06,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:06,956 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:58:06,957 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 208 transitions, 1938 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:06,957 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:06,957 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:58:06,957 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:07,392 INFO  L124   PetriNetUnfolderBase]: 510/932 cut-off events.
[2024-06-03 21:58:07,392 INFO  L125   PetriNetUnfolderBase]: For 44399/44399 co-relation queries the response was YES.
[2024-06-03 21:58:07,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6360 conditions, 932 events. 510/932 cut-off events. For 44399/44399 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4606 event pairs, 103 based on Foata normal form. 1/933 useless extension candidates. Maximal degree in co-relation 6265. Up to 712 conditions per place. 
[2024-06-03 21:58:07,400 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 152 selfloop transitions, 69 changer transitions 0/224 dead transitions.
[2024-06-03 21:58:07,400 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 224 transitions, 2560 flow
[2024-06-03 21:58:07,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:58:07,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:58:07,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions.
[2024-06-03 21:58:07,401 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38235294117647056
[2024-06-03 21:58:07,401 INFO  L175             Difference]: Start difference. First operand has 212 places, 208 transitions, 1938 flow. Second operand 10 states and 130 transitions.
[2024-06-03 21:58:07,401 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 224 transitions, 2560 flow
[2024-06-03 21:58:07,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 224 transitions, 2490 flow, removed 12 selfloop flow, removed 7 redundant places.
[2024-06-03 21:58:07,470 INFO  L231             Difference]: Finished difference. Result has 215 places, 212 transitions, 2073 flow
[2024-06-03 21:58:07,471 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1870, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2073, PETRI_PLACES=215, PETRI_TRANSITIONS=212}
[2024-06-03 21:58:07,471 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 182 predicate places.
[2024-06-03 21:58:07,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 212 transitions, 2073 flow
[2024-06-03 21:58:07,471 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:07,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:07,471 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:07,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-03 21:58:07,472 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:58:07,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:07,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 176540483, now seen corresponding path program 17 times
[2024-06-03 21:58:07,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:07,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816155169]
[2024-06-03 21:58:07,473 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:07,473 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:07,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:17,995 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:17,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:17,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816155169]
[2024-06-03 21:58:17,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816155169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:17,995 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:17,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:17,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912396148]
[2024-06-03 21:58:17,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:17,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:17,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:17,996 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:17,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:18,186 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:58:18,186 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 212 transitions, 2073 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:18,186 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:18,186 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:58:18,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:18,611 INFO  L124   PetriNetUnfolderBase]: 531/972 cut-off events.
[2024-06-03 21:58:18,611 INFO  L125   PetriNetUnfolderBase]: For 50106/50106 co-relation queries the response was YES.
[2024-06-03 21:58:18,616 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6843 conditions, 972 events. 531/972 cut-off events. For 50106/50106 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4912 event pairs, 70 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 6747. Up to 583 conditions per place. 
[2024-06-03 21:58:18,620 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 141 selfloop transitions, 91 changer transitions 0/235 dead transitions.
[2024-06-03 21:58:18,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 235 transitions, 2903 flow
[2024-06-03 21:58:18,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:58:18,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:58:18,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions.
[2024-06-03 21:58:18,621 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-03 21:58:18,621 INFO  L175             Difference]: Start difference. First operand has 215 places, 212 transitions, 2073 flow. Second operand 10 states and 136 transitions.
[2024-06-03 21:58:18,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 235 transitions, 2903 flow
[2024-06-03 21:58:18,690 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 235 transitions, 2757 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-03 21:58:18,693 INFO  L231             Difference]: Finished difference. Result has 218 places, 218 transitions, 2238 flow
[2024-06-03 21:58:18,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1927, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2238, PETRI_PLACES=218, PETRI_TRANSITIONS=218}
[2024-06-03 21:58:18,693 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 185 predicate places.
[2024-06-03 21:58:18,693 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 218 transitions, 2238 flow
[2024-06-03 21:58:18,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:18,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:18,694 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:18,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-03 21:58:18,694 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:58:18,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:18,694 INFO  L85        PathProgramCache]: Analyzing trace with hash 176771123, now seen corresponding path program 18 times
[2024-06-03 21:58:18,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:18,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121694263]
[2024-06-03 21:58:18,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:18,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:18,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:29,279 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:29,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:29,280 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121694263]
[2024-06-03 21:58:29,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121694263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:29,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:29,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:29,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899927535]
[2024-06-03 21:58:29,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:29,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:29,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:29,281 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:29,282 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:29,450 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:58:29,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 218 transitions, 2238 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:29,450 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:29,450 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:58:29,450 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:29,866 INFO  L124   PetriNetUnfolderBase]: 537/984 cut-off events.
[2024-06-03 21:58:29,866 INFO  L125   PetriNetUnfolderBase]: For 52690/52690 co-relation queries the response was YES.
[2024-06-03 21:58:29,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 984 events. 537/984 cut-off events. For 52690/52690 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4975 event pairs, 70 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 6970. Up to 589 conditions per place. 
[2024-06-03 21:58:29,875 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 142 selfloop transitions, 92 changer transitions 0/237 dead transitions.
[2024-06-03 21:58:29,875 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 237 transitions, 3000 flow
[2024-06-03 21:58:29,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:58:29,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:58:29,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions.
[2024-06-03 21:58:29,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40294117647058825
[2024-06-03 21:58:29,876 INFO  L175             Difference]: Start difference. First operand has 218 places, 218 transitions, 2238 flow. Second operand 10 states and 137 transitions.
[2024-06-03 21:58:29,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 237 transitions, 3000 flow
[2024-06-03 21:58:29,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 237 transitions, 2791 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-03 21:58:29,950 INFO  L231             Difference]: Finished difference. Result has 222 places, 220 transitions, 2262 flow
[2024-06-03 21:58:29,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2035, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2262, PETRI_PLACES=222, PETRI_TRANSITIONS=220}
[2024-06-03 21:58:29,950 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 189 predicate places.
[2024-06-03 21:58:29,950 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 220 transitions, 2262 flow
[2024-06-03 21:58:29,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:29,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:29,951 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:29,951 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-03 21:58:29,951 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:58:29,951 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:29,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 176780051, now seen corresponding path program 3 times
[2024-06-03 21:58:29,952 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:29,952 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909258202]
[2024-06-03 21:58:29,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:29,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:29,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:40,586 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:40,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:40,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909258202]
[2024-06-03 21:58:40,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909258202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:40,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:40,587 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:40,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566259105]
[2024-06-03 21:58:40,587 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:40,587 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:40,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:40,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:40,588 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:40,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34
[2024-06-03 21:58:40,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 220 transitions, 2262 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:58:40,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:40,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34
[2024-06-03 21:58:40,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:41,205 INFO  L124   PetriNetUnfolderBase]: 511/953 cut-off events.
[2024-06-03 21:58:41,205 INFO  L125   PetriNetUnfolderBase]: For 53325/53326 co-relation queries the response was YES.
[2024-06-03 21:58:41,211 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6867 conditions, 953 events. 511/953 cut-off events. For 53325/53326 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4909 event pairs, 122 based on Foata normal form. 2/951 useless extension candidates. Maximal degree in co-relation 6769. Up to 746 conditions per place. 
[2024-06-03 21:58:41,213 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 163 selfloop transitions, 38 changer transitions 0/236 dead transitions.
[2024-06-03 21:58:41,214 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 236 transitions, 2840 flow
[2024-06-03 21:58:41,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:58:41,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:58:41,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions.
[2024-06-03 21:58:41,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40294117647058825
[2024-06-03 21:58:41,216 INFO  L175             Difference]: Start difference. First operand has 222 places, 220 transitions, 2262 flow. Second operand 10 states and 137 transitions.
[2024-06-03 21:58:41,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 236 transitions, 2840 flow
[2024-06-03 21:58:41,294 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 236 transitions, 2639 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 21:58:41,296 INFO  L231             Difference]: Finished difference. Result has 225 places, 224 transitions, 2194 flow
[2024-06-03 21:58:41,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2194, PETRI_PLACES=225, PETRI_TRANSITIONS=224}
[2024-06-03 21:58:41,297 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 192 predicate places.
[2024-06-03 21:58:41,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 2194 flow
[2024-06-03 21:58:41,297 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:58:41,297 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:41,297 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:41,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-03 21:58:41,298 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:58:41,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:41,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -1868531477, now seen corresponding path program 19 times
[2024-06-03 21:58:41,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:41,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830050964]
[2024-06-03 21:58:41,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:41,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:41,329 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:52,789 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:52,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:52,790 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830050964]
[2024-06-03 21:58:52,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830050964] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:52,790 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:52,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:52,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092865912]
[2024-06-03 21:58:52,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:52,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:52,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:52,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:52,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:52,937 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:58:52,938 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 2194 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:52,938 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:52,938 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:58:52,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:53,405 INFO  L124   PetriNetUnfolderBase]: 536/982 cut-off events.
[2024-06-03 21:58:53,405 INFO  L125   PetriNetUnfolderBase]: For 53165/53165 co-relation queries the response was YES.
[2024-06-03 21:58:53,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6822 conditions, 982 events. 536/982 cut-off events. For 53165/53165 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4969 event pairs, 70 based on Foata normal form. 2/984 useless extension candidates. Maximal degree in co-relation 6723. Up to 591 conditions per place. 
[2024-06-03 21:58:53,413 INFO  L140   encePairwiseOnDemand]: 23/34 looper letters, 141 selfloop transitions, 95 changer transitions 0/239 dead transitions.
[2024-06-03 21:58:53,413 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 239 transitions, 2814 flow
[2024-06-03 21:58:53,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:58:53,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:58:53,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions.
[2024-06-03 21:58:53,414 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3911764705882353
[2024-06-03 21:58:53,414 INFO  L175             Difference]: Start difference. First operand has 225 places, 224 transitions, 2194 flow. Second operand 10 states and 133 transitions.
[2024-06-03 21:58:53,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 239 transitions, 2814 flow
[2024-06-03 21:58:53,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 2729 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-03 21:58:53,494 INFO  L231             Difference]: Finished difference. Result has 229 places, 224 transitions, 2304 flow
[2024-06-03 21:58:53,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2304, PETRI_PLACES=229, PETRI_TRANSITIONS=224}
[2024-06-03 21:58:53,496 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 196 predicate places.
[2024-06-03 21:58:53,496 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 2304 flow
[2024-06-03 21:58:53,496 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:58:53,496 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:53,496 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:53,496 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-03 21:58:53,496 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:58:53,497 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:53,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 176779741, now seen corresponding path program 11 times
[2024-06-03 21:58:53,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:53,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240196860]
[2024-06-03 21:58:53,497 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:53,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:53,532 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:04,134 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:04,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:04,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240196860]
[2024-06-03 21:59:04,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240196860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:04,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:04,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:04,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305225380]
[2024-06-03 21:59:04,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:04,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:04,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:04,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:04,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:04,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:59:04,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 2304 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:04,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:04,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:59:04,282 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:04,680 INFO  L124   PetriNetUnfolderBase]: 544/995 cut-off events.
[2024-06-03 21:59:04,681 INFO  L125   PetriNetUnfolderBase]: For 55484/55484 co-relation queries the response was YES.
[2024-06-03 21:59:04,686 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7164 conditions, 995 events. 544/995 cut-off events. For 55484/55484 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5024 event pairs, 106 based on Foata normal form. 1/996 useless extension candidates. Maximal degree in co-relation 7063. Up to 765 conditions per place. 
[2024-06-03 21:59:04,689 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 167 selfloop transitions, 71 changer transitions 0/241 dead transitions.
[2024-06-03 21:59:04,689 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 3070 flow
[2024-06-03 21:59:04,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:59:04,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:59:04,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions.
[2024-06-03 21:59:04,692 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38823529411764707
[2024-06-03 21:59:04,692 INFO  L175             Difference]: Start difference. First operand has 229 places, 224 transitions, 2304 flow. Second operand 10 states and 132 transitions.
[2024-06-03 21:59:04,692 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 3070 flow
[2024-06-03 21:59:04,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 2885 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-03 21:59:04,812 INFO  L231             Difference]: Finished difference. Result has 231 places, 228 transitions, 2318 flow
[2024-06-03 21:59:04,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2119, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2318, PETRI_PLACES=231, PETRI_TRANSITIONS=228}
[2024-06-03 21:59:04,813 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 198 predicate places.
[2024-06-03 21:59:04,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 228 transitions, 2318 flow
[2024-06-03 21:59:04,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:04,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:04,813 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:04,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-03 21:59:04,813 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:59:04,815 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:04,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 176771371, now seen corresponding path program 12 times
[2024-06-03 21:59:04,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:04,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599080206]
[2024-06-03 21:59:04,815 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:04,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:04,845 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:15,503 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:15,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:15,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599080206]
[2024-06-03 21:59:15,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599080206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:15,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:15,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:15,504 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578387782]
[2024-06-03 21:59:15,504 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:15,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:15,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:15,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:15,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:15,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:59:15,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 228 transitions, 2318 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:15,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:15,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:59:15,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:16,012 INFO  L124   PetriNetUnfolderBase]: 542/992 cut-off events.
[2024-06-03 21:59:16,012 INFO  L125   PetriNetUnfolderBase]: For 55932/55932 co-relation queries the response was YES.
[2024-06-03 21:59:16,018 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 992 events. 542/992 cut-off events. For 55932/55932 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5004 event pairs, 106 based on Foata normal form. 1/993 useless extension candidates. Maximal degree in co-relation 6942. Up to 763 conditions per place. 
[2024-06-03 21:59:16,021 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 167 selfloop transitions, 70 changer transitions 0/240 dead transitions.
[2024-06-03 21:59:16,021 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 240 transitions, 2926 flow
[2024-06-03 21:59:16,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:59:16,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:59:16,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions.
[2024-06-03 21:59:16,023 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38823529411764707
[2024-06-03 21:59:16,024 INFO  L175             Difference]: Start difference. First operand has 231 places, 228 transitions, 2318 flow. Second operand 10 states and 132 transitions.
[2024-06-03 21:59:16,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 240 transitions, 2926 flow
[2024-06-03 21:59:16,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 240 transitions, 2771 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-03 21:59:16,116 INFO  L231             Difference]: Finished difference. Result has 235 places, 228 transitions, 2308 flow
[2024-06-03 21:59:16,117 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2308, PETRI_PLACES=235, PETRI_TRANSITIONS=228}
[2024-06-03 21:59:16,117 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 202 predicate places.
[2024-06-03 21:59:16,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 228 transitions, 2308 flow
[2024-06-03 21:59:16,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:16,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:16,118 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:16,118 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-03 21:59:16,118 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:59:16,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:16,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 471998941, now seen corresponding path program 13 times
[2024-06-03 21:59:16,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:16,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385016284]
[2024-06-03 21:59:16,119 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:16,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:16,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:26,829 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:26,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:26,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385016284]
[2024-06-03 21:59:26,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385016284] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:26,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:26,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:26,830 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613195412]
[2024-06-03 21:59:26,830 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:26,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:26,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:26,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:26,830 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:27,000 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:59:27,000 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 228 transitions, 2308 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:27,000 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:27,001 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:59:27,001 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:27,385 INFO  L124   PetriNetUnfolderBase]: 545/997 cut-off events.
[2024-06-03 21:59:27,386 INFO  L125   PetriNetUnfolderBase]: For 57999/57999 co-relation queries the response was YES.
[2024-06-03 21:59:27,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 997 events. 545/997 cut-off events. For 57999/57999 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5049 event pairs, 106 based on Foata normal form. 1/998 useless extension candidates. Maximal degree in co-relation 6996. Up to 767 conditions per place. 
[2024-06-03 21:59:27,395 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 148 selfloop transitions, 91 changer transitions 0/242 dead transitions.
[2024-06-03 21:59:27,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 242 transitions, 2954 flow
[2024-06-03 21:59:27,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:59:27,396 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:59:27,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions.
[2024-06-03 21:59:27,396 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3764705882352941
[2024-06-03 21:59:27,396 INFO  L175             Difference]: Start difference. First operand has 235 places, 228 transitions, 2308 flow. Second operand 10 states and 128 transitions.
[2024-06-03 21:59:27,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 242 transitions, 2954 flow
[2024-06-03 21:59:27,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 242 transitions, 2804 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-03 21:59:27,493 INFO  L231             Difference]: Finished difference. Result has 236 places, 230 transitions, 2377 flow
[2024-06-03 21:59:27,494 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2162, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2377, PETRI_PLACES=236, PETRI_TRANSITIONS=230}
[2024-06-03 21:59:27,494 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 203 predicate places.
[2024-06-03 21:59:27,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 230 transitions, 2377 flow
[2024-06-03 21:59:27,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:27,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:27,494 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:27,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-03 21:59:27,495 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:59:27,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:27,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -802565963, now seen corresponding path program 14 times
[2024-06-03 21:59:27,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:27,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242782235]
[2024-06-03 21:59:27,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:27,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:27,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:38,206 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:38,206 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:38,207 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242782235]
[2024-06-03 21:59:38,207 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242782235] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:38,207 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:38,207 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:38,207 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165956370]
[2024-06-03 21:59:38,207 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:38,207 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:38,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:38,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:38,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:38,360 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34
[2024-06-03 21:59:38,361 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 230 transitions, 2377 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:38,361 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:38,361 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34
[2024-06-03 21:59:38,361 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:38,768 INFO  L124   PetriNetUnfolderBase]: 548/1002 cut-off events.
[2024-06-03 21:59:38,768 INFO  L125   PetriNetUnfolderBase]: For 60092/60092 co-relation queries the response was YES.
[2024-06-03 21:59:38,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7212 conditions, 1002 events. 548/1002 cut-off events. For 60092/60092 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5083 event pairs, 106 based on Foata normal form. 1/1003 useless extension candidates. Maximal degree in co-relation 7108. Up to 771 conditions per place. 
[2024-06-03 21:59:38,776 INFO  L140   encePairwiseOnDemand]: 24/34 looper letters, 160 selfloop transitions, 81 changer transitions 0/244 dead transitions.
[2024-06-03 21:59:38,777 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 244 transitions, 3029 flow
[2024-06-03 21:59:38,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:59:38,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:59:38,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions.
[2024-06-03 21:59:38,779 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38235294117647056
[2024-06-03 21:59:38,779 INFO  L175             Difference]: Start difference. First operand has 236 places, 230 transitions, 2377 flow. Second operand 10 states and 130 transitions.
[2024-06-03 21:59:38,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 244 transitions, 3029 flow
[2024-06-03 21:59:38,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 244 transitions, 2873 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-03 21:59:38,888 INFO  L231             Difference]: Finished difference. Result has 239 places, 232 transitions, 2420 flow
[2024-06-03 21:59:38,888 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2225, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2420, PETRI_PLACES=239, PETRI_TRANSITIONS=232}
[2024-06-03 21:59:38,888 INFO  L281   CegarLoopForPetriNet]: 33 programPoint places, 206 predicate places.
[2024-06-03 21:59:38,888 INFO  L495      AbstractCegarLoop]: Abstraction has has 239 places, 232 transitions, 2420 flow
[2024-06-03 21:59:38,888 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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:59:38,889 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:38,889 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:38,889 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-03 21:59:38,889 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] ===
[2024-06-03 21:59:38,889 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:38,889 INFO  L85        PathProgramCache]: Analyzing trace with hash -792446323, now seen corresponding path program 4 times
[2024-06-03 21:59:38,889 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:38,890 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376159867]
[2024-06-03 21:59:38,890 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:38,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:38,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15