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


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 16:08:25,437 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 16:08:25,515 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 16:08:25,521 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 16:08:25,521 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 16:08:25,543 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 16:08:25,543 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 16:08:25,544 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 16:08:25,544 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 16:08:25,547 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 16:08:25,547 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 16:08:25,548 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 16:08:25,548 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 16:08:25,549 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 16:08:25,549 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 16:08:25,550 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 16:08:25,550 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 16:08:25,550 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 16:08:25,550 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 16:08:25,550 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 16:08:25,551 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 16:08:25,552 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 16:08:25,552 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 16:08:25,552 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 16:08:25,552 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 16:08:25,552 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 16:08:25,553 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 16:08:25,553 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 16:08:25,553 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 16:08:25,553 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 16:08:25,554 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 16:08:25,554 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 16:08:25,555 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 16:08:25,555 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 16:08:25,555 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 16:08:25,555 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 16:08:25,555 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 16:08:25,555 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 16:08:25,556 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 16:08:25,556 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 16:08:25,556 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 16:08:25,556 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 16:08:25,556 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 16:08:25,556 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 16:08:25,812 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 16:08:25,841 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 16:08:25,844 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 16:08:25,845 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 16:08:25,846 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 16:08:25,847 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i
[2024-06-14 16:08:26,990 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 16:08:27,234 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 16:08:27,234 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i
[2024-06-14 16:08:27,250 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56d90ce0/c3c20e00f471436eb923353e4d984833/FLAG208753322
[2024-06-14 16:08:27,263 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56d90ce0/c3c20e00f471436eb923353e4d984833
[2024-06-14 16:08:27,264 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 16:08:27,265 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 16:08:27,266 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/safe031_power.opt_pso.opt_rmo.opt.yml/witness.yml
[2024-06-14 16:08:27,427 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 16:08:27,428 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 16:08:27,429 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 16:08:27,429 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 16:08:27,433 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 16:08:27,434 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:08:27" (1/2) ...
[2024-06-14 16:08:27,434 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad3899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:27, skipping insertion in model container
[2024-06-14 16:08:27,435 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 04:08:27" (1/2) ...
[2024-06-14 16:08:27,436 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4184ed17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 04:08:27, skipping insertion in model container
[2024-06-14 16:08:27,436 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:27" (2/2) ...
[2024-06-14 16:08:27,436 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad3899a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:27, skipping insertion in model container
[2024-06-14 16:08:27,436 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:27" (2/2) ...
[2024-06-14 16:08:27,436 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 16:08:27,501 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 16:08:27,503 INFO  L97    edCorrectnessWitness]: Location invariant before [L820-L820] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_buff0_thd3 >= 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$r_buff1_thd3 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 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_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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-14 16:08:27,504 INFO  L97    edCorrectnessWitness]: Location invariant before [L818-L818] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_buff0_thd3 >= 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$r_buff1_thd3 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 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_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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-14 16:08:27,504 INFO  L97    edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_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_buff0_thd3 >= 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$r_buff1_thd3 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )z >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z >= 0LL) && (2LL + (long long )x) - (long long )z >= 0LL) && (2LL + (long long )y) - (long long )z >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )z >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff0) - (long long )z >= 0LL) && (2LL + (long long )y$w_buff1) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )z >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )z >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )z >= 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_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 )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && x <= 1) && y$w_buff0 <= 127) && y$w_buff1 <= 127) && z <= 2) && z <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= y$w_buff0 && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (((0 <= y$w_buff1 && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-14 16:08:27,505 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 16:08:27,505 INFO  L106   edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1;
[2024-06-14 16:08:27,549 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 16:08:27,836 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 16:08:27,848 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 16:08:28,178 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 16:08:28,267 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 16:08:28,267 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28 WrapperNode
[2024-06-14 16:08:28,267 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 16:08:28,268 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 16:08:28,268 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 16:08:28,268 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 16:08:28,273 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,299 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,390 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-14 16:08:28,390 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 16:08:28,391 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 16:08:28,392 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 16:08:28,392 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 16:08:28,400 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,400 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,426 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,461 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 16:08:28,461 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,462 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,493 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,495 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,507 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,512 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,526 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 16:08:28,527 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 16:08:28,527 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 16:08:28,527 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 16:08:28,528 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (1/1) ...
[2024-06-14 16:08:28,532 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 16:08:28,538 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 16:08:28,550 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 16:08:28,553 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 16:08:28,578 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 16:08:28,578 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 16:08:28,578 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 16:08:28,578 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 16:08:28,579 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 16:08:28,579 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 16:08:28,579 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 16:08:28,579 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 16:08:28,579 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 16:08:28,580 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 16:08:28,580 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 16:08:28,580 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 16:08:28,581 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 16:08:28,712 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 16:08:28,713 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 16:08:29,780 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 16:08:29,781 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 16:08:30,053 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 16:08:30,053 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 16:08:30,054 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:08:30 BoogieIcfgContainer
[2024-06-14 16:08:30,054 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 16:08:30,056 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 16:08:30,056 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 16:08:30,058 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 16:08:30,058 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 04:08:27" (1/4) ...
[2024-06-14 16:08:30,058 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328fa46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 04:08:30, skipping insertion in model container
[2024-06-14 16:08:30,059 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 04:08:27" (2/4) ...
[2024-06-14 16:08:30,059 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328fa46d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:08:30, skipping insertion in model container
[2024-06-14 16:08:30,059 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 04:08:28" (3/4) ...
[2024-06-14 16:08:30,060 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328fa46d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 04:08:30, skipping insertion in model container
[2024-06-14 16:08:30,060 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 04:08:30" (4/4) ...
[2024-06-14 16:08:30,061 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i
[2024-06-14 16:08:30,073 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 16:08:30,073 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 16:08:30,073 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 16:08:30,153 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 16:08:30,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 16:08:30,219 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-14 16:08:30,219 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 16:08:30,220 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 70 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 16:08:30,221 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 16:08:30,223 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-14 16:08:30,234 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 16:08:30,239 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;@35b85264, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 16:08:30,240 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 16:08:30,246 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 16:08:30,246 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 16:08:30,246 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 16:08:30,247 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:30,247 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:30,247 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:30,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:30,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617218559, now seen corresponding path program 1 times
[2024-06-14 16:08:30,260 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:30,260 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321754421]
[2024-06-14 16:08:30,260 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:30,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:30,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:34,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:34,479 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:34,479 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321754421]
[2024-06-14 16:08:34,479 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321754421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:34,480 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:34,480 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 16:08:34,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529350600]
[2024-06-14 16:08:34,482 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:34,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 16:08:34,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:34,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 16:08:34,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 16:08:34,575 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:08:34,578 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 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-14 16:08:34,578 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:34,578 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:08:34,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:35,220 INFO  L124   PetriNetUnfolderBase]: 1059/1630 cut-off events.
[2024-06-14 16:08:35,221 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-06-14 16:08:35,225 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1630 events. 1059/1630 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7965 event pairs, 698 based on Foata normal form. 1/1594 useless extension candidates. Maximal degree in co-relation 3281. Up to 1593 conditions per place. 
[2024-06-14 16:08:35,232 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-14 16:08:35,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-14 16:08:35,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 16:08:35,235 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 16:08:35,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-14 16:08:35,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5793650793650794
[2024-06-14 16:08:35,242 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 73 transitions.
[2024-06-14 16:08:35,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-14 16:08:35,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 16:08:35,246 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-14 16:08:35,248 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-14 16:08:35,250 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-14 16:08:35,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-14 16:08:35,250 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-14 16:08:35,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:35,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:35,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 16:08:35,251 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:35,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:35,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 631156512, now seen corresponding path program 1 times
[2024-06-14 16:08:35,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:35,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834672310]
[2024-06-14 16:08:35,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:35,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:35,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:38,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:38,619 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:38,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834672310]
[2024-06-14 16:08:38,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834672310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:38,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:38,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 16:08:38,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749466]
[2024-06-14 16:08:38,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:38,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 16:08:38,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:38,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 16:08:38,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-14 16:08:38,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 16:08:38,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:38,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:38,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 16:08:38,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:39,230 INFO  L124   PetriNetUnfolderBase]: 1053/1621 cut-off events.
[2024-06-14 16:08:39,230 INFO  L125   PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES.
[2024-06-14 16:08:39,233 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 1621 events. 1053/1621 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7908 event pairs, 618 based on Foata normal form. 3/1621 useless extension candidates. Maximal degree in co-relation 3731. Up to 1569 conditions per place. 
[2024-06-14 16:08:39,239 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-14 16:08:39,240 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow
[2024-06-14 16:08:39,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 16:08:39,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 16:08:39,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions.
[2024-06-14 16:08:39,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5595238095238095
[2024-06-14 16:08:39,242 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 94 transitions.
[2024-06-14 16:08:39,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow
[2024-06-14 16:08:39,242 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 16:08:39,243 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-14 16:08:39,244 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-14 16:08:39,244 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-14 16:08:39,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-14 16:08:39,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:39,245 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:39,245 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:39,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 16:08:39,245 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:39,246 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:39,246 INFO  L85        PathProgramCache]: Analyzing trace with hash -1104764257, now seen corresponding path program 1 times
[2024-06-14 16:08:39,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:39,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564154889]
[2024-06-14 16:08:39,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:39,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:39,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:47,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:47,215 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:47,215 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564154889]
[2024-06-14 16:08:47,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564154889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:47,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:47,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:08:47,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606952913]
[2024-06-14 16:08:47,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:47,216 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:08:47,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:47,217 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:08:47,217 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:08:47,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:08:47,273 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:47,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:47,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:08:47,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:48,026 INFO  L124   PetriNetUnfolderBase]: 1342/2033 cut-off events.
[2024-06-14 16:08:48,026 INFO  L125   PetriNetUnfolderBase]: For 1070/1070 co-relation queries the response was YES.
[2024-06-14 16:08:48,029 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5208 conditions, 2033 events. 1342/2033 cut-off events. For 1070/1070 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9599 event pairs, 822 based on Foata normal form. 2/2034 useless extension candidates. Maximal degree in co-relation 5191. Up to 1995 conditions per place. 
[2024-06-14 16:08:48,036 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 8 changer transitions 0/53 dead transitions.
[2024-06-14 16:08:48,036 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 274 flow
[2024-06-14 16:08:48,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:08:48,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:08:48,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-14 16:08:48,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-14 16:08:48,038 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 92 transitions.
[2024-06-14 16:08:48,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 274 flow
[2024-06-14 16:08:48,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 260 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 16:08:48,040 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 166 flow
[2024-06-14 16:08:48,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-14 16:08:48,041 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-14 16:08:48,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 166 flow
[2024-06-14 16:08:48,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:48,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:48,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:48,042 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 16:08:48,042 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:48,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:48,043 INFO  L85        PathProgramCache]: Analyzing trace with hash -867182242, now seen corresponding path program 1 times
[2024-06-14 16:08:48,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:48,043 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949634315]
[2024-06-14 16:08:48,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:48,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:48,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:50,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:50,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:50,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949634315]
[2024-06-14 16:08:50,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949634315] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:50,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:50,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:08:50,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22557255]
[2024-06-14 16:08:50,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:50,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:08:50,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:50,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:08:50,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:08:50,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:08:50,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 166 flow. Second operand  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:50,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:50,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:08:50,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:08:51,654 INFO  L124   PetriNetUnfolderBase]: 1333/2018 cut-off events.
[2024-06-14 16:08:51,654 INFO  L125   PetriNetUnfolderBase]: For 1936/1936 co-relation queries the response was YES.
[2024-06-14 16:08:51,658 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5647 conditions, 2018 events. 1333/2018 cut-off events. For 1936/1936 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9644 event pairs, 467 based on Foata normal form. 6/2023 useless extension candidates. Maximal degree in co-relation 5628. Up to 1929 conditions per place. 
[2024-06-14 16:08:51,667 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-14 16:08:51,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 384 flow
[2024-06-14 16:08:51,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:08:51,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:08:51,671 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions.
[2024-06-14 16:08:51,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.503968253968254
[2024-06-14 16:08:51,673 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 166 flow. Second operand 6 states and 127 transitions.
[2024-06-14 16:08:51,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 384 flow
[2024-06-14 16:08:51,675 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 366 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-14 16:08:51,677 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 207 flow
[2024-06-14 16:08:51,677 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=46}
[2024-06-14 16:08:51,678 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-14 16:08:51,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 207 flow
[2024-06-14 16:08:51,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:08:51,678 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:08:51,678 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:08:51,679 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 16:08:51,679 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:08:51,679 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:08:51,679 INFO  L85        PathProgramCache]: Analyzing trace with hash 73616824, now seen corresponding path program 1 times
[2024-06-14 16:08:51,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:08:51,680 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378431858]
[2024-06-14 16:08:51,680 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:08:51,680 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:08:51,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:08:59,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:08:59,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:08:59,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378431858]
[2024-06-14 16:08:59,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378431858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:08:59,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:08:59,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:08:59,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050782281]
[2024-06-14 16:08:59,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:08:59,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:08:59,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:08:59,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:08:59,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:08:59,951 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:08:59,952 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 207 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-14 16:08:59,952 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:08:59,952 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:08:59,952 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:00,727 INFO  L124   PetriNetUnfolderBase]: 1323/2004 cut-off events.
[2024-06-14 16:09:00,727 INFO  L125   PetriNetUnfolderBase]: For 3162/3162 co-relation queries the response was YES.
[2024-06-14 16:09:00,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6115 conditions, 2004 events. 1323/2004 cut-off events. For 3162/3162 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9520 event pairs, 556 based on Foata normal form. 4/2007 useless extension candidates. Maximal degree in co-relation 6095. Up to 1948 conditions per place. 
[2024-06-14 16:09:00,738 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 11 changer transitions 0/65 dead transitions.
[2024-06-14 16:09:00,738 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 385 flow
[2024-06-14 16:09:00,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:00,739 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:00,739 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-14 16:09:00,740 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 16:09:00,740 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 207 flow. Second operand 6 states and 108 transitions.
[2024-06-14 16:09:00,740 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 385 flow
[2024-06-14 16:09:00,742 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 356 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-14 16:09:00,743 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 232 flow
[2024-06-14 16:09:00,743 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=55, PETRI_TRANSITIONS=49}
[2024-06-14 16:09:00,743 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places.
[2024-06-14 16:09:00,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 232 flow
[2024-06-14 16:09:00,744 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-14 16:09:00,744 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:00,744 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:00,744 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 16:09:00,744 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:00,745 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:00,745 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019520076, now seen corresponding path program 1 times
[2024-06-14 16:09:00,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:00,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128836083]
[2024-06-14 16:09:00,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:00,745 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:00,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:08,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:08,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:08,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128836083]
[2024-06-14 16:09:08,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128836083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:08,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:08,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:09:08,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665719456]
[2024-06-14 16:09:08,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:08,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:09:08,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:08,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:09:08,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:09:08,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:09:08,832 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 232 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-14 16:09:08,832 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:08,832 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:09:08,832 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:09,580 INFO  L124   PetriNetUnfolderBase]: 1334/2026 cut-off events.
[2024-06-14 16:09:09,581 INFO  L125   PetriNetUnfolderBase]: For 4463/4467 co-relation queries the response was YES.
[2024-06-14 16:09:09,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6634 conditions, 2026 events. 1334/2026 cut-off events. For 4463/4467 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9702 event pairs, 557 based on Foata normal form. 6/2031 useless extension candidates. Maximal degree in co-relation 6612. Up to 1947 conditions per place. 
[2024-06-14 16:09:09,595 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-14 16:09:09,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 482 flow
[2024-06-14 16:09:09,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:09:09,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:09:09,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-14 16:09:09,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:09:09,597 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 232 flow. Second operand 6 states and 114 transitions.
[2024-06-14 16:09:09,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 482 flow
[2024-06-14 16:09:09,601 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 452 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 16:09:09,602 INFO  L231             Difference]: Finished difference. Result has 57 places, 55 transitions, 288 flow
[2024-06-14 16:09:09,603 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=57, PETRI_TRANSITIONS=55}
[2024-06-14 16:09:09,606 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-14 16:09:09,606 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 288 flow
[2024-06-14 16:09:09,606 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-14 16:09:09,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:09,606 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:09,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 16:09:09,606 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:09,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:09,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -782187626, now seen corresponding path program 2 times
[2024-06-14 16:09:09,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:09,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85590675]
[2024-06-14 16:09:09,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:09,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:09,637 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:17,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:17,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:17,553 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85590675]
[2024-06-14 16:09:17,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85590675] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:17,554 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:17,554 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:09:17,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881298859]
[2024-06-14 16:09:17,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:17,554 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:09:17,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:17,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:09:17,555 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:09:17,645 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:09:17,645 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 288 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-14 16:09:17,646 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:17,646 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:09:17,646 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:18,421 INFO  L124   PetriNetUnfolderBase]: 1329/2018 cut-off events.
[2024-06-14 16:09:18,421 INFO  L125   PetriNetUnfolderBase]: For 5951/5951 co-relation queries the response was YES.
[2024-06-14 16:09:18,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7066 conditions, 2018 events. 1329/2018 cut-off events. For 5951/5951 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9677 event pairs, 553 based on Foata normal form. 2/2019 useless extension candidates. Maximal degree in co-relation 7043. Up to 1942 conditions per place. 
[2024-06-14 16:09:18,434 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 17 changer transitions 0/81 dead transitions.
[2024-06-14 16:09:18,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 506 flow
[2024-06-14 16:09:18,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:09:18,435 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:09:18,435 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 16:09:18,435 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 16:09:18,436 INFO  L175             Difference]: Start difference. First operand has 57 places, 55 transitions, 288 flow. Second operand 8 states and 142 transitions.
[2024-06-14 16:09:18,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 506 flow
[2024-06-14 16:09:18,439 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 472 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-14 16:09:18,440 INFO  L231             Difference]: Finished difference. Result has 63 places, 55 transitions, 296 flow
[2024-06-14 16:09:18,441 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=63, PETRI_TRANSITIONS=55}
[2024-06-14 16:09:18,441 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-14 16:09:18,441 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 296 flow
[2024-06-14 16:09:18,442 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-14 16:09:18,442 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:18,442 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:18,442 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 16:09:18,442 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:18,442 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:18,443 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292991493, now seen corresponding path program 1 times
[2024-06-14 16:09:18,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:18,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331207243]
[2024-06-14 16:09:18,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:18,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:18,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:27,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-14 16:09:27,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:27,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331207243]
[2024-06-14 16:09:27,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331207243] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:27,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:27,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:09:27,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74995625]
[2024-06-14 16:09:27,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:27,300 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:09:27,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:27,301 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:09:27,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:09:27,399 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:09:27,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 296 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-14 16:09:27,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:27,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:09:27,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:28,249 INFO  L124   PetriNetUnfolderBase]: 1351/2061 cut-off events.
[2024-06-14 16:09:28,249 INFO  L125   PetriNetUnfolderBase]: For 7344/7348 co-relation queries the response was YES.
[2024-06-14 16:09:28,253 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7305 conditions, 2061 events. 1351/2061 cut-off events. For 7344/7348 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9960 event pairs, 506 based on Foata normal form. 8/2068 useless extension candidates. Maximal degree in co-relation 7280. Up to 1904 conditions per place. 
[2024-06-14 16:09:28,266 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 24 changer transitions 0/92 dead transitions.
[2024-06-14 16:09:28,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 618 flow
[2024-06-14 16:09:28,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:09:28,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:09:28,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 16:09:28,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-14 16:09:28,270 INFO  L175             Difference]: Start difference. First operand has 63 places, 55 transitions, 296 flow. Second operand 8 states and 150 transitions.
[2024-06-14 16:09:28,275 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 618 flow
[2024-06-14 16:09:28,279 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 572 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-14 16:09:28,280 INFO  L231             Difference]: Finished difference. Result has 63 places, 61 transitions, 356 flow
[2024-06-14 16:09:28,280 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=356, PETRI_PLACES=63, PETRI_TRANSITIONS=61}
[2024-06-14 16:09:28,282 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-14 16:09:28,283 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 356 flow
[2024-06-14 16:09:28,283 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-14 16:09:28,283 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:28,283 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:28,283 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 16:09:28,283 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:28,284 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:28,284 INFO  L85        PathProgramCache]: Analyzing trace with hash 1522255093, now seen corresponding path program 2 times
[2024-06-14 16:09:28,284 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:28,284 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540482399]
[2024-06-14 16:09:28,284 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:28,284 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:28,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:36,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:36,846 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:36,846 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540482399]
[2024-06-14 16:09:36,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540482399] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:36,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:36,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:09:36,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529154911]
[2024-06-14 16:09:36,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:36,847 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:09:36,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:36,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:09:36,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:09:36,981 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:09:36,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 356 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-14 16:09:36,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:36,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:09:36,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:37,945 INFO  L124   PetriNetUnfolderBase]: 1373/2092 cut-off events.
[2024-06-14 16:09:37,946 INFO  L125   PetriNetUnfolderBase]: For 9388/9388 co-relation queries the response was YES.
[2024-06-14 16:09:37,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7923 conditions, 2092 events. 1373/2092 cut-off events. For 9388/9388 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10067 event pairs, 504 based on Foata normal form. 4/2095 useless extension candidates. Maximal degree in co-relation 7898. Up to 1923 conditions per place. 
[2024-06-14 16:09:37,956 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 29 changer transitions 0/98 dead transitions.
[2024-06-14 16:09:37,956 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 686 flow
[2024-06-14 16:09:37,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:09:37,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:09:37,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-14 16:09:37,958 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-14 16:09:37,958 INFO  L175             Difference]: Start difference. First operand has 63 places, 61 transitions, 356 flow. Second operand 9 states and 163 transitions.
[2024-06-14 16:09:37,958 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 686 flow
[2024-06-14 16:09:37,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 654 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-14 16:09:37,964 INFO  L231             Difference]: Finished difference. Result has 68 places, 64 transitions, 418 flow
[2024-06-14 16:09:37,964 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=68, PETRI_TRANSITIONS=64}
[2024-06-14 16:09:37,964 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-14 16:09:37,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 418 flow
[2024-06-14 16:09:37,965 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-14 16:09:37,965 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:37,965 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:37,965 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 16:09:37,965 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:37,965 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:37,965 INFO  L85        PathProgramCache]: Analyzing trace with hash 302940463, now seen corresponding path program 3 times
[2024-06-14 16:09:37,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:37,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052866192]
[2024-06-14 16:09:37,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:37,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:37,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:46,531 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:46,532 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:46,532 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052866192]
[2024-06-14 16:09:46,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052866192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:46,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:46,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:09:46,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341543545]
[2024-06-14 16:09:46,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:46,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:09:46,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:46,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:09:46,537 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:09:46,644 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:09:46,644 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 64 transitions, 418 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-14 16:09:46,644 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:46,644 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:09:46,644 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:47,494 INFO  L124   PetriNetUnfolderBase]: 1363/2078 cut-off events.
[2024-06-14 16:09:47,495 INFO  L125   PetriNetUnfolderBase]: For 11010/11010 co-relation queries the response was YES.
[2024-06-14 16:09:47,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8139 conditions, 2078 events. 1363/2078 cut-off events. For 11010/11010 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9982 event pairs, 502 based on Foata normal form. 4/2081 useless extension candidates. Maximal degree in co-relation 8112. Up to 1915 conditions per place. 
[2024-06-14 16:09:47,505 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 28 changer transitions 0/97 dead transitions.
[2024-06-14 16:09:47,505 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 684 flow
[2024-06-14 16:09:47,507 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:09:47,507 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:09:47,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-14 16:09:47,508 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-14 16:09:47,508 INFO  L175             Difference]: Start difference. First operand has 68 places, 64 transitions, 418 flow. Second operand 9 states and 164 transitions.
[2024-06-14 16:09:47,508 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 684 flow
[2024-06-14 16:09:47,515 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 610 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-14 16:09:47,516 INFO  L231             Difference]: Finished difference. Result has 71 places, 64 transitions, 408 flow
[2024-06-14 16:09:47,516 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=408, PETRI_PLACES=71, PETRI_TRANSITIONS=64}
[2024-06-14 16:09:47,516 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places.
[2024-06-14 16:09:47,517 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 408 flow
[2024-06-14 16:09:47,517 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-14 16:09:47,517 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:47,517 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:47,517 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 16:09:47,517 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:47,518 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:47,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 303217293, now seen corresponding path program 1 times
[2024-06-14 16:09:47,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:47,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756739952]
[2024-06-14 16:09:47,518 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:47,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:47,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:09:55,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:09:55,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:09:55,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756739952]
[2024-06-14 16:09:55,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756739952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:09:55,646 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:09:55,646 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:09:55,646 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754859074]
[2024-06-14 16:09:55,646 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:09:55,646 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:09:55,647 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:09:55,647 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:09:55,647 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:09:55,768 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:09:55,769 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 408 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-14 16:09:55,769 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:09:55,769 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:09:55,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:09:56,655 INFO  L124   PetriNetUnfolderBase]: 1355/2066 cut-off events.
[2024-06-14 16:09:56,656 INFO  L125   PetriNetUnfolderBase]: For 12487/12487 co-relation queries the response was YES.
[2024-06-14 16:09:56,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8199 conditions, 2066 events. 1355/2066 cut-off events. For 12487/12487 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 9855 event pairs, 498 based on Foata normal form. 4/2069 useless extension candidates. Maximal degree in co-relation 8171. Up to 1977 conditions per place. 
[2024-06-14 16:09:56,693 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 69 selfloop transitions, 13 changer transitions 0/87 dead transitions.
[2024-06-14 16:09:56,693 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 648 flow
[2024-06-14 16:09:56,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:09:56,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:09:56,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:09:56,696 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-14 16:09:56,697 INFO  L175             Difference]: Start difference. First operand has 71 places, 64 transitions, 408 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:09:56,697 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 648 flow
[2024-06-14 16:09:56,704 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 570 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-14 16:09:56,705 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 391 flow
[2024-06-14 16:09:56,705 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=391, PETRI_PLACES=69, PETRI_TRANSITIONS=66}
[2024-06-14 16:09:56,706 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-14 16:09:56,706 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 391 flow
[2024-06-14 16:09:56,706 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 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-14 16:09:56,706 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:09:56,706 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:09:56,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 16:09:56,706 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:09:56,707 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:09:56,707 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694568561, now seen corresponding path program 1 times
[2024-06-14 16:09:56,707 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:09:56,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219504886]
[2024-06-14 16:09:56,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:09:56,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:09:56,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:03,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:03,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:03,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219504886]
[2024-06-14 16:10:03,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219504886] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:03,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:03,801 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 16:10:03,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20763552]
[2024-06-14 16:10:03,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:03,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 16:10:03,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:03,802 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 16:10:03,802 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 16:10:03,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:10:03,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 391 flow. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-14 16:10:03,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:03,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:10:03,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:04,506 INFO  L124   PetriNetUnfolderBase]: 1250/1960 cut-off events.
[2024-06-14 16:10:04,507 INFO  L125   PetriNetUnfolderBase]: For 13857/13857 co-relation queries the response was YES.
[2024-06-14 16:10:04,512 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7948 conditions, 1960 events. 1250/1960 cut-off events. For 13857/13857 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9423 event pairs, 532 based on Foata normal form. 1/1960 useless extension candidates. Maximal degree in co-relation 7919. Up to 1856 conditions per place. 
[2024-06-14 16:10:04,543 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 57 selfloop transitions, 8 changer transitions 0/77 dead transitions.
[2024-06-14 16:10:04,543 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 561 flow
[2024-06-14 16:10:04,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 16:10:04,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 16:10:04,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-06-14 16:10:04,553 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-14 16:10:04,553 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 391 flow. Second operand 5 states and 91 transitions.
[2024-06-14 16:10:04,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 561 flow
[2024-06-14 16:10:04,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 518 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:04,560 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 396 flow
[2024-06-14 16:10:04,561 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=396, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-14 16:10:04,561 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-14 16:10:04,561 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 396 flow
[2024-06-14 16:10:04,561 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-14 16:10:04,561 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:04,561 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:04,561 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 16:10:04,561 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:04,562 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:04,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 561682259, now seen corresponding path program 1 times
[2024-06-14 16:10:04,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:04,562 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261646801]
[2024-06-14 16:10:04,562 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:04,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:04,585 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:13,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:13,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:13,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261646801]
[2024-06-14 16:10:13,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261646801] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:13,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:13,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:13,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698800908]
[2024-06-14 16:10:13,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:13,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:13,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:13,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:13,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:13,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:10:13,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 396 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-14 16:10:13,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:13,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:10:13,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:14,367 INFO  L124   PetriNetUnfolderBase]: 1363/2083 cut-off events.
[2024-06-14 16:10:14,367 INFO  L125   PetriNetUnfolderBase]: For 16144/16144 co-relation queries the response was YES.
[2024-06-14 16:10:14,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8800 conditions, 2083 events. 1363/2083 cut-off events. For 16144/16144 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 9996 event pairs, 514 based on Foata normal form. 2/2084 useless extension candidates. Maximal degree in co-relation 8770. Up to 1986 conditions per place. 
[2024-06-14 16:10:14,378 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 69 selfloop transitions, 16 changer transitions 0/90 dead transitions.
[2024-06-14 16:10:14,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 640 flow
[2024-06-14 16:10:14,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:10:14,380 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:10:14,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-14 16:10:14,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 16:10:14,381 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 396 flow. Second operand 6 states and 112 transitions.
[2024-06-14 16:10:14,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 640 flow
[2024-06-14 16:10:14,387 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 614 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-14 16:10:14,389 INFO  L231             Difference]: Finished difference. Result has 72 places, 72 transitions, 448 flow
[2024-06-14 16:10:14,389 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=72, PETRI_TRANSITIONS=72}
[2024-06-14 16:10:14,389 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-14 16:10:14,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 448 flow
[2024-06-14 16:10:14,390 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-14 16:10:14,390 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:14,390 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:14,390 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 16:10:14,390 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:14,391 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:14,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -1845135243, now seen corresponding path program 2 times
[2024-06-14 16:10:14,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:14,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30171554]
[2024-06-14 16:10:14,391 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:14,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:14,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:23,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:23,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:23,390 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30171554]
[2024-06-14 16:10:23,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30171554] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:23,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:23,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:23,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458623858]
[2024-06-14 16:10:23,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:23,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:23,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:23,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:23,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:23,512 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:10:23,512 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 448 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-14 16:10:23,512 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:23,512 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:10:23,513 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:24,305 INFO  L124   PetriNetUnfolderBase]: 1374/2105 cut-off events.
[2024-06-14 16:10:24,305 INFO  L125   PetriNetUnfolderBase]: For 18918/18920 co-relation queries the response was YES.
[2024-06-14 16:10:24,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9391 conditions, 2105 events. 1374/2105 cut-off events. For 18918/18920 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10205 event pairs, 518 based on Foata normal form. 4/2108 useless extension candidates. Maximal degree in co-relation 9360. Up to 1964 conditions per place. 
[2024-06-14 16:10:24,314 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 71 selfloop transitions, 26 changer transitions 0/102 dead transitions.
[2024-06-14 16:10:24,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 102 transitions, 820 flow
[2024-06-14 16:10:24,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:10:24,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:10:24,316 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-14 16:10:24,317 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4489795918367347
[2024-06-14 16:10:24,317 INFO  L175             Difference]: Start difference. First operand has 72 places, 72 transitions, 448 flow. Second operand 7 states and 132 transitions.
[2024-06-14 16:10:24,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 102 transitions, 820 flow
[2024-06-14 16:10:24,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 768 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-14 16:10:24,355 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 534 flow
[2024-06-14 16:10:24,356 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2024-06-14 16:10:24,356 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places.
[2024-06-14 16:10:24,356 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 534 flow
[2024-06-14 16:10:24,356 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-14 16:10:24,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:24,357 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:24,357 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 16:10:24,357 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:24,357 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:24,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -63012683, now seen corresponding path program 3 times
[2024-06-14 16:10:24,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:24,357 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727883372]
[2024-06-14 16:10:24,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:24,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:24,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:33,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:33,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:33,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727883372]
[2024-06-14 16:10:33,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727883372] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:33,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:33,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:10:33,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081579554]
[2024-06-14 16:10:33,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:33,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:10:33,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:33,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:10:33,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:10:33,288 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:10:33,289 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 534 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-14 16:10:33,289 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:33,289 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:10:33,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:34,155 INFO  L124   PetriNetUnfolderBase]: 1369/2097 cut-off events.
[2024-06-14 16:10:34,155 INFO  L125   PetriNetUnfolderBase]: For 19751/19751 co-relation queries the response was YES.
[2024-06-14 16:10:34,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 2097 events. 1369/2097 cut-off events. For 19751/19751 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10097 event pairs, 514 based on Foata normal form. 2/2098 useless extension candidates. Maximal degree in co-relation 9582. Up to 1959 conditions per place. 
[2024-06-14 16:10:34,166 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 76 selfloop transitions, 27 changer transitions 0/108 dead transitions.
[2024-06-14 16:10:34,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 108 transitions, 816 flow
[2024-06-14 16:10:34,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:10:34,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:10:34,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:10:34,170 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-14 16:10:34,170 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 534 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:10:34,170 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 108 transitions, 816 flow
[2024-06-14 16:10:34,182 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 754 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-14 16:10:34,183 INFO  L231             Difference]: Finished difference. Result has 80 places, 78 transitions, 534 flow
[2024-06-14 16:10:34,184 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=534, PETRI_PLACES=80, PETRI_TRANSITIONS=78}
[2024-06-14 16:10:34,184 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-14 16:10:34,184 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 534 flow
[2024-06-14 16:10:34,185 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-14 16:10:34,185 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:34,185 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:34,185 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 16:10:34,185 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:34,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:34,186 INFO  L85        PathProgramCache]: Analyzing trace with hash 1029555678, now seen corresponding path program 1 times
[2024-06-14 16:10:34,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:34,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025168298]
[2024-06-14 16:10:34,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:34,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:34,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:41,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:41,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:41,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025168298]
[2024-06-14 16:10:41,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025168298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:41,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:41,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:10:41,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191942888]
[2024-06-14 16:10:41,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:41,672 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:10:41,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:41,672 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:10:41,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:10:41,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:10:41,788 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 534 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 16:10:41,788 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:41,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:10:41,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:42,435 INFO  L124   PetriNetUnfolderBase]: 1262/1998 cut-off events.
[2024-06-14 16:10:42,436 INFO  L125   PetriNetUnfolderBase]: For 21600/21604 co-relation queries the response was YES.
[2024-06-14 16:10:42,441 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 1998 events. 1262/1998 cut-off events. For 21600/21604 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 9792 event pairs, 505 based on Foata normal form. 3/1999 useless extension candidates. Maximal degree in co-relation 9328. Up to 1838 conditions per place. 
[2024-06-14 16:10:42,446 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 71 selfloop transitions, 20 changer transitions 0/103 dead transitions.
[2024-06-14 16:10:42,447 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 103 transitions, 842 flow
[2024-06-14 16:10:42,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:10:42,447 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:10:42,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 16:10:42,448 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4387755102040816
[2024-06-14 16:10:42,448 INFO  L175             Difference]: Start difference. First operand has 80 places, 78 transitions, 534 flow. Second operand 7 states and 129 transitions.
[2024-06-14 16:10:42,448 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 103 transitions, 842 flow
[2024-06-14 16:10:42,458 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 770 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-14 16:10:42,462 INFO  L231             Difference]: Finished difference. Result has 80 places, 86 transitions, 586 flow
[2024-06-14 16:10:42,462 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=586, PETRI_PLACES=80, PETRI_TRANSITIONS=86}
[2024-06-14 16:10:42,463 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-14 16:10:42,463 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 586 flow
[2024-06-14 16:10:42,463 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 16:10:42,463 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:42,463 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:42,463 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 16:10:42,464 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:42,465 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:42,465 INFO  L85        PathProgramCache]: Analyzing trace with hash 374384728, now seen corresponding path program 1 times
[2024-06-14 16:10:42,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:42,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615513286]
[2024-06-14 16:10:42,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:42,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:42,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:10:52,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:10:52,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:10:52,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615513286]
[2024-06-14 16:10:52,127 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615513286] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:10:52,127 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:10:52,127 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:10:52,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497760784]
[2024-06-14 16:10:52,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:10:52,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:10:52,130 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:10:52,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:10:52,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:10:52,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:10:52,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 586 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:52,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:10:52,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:10:52,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:10:53,294 INFO  L124   PetriNetUnfolderBase]: 1402/2149 cut-off events.
[2024-06-14 16:10:53,294 INFO  L125   PetriNetUnfolderBase]: For 25765/25765 co-relation queries the response was YES.
[2024-06-14 16:10:53,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10642 conditions, 2149 events. 1402/2149 cut-off events. For 25765/25765 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10462 event pairs, 500 based on Foata normal form. 4/2152 useless extension candidates. Maximal degree in co-relation 10607. Up to 2034 conditions per place. 
[2024-06-14 16:10:53,305 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 97 selfloop transitions, 17 changer transitions 0/119 dead transitions.
[2024-06-14 16:10:53,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 119 transitions, 928 flow
[2024-06-14 16:10:53,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:10:53,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:10:53,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 16:10:53,311 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-14 16:10:53,311 INFO  L175             Difference]: Start difference. First operand has 80 places, 86 transitions, 586 flow. Second operand 8 states and 146 transitions.
[2024-06-14 16:10:53,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 119 transitions, 928 flow
[2024-06-14 16:10:53,336 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 890 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-14 16:10:53,338 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 634 flow
[2024-06-14 16:10:53,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=634, PETRI_PLACES=85, PETRI_TRANSITIONS=89}
[2024-06-14 16:10:53,352 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-14 16:10:53,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 634 flow
[2024-06-14 16:10:53,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:10:53,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:10:53,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:10:53,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 16:10:53,353 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:10:53,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:10:53,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 236000728, now seen corresponding path program 2 times
[2024-06-14 16:10:53,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:10:53,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746529494]
[2024-06-14 16:10:53,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:10:53,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:10:53,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:02,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:02,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:02,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746529494]
[2024-06-14 16:11:02,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746529494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:02,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:02,855 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:02,855 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139898399]
[2024-06-14 16:11:02,855 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:02,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:02,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:02,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:02,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:02,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:11:02,975 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 634 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:02,975 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:02,975 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:11:02,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:03,854 INFO  L124   PetriNetUnfolderBase]: 1456/2243 cut-off events.
[2024-06-14 16:11:03,854 INFO  L125   PetriNetUnfolderBase]: For 30408/30410 co-relation queries the response was YES.
[2024-06-14 16:11:03,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11616 conditions, 2243 events. 1456/2243 cut-off events. For 30408/30410 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11028 event pairs, 452 based on Foata normal form. 6/2248 useless extension candidates. Maximal degree in co-relation 11579. Up to 1899 conditions per place. 
[2024-06-14 16:11:03,868 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 88 selfloop transitions, 44 changer transitions 0/137 dead transitions.
[2024-06-14 16:11:03,868 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 1244 flow
[2024-06-14 16:11:03,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:03,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:03,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-14 16:11:03,870 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-14 16:11:03,870 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 634 flow. Second operand 9 states and 174 transitions.
[2024-06-14 16:11:03,871 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 1244 flow
[2024-06-14 16:11:03,884 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1172 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-14 16:11:03,885 INFO  L231             Difference]: Finished difference. Result has 88 places, 98 transitions, 796 flow
[2024-06-14 16:11:03,885 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=796, PETRI_PLACES=88, PETRI_TRANSITIONS=98}
[2024-06-14 16:11:03,886 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places.
[2024-06-14 16:11:03,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 796 flow
[2024-06-14 16:11:03,886 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:03,886 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:03,886 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:03,886 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 16:11:03,886 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:03,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:03,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319295332, now seen corresponding path program 3 times
[2024-06-14 16:11:03,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:03,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995675030]
[2024-06-14 16:11:03,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:03,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:03,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:13,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:13,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:13,397 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995675030]
[2024-06-14 16:11:13,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995675030] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:13,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:13,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:13,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156279749]
[2024-06-14 16:11:13,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:13,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:13,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:13,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:13,402 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:13,544 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:11:13,545 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 796 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:13,545 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:13,545 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:11:13,545 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:14,365 INFO  L124   PetriNetUnfolderBase]: 1446/2235 cut-off events.
[2024-06-14 16:11:14,366 INFO  L125   PetriNetUnfolderBase]: For 34201/34201 co-relation queries the response was YES.
[2024-06-14 16:11:14,372 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11959 conditions, 2235 events. 1446/2235 cut-off events. For 34201/34201 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 11024 event pairs, 453 based on Foata normal form. 4/2237 useless extension candidates. Maximal degree in co-relation 11921. Up to 1891 conditions per place. 
[2024-06-14 16:11:14,390 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 81 selfloop transitions, 44 changer transitions 0/130 dead transitions.
[2024-06-14 16:11:14,391 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 1188 flow
[2024-06-14 16:11:14,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:11:14,393 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:11:14,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 16:11:14,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-14 16:11:14,394 INFO  L175             Difference]: Start difference. First operand has 88 places, 98 transitions, 796 flow. Second operand 8 states and 155 transitions.
[2024-06-14 16:11:14,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 1188 flow
[2024-06-14 16:11:14,413 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 130 transitions, 1092 flow, removed 36 selfloop flow, removed 4 redundant places.
[2024-06-14 16:11:14,414 INFO  L231             Difference]: Finished difference. Result has 92 places, 98 transitions, 796 flow
[2024-06-14 16:11:14,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=796, PETRI_PLACES=92, PETRI_TRANSITIONS=98}
[2024-06-14 16:11:14,415 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-14 16:11:14,415 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 796 flow
[2024-06-14 16:11:14,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:14,416 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:14,416 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:14,416 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 16:11:14,416 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:14,416 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:14,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -240116752, now seen corresponding path program 1 times
[2024-06-14 16:11:14,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:14,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568229474]
[2024-06-14 16:11:14,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:14,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:14,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:23,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:23,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:23,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568229474]
[2024-06-14 16:11:23,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568229474] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:23,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:23,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:23,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47588237]
[2024-06-14 16:11:23,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:23,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:23,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:23,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:23,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:23,470 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:11:23,470 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 796 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:23,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:23,471 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:11:23,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:24,380 INFO  L124   PetriNetUnfolderBase]: 1463/2261 cut-off events.
[2024-06-14 16:11:24,380 INFO  L125   PetriNetUnfolderBase]: For 37064/37066 co-relation queries the response was YES.
[2024-06-14 16:11:24,386 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12285 conditions, 2261 events. 1463/2261 cut-off events. For 37064/37066 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11134 event pairs, 456 based on Foata normal form. 6/2266 useless extension candidates. Maximal degree in co-relation 12245. Up to 2045 conditions per place. 
[2024-06-14 16:11:24,393 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 29 changer transitions 0/134 dead transitions.
[2024-06-14 16:11:24,393 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 1170 flow
[2024-06-14 16:11:24,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:11:24,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:11:24,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-14 16:11:24,396 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-14 16:11:24,396 INFO  L175             Difference]: Start difference. First operand has 92 places, 98 transitions, 796 flow. Second operand 9 states and 164 transitions.
[2024-06-14 16:11:24,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 1170 flow
[2024-06-14 16:11:24,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 1074 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 16:11:24,414 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 801 flow
[2024-06-14 16:11:24,414 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=801, PETRI_PLACES=94, PETRI_TRANSITIONS=100}
[2024-06-14 16:11:24,414 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-14 16:11:24,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 801 flow
[2024-06-14 16:11:24,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:24,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:24,415 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:24,415 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 16:11:24,415 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:24,415 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:24,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 675424656, now seen corresponding path program 1 times
[2024-06-14 16:11:24,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:24,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297884081]
[2024-06-14 16:11:24,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:24,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:24,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:32,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:32,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:32,073 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297884081]
[2024-06-14 16:11:32,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297884081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:32,073 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:32,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:11:32,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885853846]
[2024-06-14 16:11:32,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:32,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:11:32,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:32,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:11:32,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:11:32,148 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:11:32,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 801 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 16:11:32,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:32,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:11:32,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:32,831 INFO  L124   PetriNetUnfolderBase]: 1342/2122 cut-off events.
[2024-06-14 16:11:32,831 INFO  L125   PetriNetUnfolderBase]: For 39870/39880 co-relation queries the response was YES.
[2024-06-14 16:11:32,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11914 conditions, 2122 events. 1342/2122 cut-off events. For 39870/39880 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 10585 event pairs, 490 based on Foata normal form. 2/2107 useless extension candidates. Maximal degree in co-relation 11873. Up to 1957 conditions per place. 
[2024-06-14 16:11:32,844 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 92 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2024-06-14 16:11:32,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 118 transitions, 1079 flow
[2024-06-14 16:11:32,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:11:32,845 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:11:32,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 16:11:32,845 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-14 16:11:32,845 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 801 flow. Second operand 6 states and 111 transitions.
[2024-06-14 16:11:32,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 118 transitions, 1079 flow
[2024-06-14 16:11:32,896 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 118 transitions, 996 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-14 16:11:32,897 INFO  L231             Difference]: Finished difference. Result has 93 places, 103 transitions, 787 flow
[2024-06-14 16:11:32,897 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=787, PETRI_PLACES=93, PETRI_TRANSITIONS=103}
[2024-06-14 16:11:32,898 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-14 16:11:32,898 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 787 flow
[2024-06-14 16:11:32,898 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 16:11:32,898 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:32,898 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:32,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 16:11:32,898 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:32,899 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:32,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 1662059382, now seen corresponding path program 4 times
[2024-06-14 16:11:32,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:32,899 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252426257]
[2024-06-14 16:11:32,899 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:32,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:32,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:42,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:42,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:42,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252426257]
[2024-06-14 16:11:42,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252426257] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:42,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:42,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:42,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726855019]
[2024-06-14 16:11:42,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:42,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:42,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:42,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:42,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:42,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:11:42,502 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 103 transitions, 787 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:42,502 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:42,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:11:42,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:43,495 INFO  L124   PetriNetUnfolderBase]: 1495/2315 cut-off events.
[2024-06-14 16:11:43,495 INFO  L125   PetriNetUnfolderBase]: For 44148/44148 co-relation queries the response was YES.
[2024-06-14 16:11:43,501 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12856 conditions, 2315 events. 1495/2315 cut-off events. For 44148/44148 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11488 event pairs, 451 based on Foata normal form. 4/2318 useless extension candidates. Maximal degree in co-relation 12814. Up to 1951 conditions per place. 
[2024-06-14 16:11:43,509 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 94 selfloop transitions, 51 changer transitions 0/150 dead transitions.
[2024-06-14 16:11:43,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 150 transitions, 1309 flow
[2024-06-14 16:11:43,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:11:43,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:11:43,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions.
[2024-06-14 16:11:43,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43073593073593075
[2024-06-14 16:11:43,512 INFO  L175             Difference]: Start difference. First operand has 93 places, 103 transitions, 787 flow. Second operand 11 states and 199 transitions.
[2024-06-14 16:11:43,512 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 150 transitions, 1309 flow
[2024-06-14 16:11:43,530 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 150 transitions, 1274 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-14 16:11:43,532 INFO  L231             Difference]: Finished difference. Result has 100 places, 106 transitions, 912 flow
[2024-06-14 16:11:43,532 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=912, PETRI_PLACES=100, PETRI_TRANSITIONS=106}
[2024-06-14 16:11:43,533 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-14 16:11:43,533 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 912 flow
[2024-06-14 16:11:43,533 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:43,533 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:43,533 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:43,533 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 16:11:43,533 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:43,534 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:43,534 INFO  L85        PathProgramCache]: Analyzing trace with hash -931972082, now seen corresponding path program 5 times
[2024-06-14 16:11:43,534 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:43,534 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730025751]
[2024-06-14 16:11:43,534 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:43,534 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:43,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:11:53,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:11:53,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:11:53,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730025751]
[2024-06-14 16:11:53,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730025751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:11:53,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:11:53,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:11:53,226 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276149809]
[2024-06-14 16:11:53,226 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:11:53,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:11:53,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:11:53,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:11:53,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:11:53,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:11:53,352 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 912 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:53,352 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:11:53,352 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:11:53,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:11:54,331 INFO  L124   PetriNetUnfolderBase]: 1517/2347 cut-off events.
[2024-06-14 16:11:54,331 INFO  L125   PetriNetUnfolderBase]: For 48821/48821 co-relation queries the response was YES.
[2024-06-14 16:11:54,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13462 conditions, 2347 events. 1517/2347 cut-off events. For 48821/48821 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11683 event pairs, 446 based on Foata normal form. 4/2350 useless extension candidates. Maximal degree in co-relation 13419. Up to 1970 conditions per place. 
[2024-06-14 16:11:54,345 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 50 changer transitions 0/150 dead transitions.
[2024-06-14 16:11:54,345 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 150 transitions, 1436 flow
[2024-06-14 16:11:54,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:11:54,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:11:54,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 16:11:54,348 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 16:11:54,348 INFO  L175             Difference]: Start difference. First operand has 100 places, 106 transitions, 912 flow. Second operand 10 states and 188 transitions.
[2024-06-14 16:11:54,348 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 150 transitions, 1436 flow
[2024-06-14 16:11:54,375 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 150 transitions, 1302 flow, removed 27 selfloop flow, removed 8 redundant places.
[2024-06-14 16:11:54,377 INFO  L231             Difference]: Finished difference. Result has 102 places, 109 transitions, 942 flow
[2024-06-14 16:11:54,377 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=942, PETRI_PLACES=102, PETRI_TRANSITIONS=109}
[2024-06-14 16:11:54,378 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places.
[2024-06-14 16:11:54,378 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 109 transitions, 942 flow
[2024-06-14 16:11:54,378 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:11:54,378 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:11:54,378 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:11:54,378 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 16:11:54,379 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:11:54,379 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:11:54,379 INFO  L85        PathProgramCache]: Analyzing trace with hash -932179472, now seen corresponding path program 6 times
[2024-06-14 16:11:54,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:11:54,379 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395179]
[2024-06-14 16:11:54,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:11:54,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:11:54,401 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:03,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:03,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:03,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395179]
[2024-06-14 16:12:03,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395179] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:03,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:03,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:12:03,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371481316]
[2024-06-14 16:12:03,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:03,953 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:12:03,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:03,953 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:12:03,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:12:04,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:12:04,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 109 transitions, 942 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:04,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:04,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:12:04,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:05,066 INFO  L124   PetriNetUnfolderBase]: 1507/2338 cut-off events.
[2024-06-14 16:12:05,067 INFO  L125   PetriNetUnfolderBase]: For 51178/51178 co-relation queries the response was YES.
[2024-06-14 16:12:05,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13343 conditions, 2338 events. 1507/2338 cut-off events. For 51178/51178 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11662 event pairs, 444 based on Foata normal form. 4/2341 useless extension candidates. Maximal degree in co-relation 13299. Up to 1962 conditions per place. 
[2024-06-14 16:12:05,081 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 90 selfloop transitions, 52 changer transitions 0/147 dead transitions.
[2024-06-14 16:12:05,082 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 147 transitions, 1320 flow
[2024-06-14 16:12:05,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:05,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:05,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-14 16:12:05,084 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-14 16:12:05,084 INFO  L175             Difference]: Start difference. First operand has 102 places, 109 transitions, 942 flow. Second operand 10 states and 184 transitions.
[2024-06-14 16:12:05,085 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 147 transitions, 1320 flow
[2024-06-14 16:12:05,113 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 147 transitions, 1128 flow, removed 28 selfloop flow, removed 9 redundant places.
[2024-06-14 16:12:05,115 INFO  L231             Difference]: Finished difference. Result has 103 places, 109 transitions, 862 flow
[2024-06-14 16:12:05,115 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=862, PETRI_PLACES=103, PETRI_TRANSITIONS=109}
[2024-06-14 16:12:05,116 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places.
[2024-06-14 16:12:05,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 862 flow
[2024-06-14 16:12:05,116 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:05,116 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:05,116 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:05,116 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 16:12:05,116 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:05,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:05,117 INFO  L85        PathProgramCache]: Analyzing trace with hash -675204166, now seen corresponding path program 2 times
[2024-06-14 16:12:05,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:05,117 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762766956]
[2024-06-14 16:12:05,117 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:05,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:05,149 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:14,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:14,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:14,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762766956]
[2024-06-14 16:12:14,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762766956] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:14,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:14,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:12:14,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588801712]
[2024-06-14 16:12:14,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:14,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:12:14,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:14,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:12:14,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:12:14,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:12:14,737 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 109 transitions, 862 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:14,737 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:14,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:12:14,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:15,668 INFO  L124   PetriNetUnfolderBase]: 1524/2375 cut-off events.
[2024-06-14 16:12:15,668 INFO  L125   PetriNetUnfolderBase]: For 54116/54116 co-relation queries the response was YES.
[2024-06-14 16:12:15,675 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13523 conditions, 2375 events. 1524/2375 cut-off events. For 54116/54116 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11921 event pairs, 459 based on Foata normal form. 4/2378 useless extension candidates. Maximal degree in co-relation 13478. Up to 2136 conditions per place. 
[2024-06-14 16:12:15,683 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 112 selfloop transitions, 31 changer transitions 0/148 dead transitions.
[2024-06-14 16:12:15,683 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1276 flow
[2024-06-14 16:12:15,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:15,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:15,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-14 16:12:15,686 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-14 16:12:15,686 INFO  L175             Difference]: Start difference. First operand has 103 places, 109 transitions, 862 flow. Second operand 10 states and 177 transitions.
[2024-06-14 16:12:15,686 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1276 flow
[2024-06-14 16:12:15,715 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 1164 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-14 16:12:15,717 INFO  L231             Difference]: Finished difference. Result has 104 places, 111 transitions, 859 flow
[2024-06-14 16:12:15,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=859, PETRI_PLACES=104, PETRI_TRANSITIONS=111}
[2024-06-14 16:12:15,718 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-14 16:12:15,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 111 transitions, 859 flow
[2024-06-14 16:12:15,718 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:15,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:15,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:15,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 16:12:15,719 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:15,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:15,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 1671590518, now seen corresponding path program 3 times
[2024-06-14 16:12:15,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:15,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849255795]
[2024-06-14 16:12:15,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:15,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:15,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:24,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:24,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:24,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849255795]
[2024-06-14 16:12:24,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849255795] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:24,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:24,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:12:24,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282593875]
[2024-06-14 16:12:24,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:24,803 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:12:24,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:24,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:12:24,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:12:24,983 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:12:24,984 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 111 transitions, 859 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:24,984 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:24,984 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:12:24,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:25,899 INFO  L124   PetriNetUnfolderBase]: 1541/2402 cut-off events.
[2024-06-14 16:12:25,899 INFO  L125   PetriNetUnfolderBase]: For 59106/59106 co-relation queries the response was YES.
[2024-06-14 16:12:25,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13897 conditions, 2402 events. 1541/2402 cut-off events. For 59106/59106 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12128 event pairs, 429 based on Foata normal form. 4/2405 useless extension candidates. Maximal degree in co-relation 13851. Up to 2080 conditions per place. 
[2024-06-14 16:12:25,917 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 111 selfloop transitions, 38 changer transitions 0/154 dead transitions.
[2024-06-14 16:12:25,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 154 transitions, 1423 flow
[2024-06-14 16:12:25,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:25,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:25,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-14 16:12:25,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4261904761904762
[2024-06-14 16:12:25,921 INFO  L175             Difference]: Start difference. First operand has 104 places, 111 transitions, 859 flow. Second operand 10 states and 179 transitions.
[2024-06-14 16:12:25,921 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 154 transitions, 1423 flow
[2024-06-14 16:12:25,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 154 transitions, 1332 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-14 16:12:25,961 INFO  L231             Difference]: Finished difference. Result has 106 places, 115 transitions, 935 flow
[2024-06-14 16:12:25,961 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=935, PETRI_PLACES=106, PETRI_TRANSITIONS=115}
[2024-06-14 16:12:25,962 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places.
[2024-06-14 16:12:25,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 115 transitions, 935 flow
[2024-06-14 16:12:25,962 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:25,962 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:25,962 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:25,962 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 16:12:25,963 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:25,963 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:25,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 812102542, now seen corresponding path program 4 times
[2024-06-14 16:12:25,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:25,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826697877]
[2024-06-14 16:12:25,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:25,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:26,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:34,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:34,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:34,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826697877]
[2024-06-14 16:12:34,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826697877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:34,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:34,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:12:34,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233966447]
[2024-06-14 16:12:34,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:34,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:12:34,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:34,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:12:34,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:12:35,074 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:12:35,074 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 115 transitions, 935 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:35,074 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:35,074 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:12:35,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:36,037 INFO  L124   PetriNetUnfolderBase]: 1533/2390 cut-off events.
[2024-06-14 16:12:36,037 INFO  L125   PetriNetUnfolderBase]: For 62705/62705 co-relation queries the response was YES.
[2024-06-14 16:12:36,045 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14026 conditions, 2390 events. 1533/2390 cut-off events. For 62705/62705 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11952 event pairs, 457 based on Foata normal form. 4/2393 useless extension candidates. Maximal degree in co-relation 13979. Up to 2151 conditions per place. 
[2024-06-14 16:12:36,054 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 118 selfloop transitions, 30 changer transitions 0/153 dead transitions.
[2024-06-14 16:12:36,054 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 1325 flow
[2024-06-14 16:12:36,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:12:36,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:12:36,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-14 16:12:36,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 16:12:36,058 INFO  L175             Difference]: Start difference. First operand has 106 places, 115 transitions, 935 flow. Second operand 10 states and 180 transitions.
[2024-06-14 16:12:36,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 1325 flow
[2024-06-14 16:12:36,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 153 transitions, 1227 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-14 16:12:36,105 INFO  L231             Difference]: Finished difference. Result has 110 places, 115 transitions, 904 flow
[2024-06-14 16:12:36,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=904, PETRI_PLACES=110, PETRI_TRANSITIONS=115}
[2024-06-14 16:12:36,106 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-14 16:12:36,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 904 flow
[2024-06-14 16:12:36,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:36,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:36,107 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:36,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 16:12:36,107 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:36,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:36,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -874781862, now seen corresponding path program 2 times
[2024-06-14 16:12:36,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:36,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689581958]
[2024-06-14 16:12:36,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:36,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:36,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:43,885 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:43,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:43,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689581958]
[2024-06-14 16:12:43,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689581958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:43,888 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:43,888 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:12:43,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208559586]
[2024-06-14 16:12:43,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:43,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:12:43,889 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:43,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:12:43,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:12:43,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:12:43,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 115 transitions, 904 flow. Second operand  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 16:12:43,988 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:43,988 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:12:43,988 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:44,685 INFO  L124   PetriNetUnfolderBase]: 1374/2205 cut-off events.
[2024-06-14 16:12:44,685 INFO  L125   PetriNetUnfolderBase]: For 63747/63757 co-relation queries the response was YES.
[2024-06-14 16:12:44,692 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13062 conditions, 2205 events. 1374/2205 cut-off events. For 63747/63757 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11219 event pairs, 489 based on Foata normal form. 4/2194 useless extension candidates. Maximal degree in co-relation 13013. Up to 1981 conditions per place. 
[2024-06-14 16:12:44,698 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 93 selfloop transitions, 22 changer transitions 0/131 dead transitions.
[2024-06-14 16:12:44,699 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 131 transitions, 1174 flow
[2024-06-14 16:12:44,699 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:12:44,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:12:44,700 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 16:12:44,700 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-14 16:12:44,700 INFO  L175             Difference]: Start difference. First operand has 110 places, 115 transitions, 904 flow. Second operand 7 states and 128 transitions.
[2024-06-14 16:12:44,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 131 transitions, 1174 flow
[2024-06-14 16:12:44,745 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 131 transitions, 1085 flow, removed 10 selfloop flow, removed 9 redundant places.
[2024-06-14 16:12:44,746 INFO  L231             Difference]: Finished difference. Result has 108 places, 115 transitions, 867 flow
[2024-06-14 16:12:44,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=867, PETRI_PLACES=108, PETRI_TRANSITIONS=115}
[2024-06-14 16:12:44,751 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-14 16:12:44,752 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 115 transitions, 867 flow
[2024-06-14 16:12:44,752 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-14 16:12:44,752 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:44,752 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:44,752 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 16:12:44,752 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:44,753 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:44,753 INFO  L85        PathProgramCache]: Analyzing trace with hash 682097840, now seen corresponding path program 1 times
[2024-06-14 16:12:44,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:44,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779085398]
[2024-06-14 16:12:44,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:44,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:44,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:12:51,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:12:51,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:12:51,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779085398]
[2024-06-14 16:12:51,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779085398] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:12:51,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:12:51,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:12:51,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820078534]
[2024-06-14 16:12:51,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:12:51,735 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:12:51,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:12:51,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:12:51,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:12:51,807 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:12:51,807 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 115 transitions, 867 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:51,807 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:12:51,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:12:51,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:12:52,595 INFO  L124   PetriNetUnfolderBase]: 1522/2375 cut-off events.
[2024-06-14 16:12:52,595 INFO  L125   PetriNetUnfolderBase]: For 67259/67259 co-relation queries the response was YES.
[2024-06-14 16:12:52,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14012 conditions, 2375 events. 1522/2375 cut-off events. For 67259/67259 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11888 event pairs, 503 based on Foata normal form. 1/2375 useless extension candidates. Maximal degree in co-relation 13962. Up to 2261 conditions per place. 
[2024-06-14 16:12:52,609 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 114 selfloop transitions, 11 changer transitions 0/130 dead transitions.
[2024-06-14 16:12:52,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 130 transitions, 1177 flow
[2024-06-14 16:12:52,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:12:52,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:12:52,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-14 16:12:52,611 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-14 16:12:52,611 INFO  L175             Difference]: Start difference. First operand has 108 places, 115 transitions, 867 flow. Second operand 6 states and 103 transitions.
[2024-06-14 16:12:52,611 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 130 transitions, 1177 flow
[2024-06-14 16:12:52,657 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 130 transitions, 1116 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-14 16:12:52,659 INFO  L231             Difference]: Finished difference. Result has 108 places, 118 transitions, 870 flow
[2024-06-14 16:12:52,659 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=870, PETRI_PLACES=108, PETRI_TRANSITIONS=118}
[2024-06-14 16:12:52,661 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-14 16:12:52,662 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 870 flow
[2024-06-14 16:12:52,662 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:12:52,662 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:12:52,662 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:12:52,662 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 16:12:52,663 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:12:52,663 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:12:52,663 INFO  L85        PathProgramCache]: Analyzing trace with hash 682247570, now seen corresponding path program 2 times
[2024-06-14 16:12:52,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:12:52,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196355880]
[2024-06-14 16:12:52,663 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:12:52,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:12:52,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:00,043 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:00,043 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:00,043 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196355880]
[2024-06-14 16:13:00,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196355880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:00,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:00,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 16:13:00,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460141860]
[2024-06-14 16:13:00,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:00,044 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 16:13:00,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:00,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 16:13:00,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 16:13:00,140 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:13:00,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 118 transitions, 870 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:00,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:00,142 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:13:00,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:00,811 INFO  L124   PetriNetUnfolderBase]: 1519/2372 cut-off events.
[2024-06-14 16:13:00,811 INFO  L125   PetriNetUnfolderBase]: For 70961/70963 co-relation queries the response was YES.
[2024-06-14 16:13:00,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14297 conditions, 2372 events. 1519/2372 cut-off events. For 70961/70963 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11921 event pairs, 507 based on Foata normal form. 3/2374 useless extension candidates. Maximal degree in co-relation 14246. Up to 2251 conditions per place. 
[2024-06-14 16:13:00,826 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 109 selfloop transitions, 16 changer transitions 0/130 dead transitions.
[2024-06-14 16:13:00,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 130 transitions, 1178 flow
[2024-06-14 16:13:00,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 16:13:00,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 16:13:00,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 16:13:00,827 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-14 16:13:00,827 INFO  L175             Difference]: Start difference. First operand has 108 places, 118 transitions, 870 flow. Second operand 6 states and 102 transitions.
[2024-06-14 16:13:00,828 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 130 transitions, 1178 flow
[2024-06-14 16:13:00,871 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 130 transitions, 1136 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-14 16:13:00,873 INFO  L231             Difference]: Finished difference. Result has 110 places, 121 transitions, 908 flow
[2024-06-14 16:13:00,873 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=110, PETRI_TRANSITIONS=121}
[2024-06-14 16:13:00,873 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-14 16:13:00,873 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 121 transitions, 908 flow
[2024-06-14 16:13:00,873 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:00,874 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:00,874 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:00,874 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 16:13:00,874 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:00,874 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:00,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 1851456156, now seen corresponding path program 1 times
[2024-06-14 16:13:00,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:00,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337116951]
[2024-06-14 16:13:00,875 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:00,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:00,915 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:08,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:08,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:08,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337116951]
[2024-06-14 16:13:08,970 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337116951] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:08,970 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:08,970 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:13:08,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952795869]
[2024-06-14 16:13:08,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:08,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:13:08,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:08,971 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:13:08,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:13:09,120 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:13:09,120 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 121 transitions, 908 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:09,120 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:09,120 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:13:09,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:09,818 INFO  L124   PetriNetUnfolderBase]: 1394/2233 cut-off events.
[2024-06-14 16:13:09,818 INFO  L125   PetriNetUnfolderBase]: For 74146/74156 co-relation queries the response was YES.
[2024-06-14 16:13:09,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13945 conditions, 2233 events. 1394/2233 cut-off events. For 74146/74156 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 11419 event pairs, 486 based on Foata normal form. 3/2221 useless extension candidates. Maximal degree in co-relation 13893. Up to 1978 conditions per place. 
[2024-06-14 16:13:09,834 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 99 selfloop transitions, 27 changer transitions 0/142 dead transitions.
[2024-06-14 16:13:09,834 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 142 transitions, 1248 flow
[2024-06-14 16:13:09,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:13:09,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:13:09,835 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 16:13:09,835 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-14 16:13:09,835 INFO  L175             Difference]: Start difference. First operand has 110 places, 121 transitions, 908 flow. Second operand 8 states and 143 transitions.
[2024-06-14 16:13:09,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 142 transitions, 1248 flow
[2024-06-14 16:13:09,875 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 142 transitions, 1190 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-14 16:13:09,877 INFO  L231             Difference]: Finished difference. Result has 114 places, 125 transitions, 965 flow
[2024-06-14 16:13:09,877 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=965, PETRI_PLACES=114, PETRI_TRANSITIONS=125}
[2024-06-14 16:13:09,878 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places.
[2024-06-14 16:13:09,878 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 125 transitions, 965 flow
[2024-06-14 16:13:09,878 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:09,878 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:09,878 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:09,878 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 16:13:09,879 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:09,879 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:09,879 INFO  L85        PathProgramCache]: Analyzing trace with hash 1026709730, now seen corresponding path program 1 times
[2024-06-14 16:13:09,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:09,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011643344]
[2024-06-14 16:13:09,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:09,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:09,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:20,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:20,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:20,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011643344]
[2024-06-14 16:13:20,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011643344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:20,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:20,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:20,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326395898]
[2024-06-14 16:13:20,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:20,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:20,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:20,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:20,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:20,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:13:20,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 125 transitions, 965 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:20,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:20,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:13:20,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:21,232 INFO  L124   PetriNetUnfolderBase]: 1568/2451 cut-off events.
[2024-06-14 16:13:21,233 INFO  L125   PetriNetUnfolderBase]: For 81955/81955 co-relation queries the response was YES.
[2024-06-14 16:13:21,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15775 conditions, 2451 events. 1568/2451 cut-off events. For 81955/81955 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12335 event pairs, 344 based on Foata normal form. 4/2454 useless extension candidates. Maximal degree in co-relation 15722. Up to 2220 conditions per place. 
[2024-06-14 16:13:21,250 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 132 selfloop transitions, 22 changer transitions 0/159 dead transitions.
[2024-06-14 16:13:21,250 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 159 transitions, 1545 flow
[2024-06-14 16:13:21,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:13:21,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:13:21,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 16:13:21,252 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-14 16:13:21,253 INFO  L175             Difference]: Start difference. First operand has 114 places, 125 transitions, 965 flow. Second operand 8 states and 147 transitions.
[2024-06-14 16:13:21,253 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 159 transitions, 1545 flow
[2024-06-14 16:13:21,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 159 transitions, 1458 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-14 16:13:21,309 INFO  L231             Difference]: Finished difference. Result has 116 places, 129 transitions, 1025 flow
[2024-06-14 16:13:21,310 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1025, PETRI_PLACES=116, PETRI_TRANSITIONS=129}
[2024-06-14 16:13:21,310 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-14 16:13:21,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 1025 flow
[2024-06-14 16:13:21,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:21,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:21,310 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:21,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 16:13:21,311 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:21,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:21,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392003820, now seen corresponding path program 2 times
[2024-06-14 16:13:21,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:21,311 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687899644]
[2024-06-14 16:13:21,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:21,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:21,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:31,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:31,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:31,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687899644]
[2024-06-14 16:13:31,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687899644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:31,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:31,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:31,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157005171]
[2024-06-14 16:13:31,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:31,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:31,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:31,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:31,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:31,978 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:13:31,978 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 129 transitions, 1025 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:31,978 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:31,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:13:31,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:32,911 INFO  L124   PetriNetUnfolderBase]: 1560/2435 cut-off events.
[2024-06-14 16:13:32,911 INFO  L125   PetriNetUnfolderBase]: For 86213/86213 co-relation queries the response was YES.
[2024-06-14 16:13:32,920 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15838 conditions, 2435 events. 1560/2435 cut-off events. For 86213/86213 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12238 event pairs, 467 based on Foata normal form. 4/2438 useless extension candidates. Maximal degree in co-relation 15784. Up to 2267 conditions per place. 
[2024-06-14 16:13:32,929 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 129 selfloop transitions, 18 changer transitions 0/152 dead transitions.
[2024-06-14 16:13:32,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 1377 flow
[2024-06-14 16:13:32,931 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:13:32,931 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:13:32,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 16:13:32,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-14 16:13:32,932 INFO  L175             Difference]: Start difference. First operand has 116 places, 129 transitions, 1025 flow. Second operand 7 states and 128 transitions.
[2024-06-14 16:13:32,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 1377 flow
[2024-06-14 16:13:32,984 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 152 transitions, 1275 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-14 16:13:32,986 INFO  L231             Difference]: Finished difference. Result has 119 places, 129 transitions, 966 flow
[2024-06-14 16:13:32,986 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=966, PETRI_PLACES=119, PETRI_TRANSITIONS=129}
[2024-06-14 16:13:32,986 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places.
[2024-06-14 16:13:32,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 966 flow
[2024-06-14 16:13:32,986 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:32,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:32,987 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:32,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 16:13:32,987 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:32,987 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:32,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -2057950874, now seen corresponding path program 3 times
[2024-06-14 16:13:32,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:32,988 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395644103]
[2024-06-14 16:13:32,988 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:32,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:33,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:43,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:43,288 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:43,288 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395644103]
[2024-06-14 16:13:43,288 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395644103] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:43,288 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:43,288 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:43,288 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241445865]
[2024-06-14 16:13:43,288 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:43,290 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:43,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:43,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:43,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:43,383 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:13:43,384 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 966 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:43,384 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:43,384 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:13:43,384 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:44,509 INFO  L124   PetriNetUnfolderBase]: 1577/2463 cut-off events.
[2024-06-14 16:13:44,510 INFO  L125   PetriNetUnfolderBase]: For 92024/92026 co-relation queries the response was YES.
[2024-06-14 16:13:44,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16034 conditions, 2463 events. 1577/2463 cut-off events. For 92024/92026 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12411 event pairs, 471 based on Foata normal form. 6/2468 useless extension candidates. Maximal degree in co-relation 15978. Up to 2258 conditions per place. 
[2024-06-14 16:13:44,529 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 125 selfloop transitions, 28 changer transitions 0/158 dead transitions.
[2024-06-14 16:13:44,529 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 158 transitions, 1390 flow
[2024-06-14 16:13:44,531 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:13:44,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:13:44,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 16:13:44,532 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-14 16:13:44,532 INFO  L175             Difference]: Start difference. First operand has 119 places, 129 transitions, 966 flow. Second operand 8 states and 146 transitions.
[2024-06-14 16:13:44,532 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 158 transitions, 1390 flow
[2024-06-14 16:13:44,583 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 1349 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-14 16:13:44,584 INFO  L231             Difference]: Finished difference. Result has 121 places, 131 transitions, 1042 flow
[2024-06-14 16:13:44,585 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1042, PETRI_PLACES=121, PETRI_TRANSITIONS=131}
[2024-06-14 16:13:44,585 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-14 16:13:44,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 131 transitions, 1042 flow
[2024-06-14 16:13:44,585 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:44,585 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:44,586 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:44,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 16:13:44,586 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:44,586 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:44,586 INFO  L85        PathProgramCache]: Analyzing trace with hash -425625132, now seen corresponding path program 4 times
[2024-06-14 16:13:44,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:44,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063449585]
[2024-06-14 16:13:44,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:44,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:44,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:13:54,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:13:54,801 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:13:54,801 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063449585]
[2024-06-14 16:13:54,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063449585] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:13:54,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:13:54,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:13:54,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271003565]
[2024-06-14 16:13:54,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:13:54,802 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:13:54,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:13:54,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:13:54,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:13:54,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:13:54,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 131 transitions, 1042 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:54,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:13:54,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:13:54,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:13:55,837 INFO  L124   PetriNetUnfolderBase]: 1569/2450 cut-off events.
[2024-06-14 16:13:55,837 INFO  L125   PetriNetUnfolderBase]: For 96074/96074 co-relation queries the response was YES.
[2024-06-14 16:13:55,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16154 conditions, 2450 events. 1569/2450 cut-off events. For 96074/96074 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12295 event pairs, 465 based on Foata normal form. 4/2453 useless extension candidates. Maximal degree in co-relation 16097. Up to 2246 conditions per place. 
[2024-06-14 16:13:55,855 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 134 selfloop transitions, 29 changer transitions 0/168 dead transitions.
[2024-06-14 16:13:55,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 1510 flow
[2024-06-14 16:13:55,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:13:55,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:13:55,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-14 16:13:55,880 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-14 16:13:55,880 INFO  L175             Difference]: Start difference. First operand has 121 places, 131 transitions, 1042 flow. Second operand 10 states and 176 transitions.
[2024-06-14 16:13:55,880 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 1510 flow
[2024-06-14 16:13:55,941 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 168 transitions, 1411 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-14 16:13:55,943 INFO  L231             Difference]: Finished difference. Result has 125 places, 133 transitions, 1066 flow
[2024-06-14 16:13:55,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=943, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1066, PETRI_PLACES=125, PETRI_TRANSITIONS=133}
[2024-06-14 16:13:55,943 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-14 16:13:55,943 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 1066 flow
[2024-06-14 16:13:55,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:13:55,944 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:13:55,944 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:13:55,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 16:13:55,944 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:13:55,944 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:13:55,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -329922417, now seen corresponding path program 1 times
[2024-06-14 16:13:55,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:13:55,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929137324]
[2024-06-14 16:13:55,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:13:55,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:13:55,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:03,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:03,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:03,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929137324]
[2024-06-14 16:14:03,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929137324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:03,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:03,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:14:03,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049744343]
[2024-06-14 16:14:03,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:03,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:14:03,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:03,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:14:03,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:14:03,702 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:14:03,703 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 133 transitions, 1066 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:03,703 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:03,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:14:03,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:04,492 INFO  L124   PetriNetUnfolderBase]: 1579/2459 cut-off events.
[2024-06-14 16:14:04,492 INFO  L125   PetriNetUnfolderBase]: For 100675/100675 co-relation queries the response was YES.
[2024-06-14 16:14:04,503 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16392 conditions, 2459 events. 1579/2459 cut-off events. For 100675/100675 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12294 event pairs, 439 based on Foata normal form. 2/2460 useless extension candidates. Maximal degree in co-relation 16334. Up to 2329 conditions per place. 
[2024-06-14 16:14:04,512 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 134 selfloop transitions, 17 changer transitions 0/156 dead transitions.
[2024-06-14 16:14:04,512 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 1465 flow
[2024-06-14 16:14:04,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:14:04,513 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:14:04,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 16:14:04,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-14 16:14:04,513 INFO  L175             Difference]: Start difference. First operand has 125 places, 133 transitions, 1066 flow. Second operand 7 states and 121 transitions.
[2024-06-14 16:14:04,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 1465 flow
[2024-06-14 16:14:04,566 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 156 transitions, 1360 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-14 16:14:04,569 INFO  L231             Difference]: Finished difference. Result has 125 places, 139 transitions, 1068 flow
[2024-06-14 16:14:04,569 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1068, PETRI_PLACES=125, PETRI_TRANSITIONS=139}
[2024-06-14 16:14:04,570 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-14 16:14:04,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 1068 flow
[2024-06-14 16:14:04,570 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:04,570 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:04,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:04,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 16:14:04,571 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:04,571 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:04,571 INFO  L85        PathProgramCache]: Analyzing trace with hash -329802447, now seen corresponding path program 2 times
[2024-06-14 16:14:04,571 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:04,571 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732397773]
[2024-06-14 16:14:04,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:04,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:04,622 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:12,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:12,121 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:12,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732397773]
[2024-06-14 16:14:12,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732397773] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:12,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:12,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:14:12,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169947137]
[2024-06-14 16:14:12,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:12,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:14:12,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:12,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:14:12,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:14:12,240 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:14:12,240 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 139 transitions, 1068 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:12,241 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:12,241 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:14:12,241 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:13,033 INFO  L124   PetriNetUnfolderBase]: 1597/2484 cut-off events.
[2024-06-14 16:14:13,033 INFO  L125   PetriNetUnfolderBase]: For 106458/106458 co-relation queries the response was YES.
[2024-06-14 16:14:13,043 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16966 conditions, 2484 events. 1597/2484 cut-off events. For 106458/106458 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12404 event pairs, 439 based on Foata normal form. 2/2485 useless extension candidates. Maximal degree in co-relation 16906. Up to 2341 conditions per place. 
[2024-06-14 16:14:13,050 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 132 selfloop transitions, 24 changer transitions 0/161 dead transitions.
[2024-06-14 16:14:13,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1584 flow
[2024-06-14 16:14:13,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:14:13,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:14:13,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-14 16:14:13,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-14 16:14:13,051 INFO  L175             Difference]: Start difference. First operand has 125 places, 139 transitions, 1068 flow. Second operand 7 states and 122 transitions.
[2024-06-14 16:14:13,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1584 flow
[2024-06-14 16:14:13,105 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 161 transitions, 1532 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-14 16:14:13,107 INFO  L231             Difference]: Finished difference. Result has 129 places, 145 transitions, 1168 flow
[2024-06-14 16:14:13,108 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1168, PETRI_PLACES=129, PETRI_TRANSITIONS=145}
[2024-06-14 16:14:13,108 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-14 16:14:13,108 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 145 transitions, 1168 flow
[2024-06-14 16:14:13,108 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:13,108 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:13,108 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:13,109 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 16:14:13,109 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:13,109 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:13,109 INFO  L85        PathProgramCache]: Analyzing trace with hash -329802261, now seen corresponding path program 1 times
[2024-06-14 16:14:13,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:13,110 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213651612]
[2024-06-14 16:14:13,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:13,110 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:13,145 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:20,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-14 16:14:20,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:20,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213651612]
[2024-06-14 16:14:20,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213651612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:20,850 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:20,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:14:20,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419663271]
[2024-06-14 16:14:20,850 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:20,850 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:14:20,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:20,850 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:14:20,850 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:14:20,922 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:14:20,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 145 transitions, 1168 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:20,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:20,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:14:20,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:21,871 INFO  L124   PetriNetUnfolderBase]: 1625/2525 cut-off events.
[2024-06-14 16:14:21,872 INFO  L125   PetriNetUnfolderBase]: For 114453/114453 co-relation queries the response was YES.
[2024-06-14 16:14:21,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17691 conditions, 2525 events. 1625/2525 cut-off events. For 114453/114453 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12629 event pairs, 437 based on Foata normal form. 2/2526 useless extension candidates. Maximal degree in co-relation 17630. Up to 2362 conditions per place. 
[2024-06-14 16:14:21,890 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 146 selfloop transitions, 27 changer transitions 0/178 dead transitions.
[2024-06-14 16:14:21,891 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 178 transitions, 1758 flow
[2024-06-14 16:14:21,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:14:21,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:14:21,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-14 16:14:21,892 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41005291005291006
[2024-06-14 16:14:21,892 INFO  L175             Difference]: Start difference. First operand has 129 places, 145 transitions, 1168 flow. Second operand 9 states and 155 transitions.
[2024-06-14 16:14:21,892 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 178 transitions, 1758 flow
[2024-06-14 16:14:21,959 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 178 transitions, 1698 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-14 16:14:21,961 INFO  L231             Difference]: Finished difference. Result has 136 places, 153 transitions, 1300 flow
[2024-06-14 16:14:21,962 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1300, PETRI_PLACES=136, PETRI_TRANSITIONS=153}
[2024-06-14 16:14:21,962 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-14 16:14:21,962 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 153 transitions, 1300 flow
[2024-06-14 16:14:21,963 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:21,963 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:21,963 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:21,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 16:14:21,963 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:21,963 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:21,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -152670741, now seen corresponding path program 2 times
[2024-06-14 16:14:21,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:21,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058145973]
[2024-06-14 16:14:21,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:21,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:22,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:30,129 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:30,129 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:30,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058145973]
[2024-06-14 16:14:30,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058145973] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:30,130 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:30,130 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:14:30,130 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538681045]
[2024-06-14 16:14:30,130 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:30,130 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:14:30,131 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:30,131 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:14:30,131 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:14:30,281 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:14:30,281 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 153 transitions, 1300 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:30,281 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:30,281 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:14:30,281 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:31,116 INFO  L124   PetriNetUnfolderBase]: 1637/2543 cut-off events.
[2024-06-14 16:14:31,116 INFO  L125   PetriNetUnfolderBase]: For 122039/122043 co-relation queries the response was YES.
[2024-06-14 16:14:31,128 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18445 conditions, 2543 events. 1637/2543 cut-off events. For 122039/122043 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12720 event pairs, 438 based on Foata normal form. 6/2548 useless extension candidates. Maximal degree in co-relation 18381. Up to 2326 conditions per place. 
[2024-06-14 16:14:31,136 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 145 selfloop transitions, 39 changer transitions 0/189 dead transitions.
[2024-06-14 16:14:31,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 189 transitions, 2072 flow
[2024-06-14 16:14:31,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:14:31,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:14:31,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 16:14:31,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 16:14:31,138 INFO  L175             Difference]: Start difference. First operand has 136 places, 153 transitions, 1300 flow. Second operand 8 states and 142 transitions.
[2024-06-14 16:14:31,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 189 transitions, 2072 flow
[2024-06-14 16:14:31,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 189 transitions, 1982 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-14 16:14:31,209 INFO  L231             Difference]: Finished difference. Result has 141 places, 167 transitions, 1516 flow
[2024-06-14 16:14:31,209 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1516, PETRI_PLACES=141, PETRI_TRANSITIONS=167}
[2024-06-14 16:14:31,210 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 98 predicate places.
[2024-06-14 16:14:31,210 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 1516 flow
[2024-06-14 16:14:31,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:31,210 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:31,210 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:31,211 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 16:14:31,211 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:31,212 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:31,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -152670927, now seen corresponding path program 3 times
[2024-06-14 16:14:31,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:31,213 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607719786]
[2024-06-14 16:14:31,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:31,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:31,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:38,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:14:38,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:38,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607719786]
[2024-06-14 16:14:38,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607719786] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:38,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:38,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:14:38,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651795944]
[2024-06-14 16:14:38,719 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:38,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:14:38,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:38,719 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:14:38,719 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:14:38,841 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:14:38,841 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 167 transitions, 1516 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:38,841 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:38,841 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:14:38,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:39,583 INFO  L124   PetriNetUnfolderBase]: 1631/2540 cut-off events.
[2024-06-14 16:14:39,583 INFO  L125   PetriNetUnfolderBase]: For 130305/130307 co-relation queries the response was YES.
[2024-06-14 16:14:39,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18953 conditions, 2540 events. 1631/2540 cut-off events. For 130305/130307 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12796 event pairs, 446 based on Foata normal form. 2/2541 useless extension candidates. Maximal degree in co-relation 18885. Up to 2377 conditions per place. 
[2024-06-14 16:14:39,606 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 147 selfloop transitions, 31 changer transitions 0/183 dead transitions.
[2024-06-14 16:14:39,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 183 transitions, 2042 flow
[2024-06-14 16:14:39,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:14:39,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:14:39,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-14 16:14:39,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-14 16:14:39,608 INFO  L175             Difference]: Start difference. First operand has 141 places, 167 transitions, 1516 flow. Second operand 7 states and 121 transitions.
[2024-06-14 16:14:39,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 183 transitions, 2042 flow
[2024-06-14 16:14:39,707 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 1928 flow, removed 48 selfloop flow, removed 3 redundant places.
[2024-06-14 16:14:39,710 INFO  L231             Difference]: Finished difference. Result has 145 places, 170 transitions, 1536 flow
[2024-06-14 16:14:39,710 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1536, PETRI_PLACES=145, PETRI_TRANSITIONS=170}
[2024-06-14 16:14:39,710 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-14 16:14:39,710 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 170 transitions, 1536 flow
[2024-06-14 16:14:39,711 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:39,711 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:39,711 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:39,711 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 16:14:39,711 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:39,711 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:39,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -152433591, now seen corresponding path program 3 times
[2024-06-14 16:14:39,712 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:39,712 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771685672]
[2024-06-14 16:14:39,712 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:39,712 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:39,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:47,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-14 16:14:47,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:47,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771685672]
[2024-06-14 16:14:47,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771685672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:47,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:47,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:14:47,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942348974]
[2024-06-14 16:14:47,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:47,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:14:47,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:47,125 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:14:47,125 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:14:47,248 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:14:47,249 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 170 transitions, 1536 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:47,249 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:47,249 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:14:47,249 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:48,069 INFO  L124   PetriNetUnfolderBase]: 1633/2544 cut-off events.
[2024-06-14 16:14:48,069 INFO  L125   PetriNetUnfolderBase]: For 133703/133707 co-relation queries the response was YES.
[2024-06-14 16:14:48,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18973 conditions, 2544 events. 1633/2544 cut-off events. For 133703/133707 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12787 event pairs, 438 based on Foata normal form. 6/2549 useless extension candidates. Maximal degree in co-relation 18903. Up to 2322 conditions per place. 
[2024-06-14 16:14:48,090 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 48 changer transitions 0/195 dead transitions.
[2024-06-14 16:14:48,090 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 195 transitions, 2124 flow
[2024-06-14 16:14:48,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:14:48,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:14:48,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-14 16:14:48,093 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-14 16:14:48,093 INFO  L175             Difference]: Start difference. First operand has 145 places, 170 transitions, 1536 flow. Second operand 8 states and 141 transitions.
[2024-06-14 16:14:48,093 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 195 transitions, 2124 flow
[2024-06-14 16:14:48,158 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 195 transitions, 2012 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-06-14 16:14:48,161 INFO  L231             Difference]: Finished difference. Result has 149 places, 177 transitions, 1645 flow
[2024-06-14 16:14:48,161 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1645, PETRI_PLACES=149, PETRI_TRANSITIONS=177}
[2024-06-14 16:14:48,162 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places.
[2024-06-14 16:14:48,162 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 177 transitions, 1645 flow
[2024-06-14 16:14:48,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:48,162 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:48,162 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:48,162 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 16:14:48,163 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:48,163 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:48,163 INFO  L85        PathProgramCache]: Analyzing trace with hash 1560567229, now seen corresponding path program 1 times
[2024-06-14 16:14:48,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:48,163 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914412486]
[2024-06-14 16:14:48,163 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:48,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:48,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:14:56,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-14 16:14:56,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:14:56,625 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914412486]
[2024-06-14 16:14:56,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914412486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:14:56,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:14:56,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:14:56,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325328215]
[2024-06-14 16:14:56,627 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:14:56,627 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:14:56,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:14:56,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:14:56,628 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:14:56,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:14:56,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 177 transitions, 1645 flow. Second operand  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:56,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:14:56,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:14:56,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:14:57,593 INFO  L124   PetriNetUnfolderBase]: 1534/2443 cut-off events.
[2024-06-14 16:14:57,594 INFO  L125   PetriNetUnfolderBase]: For 145439/145459 co-relation queries the response was YES.
[2024-06-14 16:14:57,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18543 conditions, 2443 events. 1534/2443 cut-off events. For 145439/145459 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 12421 event pairs, 431 based on Foata normal form. 12/2434 useless extension candidates. Maximal degree in co-relation 18471. Up to 2122 conditions per place. 
[2024-06-14 16:14:57,614 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 36 changer transitions 0/201 dead transitions.
[2024-06-14 16:14:57,614 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 201 transitions, 2115 flow
[2024-06-14 16:14:57,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:14:57,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:14:57,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-14 16:14:57,615 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-14 16:14:57,615 INFO  L175             Difference]: Start difference. First operand has 149 places, 177 transitions, 1645 flow. Second operand 9 states and 160 transitions.
[2024-06-14 16:14:57,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 201 transitions, 2115 flow
[2024-06-14 16:14:57,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 201 transitions, 2021 flow, removed 24 selfloop flow, removed 4 redundant places.
[2024-06-14 16:14:57,719 INFO  L231             Difference]: Finished difference. Result has 154 places, 179 transitions, 1679 flow
[2024-06-14 16:14:57,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1679, PETRI_PLACES=154, PETRI_TRANSITIONS=179}
[2024-06-14 16:14:57,720 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places.
[2024-06-14 16:14:57,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 179 transitions, 1679 flow
[2024-06-14 16:14:57,720 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:14:57,720 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:14:57,721 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:14:57,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 16:14:57,721 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:14:57,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:14:57,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 761509651, now seen corresponding path program 1 times
[2024-06-14 16:14:57,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:14:57,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935735908]
[2024-06-14 16:14:57,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:14:57,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:14:57,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:08,274 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:08,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:08,275 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935735908]
[2024-06-14 16:15:08,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935735908] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:08,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:08,276 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:08,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172982225]
[2024-06-14 16:15:08,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:08,276 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:08,277 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:08,278 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:08,278 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:08,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:15:08,391 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 179 transitions, 1679 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:08,391 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:08,391 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:15:08,392 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:09,655 INFO  L124   PetriNetUnfolderBase]: 1833/2865 cut-off events.
[2024-06-14 16:15:09,656 INFO  L125   PetriNetUnfolderBase]: For 174390/174390 co-relation queries the response was YES.
[2024-06-14 16:15:09,666 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22021 conditions, 2865 events. 1833/2865 cut-off events. For 174390/174390 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15000 event pairs, 373 based on Foata normal form. 16/2880 useless extension candidates. Maximal degree in co-relation 21948. Up to 2370 conditions per place. 
[2024-06-14 16:15:09,675 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 203 selfloop transitions, 23 changer transitions 0/231 dead transitions.
[2024-06-14 16:15:09,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 231 transitions, 2511 flow
[2024-06-14 16:15:09,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:15:09,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:15:09,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 16:15:09,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 16:15:09,677 INFO  L175             Difference]: Start difference. First operand has 154 places, 179 transitions, 1679 flow. Second operand 10 states and 188 transitions.
[2024-06-14 16:15:09,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 231 transitions, 2511 flow
[2024-06-14 16:15:09,778 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 231 transitions, 2407 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-14 16:15:09,780 INFO  L231             Difference]: Finished difference. Result has 157 places, 181 transitions, 1705 flow
[2024-06-14 16:15:09,781 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1705, PETRI_PLACES=157, PETRI_TRANSITIONS=181}
[2024-06-14 16:15:09,782 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places.
[2024-06-14 16:15:09,782 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 181 transitions, 1705 flow
[2024-06-14 16:15:09,782 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:09,782 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:09,782 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:09,782 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 16:15:09,782 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:09,783 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:09,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 1766892781, now seen corresponding path program 2 times
[2024-06-14 16:15:09,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:09,783 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920713884]
[2024-06-14 16:15:09,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:09,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:09,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:20,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-14 16:15:20,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:20,163 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920713884]
[2024-06-14 16:15:20,164 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920713884] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:20,164 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:20,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:20,164 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29694937]
[2024-06-14 16:15:20,164 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:20,164 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:20,164 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:20,165 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:20,165 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:20,293 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:15:20,294 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 181 transitions, 1705 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:20,294 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:20,294 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:15:20,294 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:21,467 INFO  L124   PetriNetUnfolderBase]: 1891/2974 cut-off events.
[2024-06-14 16:15:21,467 INFO  L125   PetriNetUnfolderBase]: For 181958/181958 co-relation queries the response was YES.
[2024-06-14 16:15:21,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22750 conditions, 2974 events. 1891/2974 cut-off events. For 181958/181958 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15760 event pairs, 431 based on Foata normal form. 16/2989 useless extension candidates. Maximal degree in co-relation 22676. Up to 2486 conditions per place. 
[2024-06-14 16:15:21,491 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 189 selfloop transitions, 26 changer transitions 0/220 dead transitions.
[2024-06-14 16:15:21,491 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 220 transitions, 2453 flow
[2024-06-14 16:15:21,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:15:21,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:15:21,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-14 16:15:21,494 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-14 16:15:21,494 INFO  L175             Difference]: Start difference. First operand has 157 places, 181 transitions, 1705 flow. Second operand 8 states and 155 transitions.
[2024-06-14 16:15:21,494 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 220 transitions, 2453 flow
[2024-06-14 16:15:21,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 220 transitions, 2394 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-14 16:15:21,618 INFO  L231             Difference]: Finished difference. Result has 159 places, 182 transitions, 1744 flow
[2024-06-14 16:15:21,619 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1744, PETRI_PLACES=159, PETRI_TRANSITIONS=182}
[2024-06-14 16:15:21,619 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places.
[2024-06-14 16:15:21,619 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 182 transitions, 1744 flow
[2024-06-14 16:15:21,619 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:21,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:21,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:21,620 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 16:15:21,620 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:21,620 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:21,620 INFO  L85        PathProgramCache]: Analyzing trace with hash 1767040651, now seen corresponding path program 3 times
[2024-06-14 16:15:21,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:21,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582732889]
[2024-06-14 16:15:21,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:21,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:21,641 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:32,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:32,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:32,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582732889]
[2024-06-14 16:15:32,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582732889] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:32,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:32,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:32,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359236319]
[2024-06-14 16:15:32,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:32,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:32,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:32,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:32,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:32,218 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:15:32,218 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 182 transitions, 1744 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:32,218 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:32,218 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:15:32,218 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:33,379 INFO  L124   PetriNetUnfolderBase]: 1855/2918 cut-off events.
[2024-06-14 16:15:33,379 INFO  L125   PetriNetUnfolderBase]: For 178534/178534 co-relation queries the response was YES.
[2024-06-14 16:15:33,392 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21692 conditions, 2918 events. 1855/2918 cut-off events. For 178534/178534 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15375 event pairs, 433 based on Foata normal form. 20/2937 useless extension candidates. Maximal degree in co-relation 21616. Up to 2586 conditions per place. 
[2024-06-14 16:15:33,402 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 184 selfloop transitions, 25 changer transitions 0/214 dead transitions.
[2024-06-14 16:15:33,403 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 214 transitions, 2272 flow
[2024-06-14 16:15:33,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:15:33,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:15:33,405 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 16:15:33,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-14 16:15:33,405 INFO  L175             Difference]: Start difference. First operand has 159 places, 182 transitions, 1744 flow. Second operand 8 states and 150 transitions.
[2024-06-14 16:15:33,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 214 transitions, 2272 flow
[2024-06-14 16:15:33,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 2191 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-14 16:15:33,523 INFO  L231             Difference]: Finished difference. Result has 162 places, 182 transitions, 1723 flow
[2024-06-14 16:15:33,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1663, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1723, PETRI_PLACES=162, PETRI_TRANSITIONS=182}
[2024-06-14 16:15:33,523 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-14 16:15:33,524 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 182 transitions, 1723 flow
[2024-06-14 16:15:33,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:33,524 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:33,524 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:33,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 16:15:33,524 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:33,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:33,525 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331816821, now seen corresponding path program 4 times
[2024-06-14 16:15:33,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:33,525 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496106991]
[2024-06-14 16:15:33,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:33,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:33,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:44,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:44,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:44,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496106991]
[2024-06-14 16:15:44,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496106991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:44,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:44,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:44,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760498604]
[2024-06-14 16:15:44,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:44,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:44,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:44,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:44,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:44,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:15:44,206 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 182 transitions, 1723 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:44,206 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:44,206 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:15:44,206 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:45,300 INFO  L124   PetriNetUnfolderBase]: 1930/3054 cut-off events.
[2024-06-14 16:15:45,301 INFO  L125   PetriNetUnfolderBase]: For 185409/185413 co-relation queries the response was YES.
[2024-06-14 16:15:45,314 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22361 conditions, 3054 events. 1930/3054 cut-off events. For 185409/185413 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16379 event pairs, 456 based on Foata normal form. 24/3077 useless extension candidates. Maximal degree in co-relation 22284. Up to 2529 conditions per place. 
[2024-06-14 16:15:45,376 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 166 selfloop transitions, 54 changer transitions 0/225 dead transitions.
[2024-06-14 16:15:45,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 225 transitions, 2341 flow
[2024-06-14 16:15:45,378 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:15:45,378 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:15:45,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-14 16:15:45,378 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-14 16:15:45,378 INFO  L175             Difference]: Start difference. First operand has 162 places, 182 transitions, 1723 flow. Second operand 10 states and 187 transitions.
[2024-06-14 16:15:45,379 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 225 transitions, 2341 flow
[2024-06-14 16:15:45,496 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 225 transitions, 2286 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-14 16:15:45,498 INFO  L231             Difference]: Finished difference. Result has 165 places, 183 transitions, 1825 flow
[2024-06-14 16:15:45,498 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1825, PETRI_PLACES=165, PETRI_TRANSITIONS=183}
[2024-06-14 16:15:45,499 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-14 16:15:45,499 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 183 transitions, 1825 flow
[2024-06-14 16:15:45,499 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:45,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:45,499 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:45,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 16:15:45,499 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:45,501 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:45,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -836545993, now seen corresponding path program 5 times
[2024-06-14 16:15:45,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:45,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578269916]
[2024-06-14 16:15:45,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:45,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:45,523 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:15:55,802 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:15:55,802 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:15:55,802 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578269916]
[2024-06-14 16:15:55,802 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578269916] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:15:55,802 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:15:55,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:15:55,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556596708]
[2024-06-14 16:15:55,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:15:55,803 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:15:55,803 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:15:55,803 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:15:55,803 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:15:56,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:15:56,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 183 transitions, 1825 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:56,031 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:15:56,031 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:15:56,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:15:57,112 INFO  L124   PetriNetUnfolderBase]: 2005/3179 cut-off events.
[2024-06-14 16:15:57,113 INFO  L125   PetriNetUnfolderBase]: For 197798/197802 co-relation queries the response was YES.
[2024-06-14 16:15:57,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23508 conditions, 3179 events. 2005/3179 cut-off events. For 197798/197802 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17278 event pairs, 480 based on Foata normal form. 24/3202 useless extension candidates. Maximal degree in co-relation 23430. Up to 2654 conditions per place. 
[2024-06-14 16:15:57,138 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 169 selfloop transitions, 53 changer transitions 0/227 dead transitions.
[2024-06-14 16:15:57,138 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 227 transitions, 2453 flow
[2024-06-14 16:15:57,140 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:15:57,140 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:15:57,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-14 16:15:57,141 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-14 16:15:57,141 INFO  L175             Difference]: Start difference. First operand has 165 places, 183 transitions, 1825 flow. Second operand 10 states and 189 transitions.
[2024-06-14 16:15:57,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 227 transitions, 2453 flow
[2024-06-14 16:15:57,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 227 transitions, 2324 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-14 16:15:57,270 INFO  L231             Difference]: Finished difference. Result has 167 places, 184 transitions, 1853 flow
[2024-06-14 16:15:57,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1853, PETRI_PLACES=167, PETRI_TRANSITIONS=184}
[2024-06-14 16:15:57,270 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places.
[2024-06-14 16:15:57,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 184 transitions, 1853 flow
[2024-06-14 16:15:57,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:15:57,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:15:57,271 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:15:57,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 16:15:57,271 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:15:57,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:15:57,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 968980243, now seen corresponding path program 6 times
[2024-06-14 16:15:57,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:15:57,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123264638]
[2024-06-14 16:15:57,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:15:57,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:15:57,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:07,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:07,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:07,559 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123264638]
[2024-06-14 16:16:07,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123264638] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:07,559 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:07,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:16:07,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443225702]
[2024-06-14 16:16:07,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:07,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:16:07,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:07,560 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:16:07,560 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:16:07,740 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:16:07,740 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 184 transitions, 1853 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:07,740 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:07,740 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:16:07,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:08,933 INFO  L124   PetriNetUnfolderBase]: 2063/3273 cut-off events.
[2024-06-14 16:16:08,933 INFO  L125   PetriNetUnfolderBase]: For 203581/203583 co-relation queries the response was YES.
[2024-06-14 16:16:08,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24113 conditions, 3273 events. 2063/3273 cut-off events. For 203581/203583 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17910 event pairs, 474 based on Foata normal form. 16/3288 useless extension candidates. Maximal degree in co-relation 24034. Up to 2522 conditions per place. 
[2024-06-14 16:16:08,958 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 167 selfloop transitions, 55 changer transitions 0/227 dead transitions.
[2024-06-14 16:16:08,958 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 227 transitions, 2493 flow
[2024-06-14 16:16:08,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:16:08,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:16:08,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 16:16:08,965 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-14 16:16:08,966 INFO  L175             Difference]: Start difference. First operand has 167 places, 184 transitions, 1853 flow. Second operand 9 states and 176 transitions.
[2024-06-14 16:16:08,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 227 transitions, 2493 flow
[2024-06-14 16:16:09,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 227 transitions, 2364 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-06-14 16:16:09,167 INFO  L231             Difference]: Finished difference. Result has 168 places, 185 transitions, 1886 flow
[2024-06-14 16:16:09,168 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1724, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1886, PETRI_PLACES=168, PETRI_TRANSITIONS=185}
[2024-06-14 16:16:09,168 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-14 16:16:09,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 185 transitions, 1886 flow
[2024-06-14 16:16:09,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:09,168 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:09,168 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:09,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 16:16:09,169 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:09,169 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:09,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 835107331, now seen corresponding path program 1 times
[2024-06-14 16:16:09,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:09,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229994598]
[2024-06-14 16:16:09,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:09,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:09,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:18,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:18,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:18,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229994598]
[2024-06-14 16:16:18,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229994598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:18,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:18,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:16:18,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948415729]
[2024-06-14 16:16:18,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:18,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:16:18,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:18,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:16:18,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:16:18,203 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:16:18,204 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 185 transitions, 1886 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:18,204 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:18,204 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:16:18,204 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:19,423 INFO  L124   PetriNetUnfolderBase]: 2104/3343 cut-off events.
[2024-06-14 16:16:19,423 INFO  L125   PetriNetUnfolderBase]: For 208726/208730 co-relation queries the response was YES.
[2024-06-14 16:16:19,437 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24602 conditions, 3343 events. 2104/3343 cut-off events. For 208726/208730 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18514 event pairs, 482 based on Foata normal form. 16/3358 useless extension candidates. Maximal degree in co-relation 24522. Up to 2496 conditions per place. 
[2024-06-14 16:16:19,447 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 167 selfloop transitions, 58 changer transitions 0/230 dead transitions.
[2024-06-14 16:16:19,448 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 230 transitions, 2536 flow
[2024-06-14 16:16:19,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:16:19,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:16:19,452 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 16:16:19,453 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 16:16:19,454 INFO  L175             Difference]: Start difference. First operand has 168 places, 185 transitions, 1886 flow. Second operand 10 states and 188 transitions.
[2024-06-14 16:16:19,454 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 230 transitions, 2536 flow
[2024-06-14 16:16:19,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 230 transitions, 2394 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-14 16:16:19,638 INFO  L231             Difference]: Finished difference. Result has 171 places, 186 transitions, 1914 flow
[2024-06-14 16:16:19,638 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1744, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1914, PETRI_PLACES=171, PETRI_TRANSITIONS=186}
[2024-06-14 16:16:19,638 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places.
[2024-06-14 16:16:19,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 186 transitions, 1914 flow
[2024-06-14 16:16:19,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:19,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:19,639 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:19,639 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 16:16:19,639 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:19,639 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:19,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 537348623, now seen corresponding path program 1 times
[2024-06-14 16:16:19,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:19,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850100282]
[2024-06-14 16:16:19,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:19,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:19,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:26,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:26,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:26,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850100282]
[2024-06-14 16:16:26,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850100282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:26,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:26,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:26,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224728428]
[2024-06-14 16:16:26,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:26,586 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:26,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:26,587 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:26,587 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:26,726 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:16:26,727 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 186 transitions, 1914 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:26,727 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:26,727 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:16:26,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:27,692 INFO  L124   PetriNetUnfolderBase]: 2109/3350 cut-off events.
[2024-06-14 16:16:27,693 INFO  L125   PetriNetUnfolderBase]: For 202642/202646 co-relation queries the response was YES.
[2024-06-14 16:16:27,713 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24632 conditions, 3350 events. 2109/3350 cut-off events. For 202642/202646 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18426 event pairs, 560 based on Foata normal form. 5/3354 useless extension candidates. Maximal degree in co-relation 24551. Up to 3189 conditions per place. 
[2024-06-14 16:16:27,724 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 184 selfloop transitions, 19 changer transitions 0/208 dead transitions.
[2024-06-14 16:16:27,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 208 transitions, 2423 flow
[2024-06-14 16:16:27,725 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:16:27,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:16:27,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 16:16:27,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-14 16:16:27,725 INFO  L175             Difference]: Start difference. First operand has 171 places, 186 transitions, 1914 flow. Second operand 7 states and 124 transitions.
[2024-06-14 16:16:27,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 208 transitions, 2423 flow
[2024-06-14 16:16:27,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 208 transitions, 2275 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-14 16:16:27,934 INFO  L231             Difference]: Finished difference. Result has 170 places, 189 transitions, 1871 flow
[2024-06-14 16:16:27,934 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1871, PETRI_PLACES=170, PETRI_TRANSITIONS=189}
[2024-06-14 16:16:27,935 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places.
[2024-06-14 16:16:27,935 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 189 transitions, 1871 flow
[2024-06-14 16:16:27,935 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:27,935 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:27,935 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:27,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 16:16:27,935 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:27,936 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:27,936 INFO  L85        PathProgramCache]: Analyzing trace with hash 543062543, now seen corresponding path program 2 times
[2024-06-14 16:16:27,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:27,936 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247723440]
[2024-06-14 16:16:27,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:27,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:27,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:35,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:35,263 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:35,263 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247723440]
[2024-06-14 16:16:35,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247723440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:35,263 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:35,263 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:16:35,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765162996]
[2024-06-14 16:16:35,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:35,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:16:35,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:35,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:16:35,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:16:35,419 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:16:35,419 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 189 transitions, 1871 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:35,419 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:35,419 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:16:35,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:36,380 INFO  L124   PetriNetUnfolderBase]: 2122/3370 cut-off events.
[2024-06-14 16:16:36,381 INFO  L125   PetriNetUnfolderBase]: For 208190/208194 co-relation queries the response was YES.
[2024-06-14 16:16:36,397 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24568 conditions, 3370 events. 2122/3370 cut-off events. For 208190/208194 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18632 event pairs, 574 based on Foata normal form. 5/3374 useless extension candidates. Maximal degree in co-relation 24486. Up to 3197 conditions per place. 
[2024-06-14 16:16:36,407 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 181 selfloop transitions, 27 changer transitions 0/213 dead transitions.
[2024-06-14 16:16:36,407 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 213 transitions, 2548 flow
[2024-06-14 16:16:36,407 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:16:36,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:16:36,408 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-14 16:16:36,408 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-14 16:16:36,408 INFO  L175             Difference]: Start difference. First operand has 170 places, 189 transitions, 1871 flow. Second operand 7 states and 123 transitions.
[2024-06-14 16:16:36,408 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 213 transitions, 2548 flow
[2024-06-14 16:16:36,603 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 213 transitions, 2488 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-14 16:16:36,610 INFO  L231             Difference]: Finished difference. Result has 173 places, 196 transitions, 2018 flow
[2024-06-14 16:16:36,610 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2018, PETRI_PLACES=173, PETRI_TRANSITIONS=196}
[2024-06-14 16:16:36,610 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places.
[2024-06-14 16:16:36,610 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 2018 flow
[2024-06-14 16:16:36,611 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:36,611 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:36,611 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:36,611 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 16:16:36,611 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:36,611 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:36,611 INFO  L85        PathProgramCache]: Analyzing trace with hash -110026731, now seen corresponding path program 7 times
[2024-06-14 16:16:36,612 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:36,612 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023353787]
[2024-06-14 16:16:36,612 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:36,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:36,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:46,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:46,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:46,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023353787]
[2024-06-14 16:16:46,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023353787] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:46,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:46,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:16:46,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677174729]
[2024-06-14 16:16:46,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:46,998 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:16:46,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:47,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:16:47,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:16:47,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:16:47,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 196 transitions, 2018 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:47,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:47,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:16:47,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:16:48,449 INFO  L124   PetriNetUnfolderBase]: 2197/3504 cut-off events.
[2024-06-14 16:16:48,449 INFO  L125   PetriNetUnfolderBase]: For 237663/237663 co-relation queries the response was YES.
[2024-06-14 16:16:48,465 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25663 conditions, 3504 events. 2197/3504 cut-off events. For 237663/237663 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19591 event pairs, 506 based on Foata normal form. 20/3523 useless extension candidates. Maximal degree in co-relation 25579. Up to 2973 conditions per place. 
[2024-06-14 16:16:48,474 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 185 selfloop transitions, 54 changer transitions 0/244 dead transitions.
[2024-06-14 16:16:48,474 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 244 transitions, 2696 flow
[2024-06-14 16:16:48,475 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:16:48,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:16:48,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions.
[2024-06-14 16:16:48,476 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-14 16:16:48,476 INFO  L175             Difference]: Start difference. First operand has 173 places, 196 transitions, 2018 flow. Second operand 11 states and 204 transitions.
[2024-06-14 16:16:48,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 244 transitions, 2696 flow
[2024-06-14 16:16:48,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 244 transitions, 2632 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 16:16:48,658 INFO  L231             Difference]: Finished difference. Result has 180 places, 197 transitions, 2119 flow
[2024-06-14 16:16:48,658 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2119, PETRI_PLACES=180, PETRI_TRANSITIONS=197}
[2024-06-14 16:16:48,658 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-14 16:16:48,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 197 transitions, 2119 flow
[2024-06-14 16:16:48,659 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:48,659 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:16:48,659 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:16:48,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 16:16:48,659 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:16:48,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:16:48,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -588097909, now seen corresponding path program 8 times
[2024-06-14 16:16:48,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:16:48,660 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156214968]
[2024-06-14 16:16:48,660 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:16:48,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:16:48,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:16:59,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:16:59,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:16:59,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156214968]
[2024-06-14 16:16:59,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156214968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:16:59,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:16:59,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:16:59,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032218127]
[2024-06-14 16:16:59,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:16:59,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:16:59,076 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:16:59,076 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:16:59,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:16:59,195 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:16:59,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 197 transitions, 2119 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:16:59,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:16:59,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:16:59,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:00,479 INFO  L124   PetriNetUnfolderBase]: 2272/3629 cut-off events.
[2024-06-14 16:17:00,479 INFO  L125   PetriNetUnfolderBase]: For 253310/253310 co-relation queries the response was YES.
[2024-06-14 16:17:00,498 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26947 conditions, 3629 events. 2272/3629 cut-off events. For 253310/253310 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20497 event pairs, 521 based on Foata normal form. 20/3648 useless extension candidates. Maximal degree in co-relation 26862. Up to 3098 conditions per place. 
[2024-06-14 16:17:00,510 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 182 selfloop transitions, 57 changer transitions 0/244 dead transitions.
[2024-06-14 16:17:00,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 244 transitions, 2795 flow
[2024-06-14 16:17:00,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:17:00,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:17:00,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions.
[2024-06-14 16:17:00,520 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329004329004329
[2024-06-14 16:17:00,520 INFO  L175             Difference]: Start difference. First operand has 180 places, 197 transitions, 2119 flow. Second operand 11 states and 200 transitions.
[2024-06-14 16:17:00,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 244 transitions, 2795 flow
[2024-06-14 16:17:00,768 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 244 transitions, 2658 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-06-14 16:17:00,770 INFO  L231             Difference]: Finished difference. Result has 182 places, 198 transitions, 2155 flow
[2024-06-14 16:17:00,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2155, PETRI_PLACES=182, PETRI_TRANSITIONS=198}
[2024-06-14 16:17:00,771 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-14 16:17:00,771 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 198 transitions, 2155 flow
[2024-06-14 16:17:00,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:00,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:00,776 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:00,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 16:17:00,777 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:17:00,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:00,777 INFO  L85        PathProgramCache]: Analyzing trace with hash -909427751, now seen corresponding path program 9 times
[2024-06-14 16:17:00,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:00,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097218124]
[2024-06-14 16:17:00,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:00,777 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:00,801 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:10,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:10,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:10,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097218124]
[2024-06-14 16:17:10,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097218124] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:10,966 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:10,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:17:10,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820568619]
[2024-06-14 16:17:10,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:10,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:17:10,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:10,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:17:10,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:17:11,117 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:17:11,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 198 transitions, 2155 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:11,117 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:11,117 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:17:11,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:12,452 INFO  L124   PetriNetUnfolderBase]: 2347/3754 cut-off events.
[2024-06-14 16:17:12,452 INFO  L125   PetriNetUnfolderBase]: For 264595/264595 co-relation queries the response was YES.
[2024-06-14 16:17:12,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27789 conditions, 3754 events. 2347/3754 cut-off events. For 264595/264595 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 21432 event pairs, 540 based on Foata normal form. 20/3773 useless extension candidates. Maximal degree in co-relation 27703. Up to 3223 conditions per place. 
[2024-06-14 16:17:12,483 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 187 selfloop transitions, 54 changer transitions 0/246 dead transitions.
[2024-06-14 16:17:12,484 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 246 transitions, 2841 flow
[2024-06-14 16:17:12,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:17:12,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:17:12,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions.
[2024-06-14 16:17:12,486 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-14 16:17:12,486 INFO  L175             Difference]: Start difference. First operand has 182 places, 198 transitions, 2155 flow. Second operand 11 states and 204 transitions.
[2024-06-14 16:17:12,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 246 transitions, 2841 flow
[2024-06-14 16:17:12,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 246 transitions, 2696 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-14 16:17:12,772 INFO  L231             Difference]: Finished difference. Result has 184 places, 199 transitions, 2179 flow
[2024-06-14 16:17:12,772 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2179, PETRI_PLACES=184, PETRI_TRANSITIONS=199}
[2024-06-14 16:17:12,773 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-14 16:17:12,773 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 199 transitions, 2179 flow
[2024-06-14 16:17:12,773 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:12,773 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:12,773 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:12,773 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 16:17:12,774 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:17:12,774 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:12,774 INFO  L85        PathProgramCache]: Analyzing trace with hash 1823565489, now seen corresponding path program 10 times
[2024-06-14 16:17:12,774 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:12,774 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851268928]
[2024-06-14 16:17:12,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:12,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:12,795 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:22,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-14 16:17:22,993 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:22,993 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851268928]
[2024-06-14 16:17:22,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851268928] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:22,993 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:22,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:17:22,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920411830]
[2024-06-14 16:17:22,993 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:22,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:17:22,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:22,994 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:17:22,994 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:17:23,189 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:17:23,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 199 transitions, 2179 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:23,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:23,190 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:17:23,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:24,533 INFO  L124   PetriNetUnfolderBase]: 2355/3774 cut-off events.
[2024-06-14 16:17:24,534 INFO  L125   PetriNetUnfolderBase]: For 258955/258955 co-relation queries the response was YES.
[2024-06-14 16:17:24,552 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27426 conditions, 3774 events. 2355/3774 cut-off events. For 258955/258955 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 21561 event pairs, 522 based on Foata normal form. 16/3789 useless extension candidates. Maximal degree in co-relation 27339. Up to 2893 conditions per place. 
[2024-06-14 16:17:24,563 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 187 selfloop transitions, 58 changer transitions 0/250 dead transitions.
[2024-06-14 16:17:24,564 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 250 transitions, 2895 flow
[2024-06-14 16:17:24,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:17:24,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:17:24,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions.
[2024-06-14 16:17:24,566 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4458874458874459
[2024-06-14 16:17:24,566 INFO  L175             Difference]: Start difference. First operand has 184 places, 199 transitions, 2179 flow. Second operand 11 states and 206 transitions.
[2024-06-14 16:17:24,566 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 250 transitions, 2895 flow
[2024-06-14 16:17:24,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 250 transitions, 2754 flow, removed 18 selfloop flow, removed 9 redundant places.
[2024-06-14 16:17:24,856 INFO  L231             Difference]: Finished difference. Result has 186 places, 200 transitions, 2216 flow
[2024-06-14 16:17:24,856 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2216, PETRI_PLACES=186, PETRI_TRANSITIONS=200}
[2024-06-14 16:17:24,856 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-14 16:17:24,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 200 transitions, 2216 flow
[2024-06-14 16:17:24,857 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:24,857 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:24,857 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:24,857 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 16:17:24,857 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:17:24,857 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:24,857 INFO  L85        PathProgramCache]: Analyzing trace with hash 1829290941, now seen corresponding path program 2 times
[2024-06-14 16:17:24,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:24,858 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817958237]
[2024-06-14 16:17:24,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:24,858 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:24,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:34,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:34,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:34,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817958237]
[2024-06-14 16:17:34,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817958237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:34,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:34,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:17:34,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065793655]
[2024-06-14 16:17:34,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:34,509 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:17:34,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:34,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:17:34,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:17:34,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:17:34,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 200 transitions, 2216 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:34,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:34,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:17:34,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:36,081 INFO  L124   PetriNetUnfolderBase]: 2396/3850 cut-off events.
[2024-06-14 16:17:36,082 INFO  L125   PetriNetUnfolderBase]: For 262502/262502 co-relation queries the response was YES.
[2024-06-14 16:17:36,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27887 conditions, 3850 events. 2396/3850 cut-off events. For 262502/262502 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 22302 event pairs, 547 based on Foata normal form. 12/3861 useless extension candidates. Maximal degree in co-relation 27799. Up to 3107 conditions per place. 
[2024-06-14 16:17:36,116 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 188 selfloop transitions, 57 changer transitions 0/250 dead transitions.
[2024-06-14 16:17:36,117 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 250 transitions, 2930 flow
[2024-06-14 16:17:36,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:17:36,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:17:36,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions.
[2024-06-14 16:17:36,121 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44372294372294374
[2024-06-14 16:17:36,121 INFO  L175             Difference]: Start difference. First operand has 186 places, 200 transitions, 2216 flow. Second operand 11 states and 205 transitions.
[2024-06-14 16:17:36,122 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 250 transitions, 2930 flow
[2024-06-14 16:17:36,415 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 250 transitions, 2772 flow, removed 22 selfloop flow, removed 9 redundant places.
[2024-06-14 16:17:36,418 INFO  L231             Difference]: Finished difference. Result has 188 places, 201 transitions, 2236 flow
[2024-06-14 16:17:36,418 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2236, PETRI_PLACES=188, PETRI_TRANSITIONS=201}
[2024-06-14 16:17:36,418 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places.
[2024-06-14 16:17:36,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 201 transitions, 2236 flow
[2024-06-14 16:17:36,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:36,419 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:36,419 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:36,419 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 16:17:36,419 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:17:36,419 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:36,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 615002759, now seen corresponding path program 3 times
[2024-06-14 16:17:36,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:36,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66080102]
[2024-06-14 16:17:36,420 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:36,420 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:36,447 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:45,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:45,803 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:45,803 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66080102]
[2024-06-14 16:17:45,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66080102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:45,803 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:45,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:17:45,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688497591]
[2024-06-14 16:17:45,803 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:45,804 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:17:45,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:45,804 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:17:45,804 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:17:46,065 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:17:46,065 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 201 transitions, 2236 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:46,065 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:46,065 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:17:46,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:47,478 INFO  L124   PetriNetUnfolderBase]: 2437/3936 cut-off events.
[2024-06-14 16:17:47,478 INFO  L125   PetriNetUnfolderBase]: For 270635/270635 co-relation queries the response was YES.
[2024-06-14 16:17:47,499 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28270 conditions, 3936 events. 2437/3936 cut-off events. For 270635/270635 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 23034 event pairs, 512 based on Foata normal form. 12/3947 useless extension candidates. Maximal degree in co-relation 28181. Up to 2388 conditions per place. 
[2024-06-14 16:17:47,510 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 176 selfloop transitions, 70 changer transitions 0/251 dead transitions.
[2024-06-14 16:17:47,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 251 transitions, 3060 flow
[2024-06-14 16:17:47,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:17:47,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:17:47,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions.
[2024-06-14 16:17:47,513 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43722943722943725
[2024-06-14 16:17:47,513 INFO  L175             Difference]: Start difference. First operand has 188 places, 201 transitions, 2236 flow. Second operand 11 states and 202 transitions.
[2024-06-14 16:17:47,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 251 transitions, 3060 flow
[2024-06-14 16:17:47,818 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 251 transitions, 2904 flow, removed 22 selfloop flow, removed 9 redundant places.
[2024-06-14 16:17:47,821 INFO  L231             Difference]: Finished difference. Result has 190 places, 202 transitions, 2284 flow
[2024-06-14 16:17:47,821 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2080, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2284, PETRI_PLACES=190, PETRI_TRANSITIONS=202}
[2024-06-14 16:17:47,821 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-14 16:17:47,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 202 transitions, 2284 flow
[2024-06-14 16:17:47,822 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:47,822 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:47,822 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:47,822 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 16:17:47,822 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:17:47,822 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:47,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -231771741, now seen corresponding path program 4 times
[2024-06-14 16:17:47,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:47,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765389153]
[2024-06-14 16:17:47,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:47,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:47,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:17:57,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:17:57,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:17:57,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765389153]
[2024-06-14 16:17:57,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765389153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:17:57,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:17:57,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 16:17:57,069 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369000947]
[2024-06-14 16:17:57,069 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:17:57,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 16:17:57,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:17:57,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 16:17:57,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 16:17:57,320 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:17:57,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 202 transitions, 2284 flow. Second operand  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:57,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:17:57,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:17:57,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:17:58,737 INFO  L124   PetriNetUnfolderBase]: 2417/3904 cut-off events.
[2024-06-14 16:17:58,737 INFO  L125   PetriNetUnfolderBase]: For 262773/262773 co-relation queries the response was YES.
[2024-06-14 16:17:58,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27493 conditions, 3904 events. 2417/3904 cut-off events. For 262773/262773 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22806 event pairs, 548 based on Foata normal form. 12/3915 useless extension candidates. Maximal degree in co-relation 27403. Up to 3266 conditions per place. 
[2024-06-14 16:17:58,768 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 185 selfloop transitions, 59 changer transitions 0/249 dead transitions.
[2024-06-14 16:17:58,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 249 transitions, 2854 flow
[2024-06-14 16:17:58,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:17:58,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:17:58,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-14 16:17:58,771 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-14 16:17:58,771 INFO  L175             Difference]: Start difference. First operand has 190 places, 202 transitions, 2284 flow. Second operand 11 states and 201 transitions.
[2024-06-14 16:17:58,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 249 transitions, 2854 flow
[2024-06-14 16:17:59,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 249 transitions, 2682 flow, removed 32 selfloop flow, removed 8 redundant places.
[2024-06-14 16:17:59,116 INFO  L231             Difference]: Finished difference. Result has 192 places, 201 transitions, 2152 flow
[2024-06-14 16:17:59,116 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2030, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2152, PETRI_PLACES=192, PETRI_TRANSITIONS=201}
[2024-06-14 16:17:59,117 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places.
[2024-06-14 16:17:59,117 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 201 transitions, 2152 flow
[2024-06-14 16:17:59,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:17:59,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:17:59,117 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:17:59,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 16:17:59,118 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:17:59,119 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:17:59,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448592409, now seen corresponding path program 3 times
[2024-06-14 16:17:59,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:17:59,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893535059]
[2024-06-14 16:17:59,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:17:59,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:17:59,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:06,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-14 16:18:06,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:06,316 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893535059]
[2024-06-14 16:18:06,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893535059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:06,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:06,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:06,317 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213583667]
[2024-06-14 16:18:06,317 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:06,317 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:06,317 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:06,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:06,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:06,418 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:18:06,418 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 201 transitions, 2152 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:06,418 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:06,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:18:06,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:07,636 INFO  L124   PetriNetUnfolderBase]: 2414/3900 cut-off events.
[2024-06-14 16:18:07,636 INFO  L125   PetriNetUnfolderBase]: For 250481/250481 co-relation queries the response was YES.
[2024-06-14 16:18:07,656 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27134 conditions, 3900 events. 2414/3900 cut-off events. For 250481/250481 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 22799 event pairs, 643 based on Foata normal form. 1/3900 useless extension candidates. Maximal degree in co-relation 27043. Up to 3708 conditions per place. 
[2024-06-14 16:18:07,668 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 203 selfloop transitions, 20 changer transitions 0/228 dead transitions.
[2024-06-14 16:18:07,668 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 228 transitions, 2666 flow
[2024-06-14 16:18:07,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:18:07,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:18:07,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-14 16:18:07,682 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-14 16:18:07,682 INFO  L175             Difference]: Start difference. First operand has 192 places, 201 transitions, 2152 flow. Second operand 9 states and 153 transitions.
[2024-06-14 16:18:07,682 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 228 transitions, 2666 flow
[2024-06-14 16:18:07,940 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 228 transitions, 2434 flow, removed 30 selfloop flow, removed 12 redundant places.
[2024-06-14 16:18:07,942 INFO  L231             Difference]: Finished difference. Result has 189 places, 201 transitions, 1966 flow
[2024-06-14 16:18:07,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1966, PETRI_PLACES=189, PETRI_TRANSITIONS=201}
[2024-06-14 16:18:07,943 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-14 16:18:07,943 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 201 transitions, 1966 flow
[2024-06-14 16:18:07,943 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:07,943 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:07,943 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:07,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 16:18:07,944 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:07,944 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:07,944 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633949169, now seen corresponding path program 4 times
[2024-06-14 16:18:07,944 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:07,944 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237816269]
[2024-06-14 16:18:07,944 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:07,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:07,978 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:15,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:15,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:15,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237816269]
[2024-06-14 16:18:15,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237816269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:15,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:15,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:15,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255794646]
[2024-06-14 16:18:15,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:15,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:15,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:15,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:15,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:15,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:18:15,188 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 201 transitions, 1966 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:15,188 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:15,188 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:18:15,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:16,264 INFO  L124   PetriNetUnfolderBase]: 2406/3889 cut-off events.
[2024-06-14 16:18:16,264 INFO  L125   PetriNetUnfolderBase]: For 252415/252415 co-relation queries the response was YES.
[2024-06-14 16:18:16,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26264 conditions, 3889 events. 2406/3889 cut-off events. For 252415/252415 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22727 event pairs, 643 based on Foata normal form. 2/3890 useless extension candidates. Maximal degree in co-relation 26174. Up to 3675 conditions per place. 
[2024-06-14 16:18:16,298 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 189 selfloop transitions, 31 changer transitions 0/225 dead transitions.
[2024-06-14 16:18:16,298 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 225 transitions, 2466 flow
[2024-06-14 16:18:16,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:18:16,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:18:16,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-14 16:18:16,300 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-14 16:18:16,300 INFO  L175             Difference]: Start difference. First operand has 189 places, 201 transitions, 1966 flow. Second operand 9 states and 153 transitions.
[2024-06-14 16:18:16,300 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 225 transitions, 2466 flow
[2024-06-14 16:18:16,597 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 225 transitions, 2400 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-14 16:18:16,600 INFO  L231             Difference]: Finished difference. Result has 191 places, 201 transitions, 1970 flow
[2024-06-14 16:18:16,600 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1970, PETRI_PLACES=191, PETRI_TRANSITIONS=201}
[2024-06-14 16:18:16,601 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-14 16:18:16,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 201 transitions, 1970 flow
[2024-06-14 16:18:16,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:16,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:16,602 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:16,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 16:18:16,602 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:16,602 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:16,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -444505585, now seen corresponding path program 5 times
[2024-06-14 16:18:16,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:16,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490330277]
[2024-06-14 16:18:16,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:16,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:16,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:23,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-14 16:18:23,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:23,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490330277]
[2024-06-14 16:18:23,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490330277] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:23,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:23,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:23,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950778006]
[2024-06-14 16:18:23,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:23,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:23,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:23,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:23,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:24,024 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:18:24,024 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 201 transitions, 1970 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:24,025 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:24,025 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:18:24,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:25,146 INFO  L124   PetriNetUnfolderBase]: 2416/3906 cut-off events.
[2024-06-14 16:18:25,147 INFO  L125   PetriNetUnfolderBase]: For 260591/260595 co-relation queries the response was YES.
[2024-06-14 16:18:25,168 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26518 conditions, 3906 events. 2416/3906 cut-off events. For 260591/260595 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 22832 event pairs, 647 based on Foata normal form. 6/3911 useless extension candidates. Maximal degree in co-relation 26427. Up to 3630 conditions per place. 
[2024-06-14 16:18:25,179 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 160 selfloop transitions, 58 changer transitions 0/223 dead transitions.
[2024-06-14 16:18:25,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 223 transitions, 2628 flow
[2024-06-14 16:18:25,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:18:25,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:18:25,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-14 16:18:25,180 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-14 16:18:25,181 INFO  L175             Difference]: Start difference. First operand has 191 places, 201 transitions, 1970 flow. Second operand 8 states and 140 transitions.
[2024-06-14 16:18:25,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 223 transitions, 2628 flow
[2024-06-14 16:18:25,450 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 223 transitions, 2538 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-14 16:18:25,452 INFO  L231             Difference]: Finished difference. Result has 191 places, 205 transitions, 2063 flow
[2024-06-14 16:18:25,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2063, PETRI_PLACES=191, PETRI_TRANSITIONS=205}
[2024-06-14 16:18:25,453 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-14 16:18:25,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 205 transitions, 2063 flow
[2024-06-14 16:18:25,453 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:25,453 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:25,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:25,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 16:18:25,454 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:25,454 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:25,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -437839345, now seen corresponding path program 6 times
[2024-06-14 16:18:25,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:25,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821769415]
[2024-06-14 16:18:25,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:25,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:25,487 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:32,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:32,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:32,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821769415]
[2024-06-14 16:18:32,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821769415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:32,701 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:32,701 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:32,701 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388651113]
[2024-06-14 16:18:32,701 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:32,701 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:32,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:32,706 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:32,706 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:32,823 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:18:32,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 205 transitions, 2063 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:32,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:32,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:18:32,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:33,912 INFO  L124   PetriNetUnfolderBase]: 2408/3891 cut-off events.
[2024-06-14 16:18:33,913 INFO  L125   PetriNetUnfolderBase]: For 265254/265258 co-relation queries the response was YES.
[2024-06-14 16:18:33,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26511 conditions, 3891 events. 2408/3891 cut-off events. For 265254/265258 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22761 event pairs, 640 based on Foata normal form. 6/3896 useless extension candidates. Maximal degree in co-relation 26419. Up to 3622 conditions per place. 
[2024-06-14 16:18:33,941 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 163 selfloop transitions, 54 changer transitions 0/222 dead transitions.
[2024-06-14 16:18:33,941 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 222 transitions, 2539 flow
[2024-06-14 16:18:33,942 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:18:33,942 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:18:33,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-14 16:18:33,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-14 16:18:33,943 INFO  L175             Difference]: Start difference. First operand has 191 places, 205 transitions, 2063 flow. Second operand 8 states and 139 transitions.
[2024-06-14 16:18:33,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 222 transitions, 2539 flow
[2024-06-14 16:18:34,252 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 222 transitions, 2333 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-14 16:18:34,254 INFO  L231             Difference]: Finished difference. Result has 192 places, 205 transitions, 1974 flow
[2024-06-14 16:18:34,254 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1974, PETRI_PLACES=192, PETRI_TRANSITIONS=205}
[2024-06-14 16:18:34,255 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places.
[2024-06-14 16:18:34,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 205 transitions, 1974 flow
[2024-06-14 16:18:34,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:34,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:34,255 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:34,255 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 16:18:34,255 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:34,256 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:34,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132453021, now seen corresponding path program 1 times
[2024-06-14 16:18:34,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:34,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617757758]
[2024-06-14 16:18:34,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:34,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:34,295 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:41,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-14 16:18:41,905 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:41,905 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617757758]
[2024-06-14 16:18:41,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617757758] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:41,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:41,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:41,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466040026]
[2024-06-14 16:18:41,906 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:41,906 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:41,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:41,906 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:41,906 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:42,018 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:18:42,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 205 transitions, 1974 flow. Second operand  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:42,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:42,019 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:18:42,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:43,143 INFO  L124   PetriNetUnfolderBase]: 2275/3720 cut-off events.
[2024-06-14 16:18:43,144 INFO  L125   PetriNetUnfolderBase]: For 276408/276428 co-relation queries the response was YES.
[2024-06-14 16:18:43,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25930 conditions, 3720 events. 2275/3720 cut-off events. For 276408/276428 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21880 event pairs, 609 based on Foata normal form. 2/3680 useless extension candidates. Maximal degree in co-relation 25838. Up to 3397 conditions per place. 
[2024-06-14 16:18:43,171 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 166 selfloop transitions, 31 changer transitions 0/225 dead transitions.
[2024-06-14 16:18:43,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 225 transitions, 2446 flow
[2024-06-14 16:18:43,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:18:43,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:18:43,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-14 16:18:43,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-14 16:18:43,173 INFO  L175             Difference]: Start difference. First operand has 192 places, 205 transitions, 1974 flow. Second operand 8 states and 141 transitions.
[2024-06-14 16:18:43,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 225 transitions, 2446 flow
[2024-06-14 16:18:43,470 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 225 transitions, 2324 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-14 16:18:43,473 INFO  L231             Difference]: Finished difference. Result has 193 places, 208 transitions, 1963 flow
[2024-06-14 16:18:43,473 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1963, PETRI_PLACES=193, PETRI_TRANSITIONS=208}
[2024-06-14 16:18:43,473 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-14 16:18:43,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 208 transitions, 1963 flow
[2024-06-14 16:18:43,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:43,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:43,474 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:43,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 16:18:43,474 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:43,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:43,474 INFO  L85        PathProgramCache]: Analyzing trace with hash -430212849, now seen corresponding path program 2 times
[2024-06-14 16:18:43,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:43,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447387859]
[2024-06-14 16:18:43,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:43,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:43,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:18:51,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:18:51,759 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:18:51,759 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447387859]
[2024-06-14 16:18:51,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447387859] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:18:51,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:18:51,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 16:18:51,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234373009]
[2024-06-14 16:18:51,759 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:18:51,759 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 16:18:51,759 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:18:51,760 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 16:18:51,760 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 16:18:51,851 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 16:18:51,852 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 208 transitions, 1963 flow. Second operand  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:51,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:18:51,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 16:18:51,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:18:52,938 INFO  L124   PetriNetUnfolderBase]: 2268/3712 cut-off events.
[2024-06-14 16:18:52,938 INFO  L125   PetriNetUnfolderBase]: For 280568/280596 co-relation queries the response was YES.
[2024-06-14 16:18:52,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26144 conditions, 3712 events. 2268/3712 cut-off events. For 280568/280596 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21814 event pairs, 606 based on Foata normal form. 2/3675 useless extension candidates. Maximal degree in co-relation 26051. Up to 3377 conditions per place. 
[2024-06-14 16:18:52,969 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 163 selfloop transitions, 38 changer transitions 0/229 dead transitions.
[2024-06-14 16:18:52,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 229 transitions, 2451 flow
[2024-06-14 16:18:52,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:18:52,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:18:52,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-14 16:18:52,970 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4126984126984127
[2024-06-14 16:18:52,970 INFO  L175             Difference]: Start difference. First operand has 193 places, 208 transitions, 1963 flow. Second operand 9 states and 156 transitions.
[2024-06-14 16:18:52,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 229 transitions, 2451 flow
[2024-06-14 16:18:53,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 229 transitions, 2364 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-14 16:18:53,310 INFO  L231             Difference]: Finished difference. Result has 196 places, 211 transitions, 2011 flow
[2024-06-14 16:18:53,310 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1876, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2011, PETRI_PLACES=196, PETRI_TRANSITIONS=211}
[2024-06-14 16:18:53,310 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places.
[2024-06-14 16:18:53,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 211 transitions, 2011 flow
[2024-06-14 16:18:53,311 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.0) internal successors, (96), 8 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:18:53,311 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:18:53,311 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:18:53,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 16:18:53,311 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:18:53,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:18:53,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -1637749521, now seen corresponding path program 1 times
[2024-06-14 16:18:53,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:18:53,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135730984]
[2024-06-14 16:18:53,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:18:53,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:18:53,348 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:00,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:00,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:00,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135730984]
[2024-06-14 16:19:00,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135730984] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:00,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:00,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:00,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643947786]
[2024-06-14 16:19:00,845 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:00,845 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:00,845 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:00,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:00,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:00,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:00,960 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 211 transitions, 2011 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:00,960 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:00,960 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:00,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:02,051 INFO  L124   PetriNetUnfolderBase]: 2409/3896 cut-off events.
[2024-06-14 16:19:02,051 INFO  L125   PetriNetUnfolderBase]: For 281346/281346 co-relation queries the response was YES.
[2024-06-14 16:19:02,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27198 conditions, 3896 events. 2409/3896 cut-off events. For 281346/281346 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22783 event pairs, 633 based on Foata normal form. 1/3896 useless extension candidates. Maximal degree in co-relation 27104. Up to 3711 conditions per place. 
[2024-06-14 16:19:02,085 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 19 changer transitions 0/228 dead transitions.
[2024-06-14 16:19:02,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 228 transitions, 2501 flow
[2024-06-14 16:19:02,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 16:19:02,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 16:19:02,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-14 16:19:02,088 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40816326530612246
[2024-06-14 16:19:02,088 INFO  L175             Difference]: Start difference. First operand has 196 places, 211 transitions, 2011 flow. Second operand 7 states and 120 transitions.
[2024-06-14 16:19:02,088 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 228 transitions, 2501 flow
[2024-06-14 16:19:02,392 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 228 transitions, 2372 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-14 16:19:02,395 INFO  L231             Difference]: Finished difference. Result has 196 places, 211 transitions, 1930 flow
[2024-06-14 16:19:02,395 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1930, PETRI_PLACES=196, PETRI_TRANSITIONS=211}
[2024-06-14 16:19:02,395 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places.
[2024-06-14 16:19:02,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 211 transitions, 1930 flow
[2024-06-14 16:19:02,396 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:02,396 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:02,396 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:02,396 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 16:19:02,396 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:02,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:02,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1439922236, now seen corresponding path program 1 times
[2024-06-14 16:19:02,397 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:02,397 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273786695]
[2024-06-14 16:19:02,397 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:02,397 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:02,428 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:09,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:09,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:09,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273786695]
[2024-06-14 16:19:09,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273786695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:09,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:09,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:09,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502551236]
[2024-06-14 16:19:09,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:09,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:09,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:09,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:09,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:10,016 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:10,017 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 211 transitions, 1930 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:10,017 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:10,017 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:10,017 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:11,339 INFO  L124   PetriNetUnfolderBase]: 2465/3976 cut-off events.
[2024-06-14 16:19:11,340 INFO  L125   PetriNetUnfolderBase]: For 295075/295075 co-relation queries the response was YES.
[2024-06-14 16:19:11,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27520 conditions, 3976 events. 2465/3976 cut-off events. For 295075/295075 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23234 event pairs, 605 based on Foata normal form. 4/3979 useless extension candidates. Maximal degree in co-relation 27425. Up to 3653 conditions per place. 
[2024-06-14 16:19:11,370 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 207 selfloop transitions, 49 changer transitions 0/261 dead transitions.
[2024-06-14 16:19:11,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 261 transitions, 2829 flow
[2024-06-14 16:19:11,371 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:19:11,371 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:19:11,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions.
[2024-06-14 16:19:11,371 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41125541125541126
[2024-06-14 16:19:11,371 INFO  L175             Difference]: Start difference. First operand has 196 places, 211 transitions, 1930 flow. Second operand 11 states and 190 transitions.
[2024-06-14 16:19:11,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 261 transitions, 2829 flow
[2024-06-14 16:19:11,708 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 261 transitions, 2783 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-14 16:19:11,711 INFO  L231             Difference]: Finished difference. Result has 203 places, 226 transitions, 2194 flow
[2024-06-14 16:19:11,711 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1884, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2194, PETRI_PLACES=203, PETRI_TRANSITIONS=226}
[2024-06-14 16:19:11,711 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-14 16:19:11,712 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 226 transitions, 2194 flow
[2024-06-14 16:19:11,712 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:11,712 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:11,712 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:11,712 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 16:19:11,712 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:11,713 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:11,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -1436203166, now seen corresponding path program 2 times
[2024-06-14 16:19:11,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:11,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174359108]
[2024-06-14 16:19:11,713 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:11,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:11,746 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:18,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:18,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:18,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174359108]
[2024-06-14 16:19:18,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174359108] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:18,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:18,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:18,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263317394]
[2024-06-14 16:19:18,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:18,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:18,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:18,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:18,953 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:19,115 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:19,116 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 226 transitions, 2194 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:19,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:19,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:19,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:20,320 INFO  L124   PetriNetUnfolderBase]: 2641/4221 cut-off events.
[2024-06-14 16:19:20,320 INFO  L125   PetriNetUnfolderBase]: For 350277/350277 co-relation queries the response was YES.
[2024-06-14 16:19:20,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31629 conditions, 4221 events. 2641/4221 cut-off events. For 350277/350277 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 24685 event pairs, 611 based on Foata normal form. 4/4224 useless extension candidates. Maximal degree in co-relation 31531. Up to 3671 conditions per place. 
[2024-06-14 16:19:20,359 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 204 selfloop transitions, 64 changer transitions 0/273 dead transitions.
[2024-06-14 16:19:20,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 273 transitions, 3374 flow
[2024-06-14 16:19:20,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:19:20,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:19:20,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-14 16:19:20,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 16:19:20,361 INFO  L175             Difference]: Start difference. First operand has 203 places, 226 transitions, 2194 flow. Second operand 10 states and 180 transitions.
[2024-06-14 16:19:20,361 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 273 transitions, 3374 flow
[2024-06-14 16:19:20,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 273 transitions, 3270 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-14 16:19:20,769 INFO  L231             Difference]: Finished difference. Result has 210 places, 239 transitions, 2490 flow
[2024-06-14 16:19:20,769 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2490, PETRI_PLACES=210, PETRI_TRANSITIONS=239}
[2024-06-14 16:19:20,769 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-14 16:19:20,769 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 239 transitions, 2490 flow
[2024-06-14 16:19:20,769 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:20,770 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:20,770 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:20,770 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-14 16:19:20,770 INFO  L420      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:20,770 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:20,770 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633934506, now seen corresponding path program 3 times
[2024-06-14 16:19:20,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:20,771 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408314418]
[2024-06-14 16:19:20,771 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:20,771 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:20,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:28,158 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:28,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:28,158 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408314418]
[2024-06-14 16:19:28,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408314418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:28,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:28,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:28,159 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742117217]
[2024-06-14 16:19:28,159 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:28,159 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:28,159 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:28,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:28,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:28,308 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:28,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 239 transitions, 2490 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:28,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:28,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:28,309 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:29,591 INFO  L124   PetriNetUnfolderBase]: 2689/4295 cut-off events.
[2024-06-14 16:19:29,591 INFO  L125   PetriNetUnfolderBase]: For 370249/370249 co-relation queries the response was YES.
[2024-06-14 16:19:29,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33301 conditions, 4295 events. 2689/4295 cut-off events. For 370249/370249 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 25189 event pairs, 605 based on Foata normal form. 8/4302 useless extension candidates. Maximal degree in co-relation 33199. Up to 3718 conditions per place. 
[2024-06-14 16:19:29,631 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 200 selfloop transitions, 77 changer transitions 0/282 dead transitions.
[2024-06-14 16:19:29,631 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 282 transitions, 3642 flow
[2024-06-14 16:19:29,631 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:19:29,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:19:29,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-14 16:19:29,632 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-14 16:19:29,632 INFO  L175             Difference]: Start difference. First operand has 210 places, 239 transitions, 2490 flow. Second operand 10 states and 181 transitions.
[2024-06-14 16:19:29,632 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 282 transitions, 3642 flow
[2024-06-14 16:19:30,115 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 282 transitions, 3461 flow, removed 70 selfloop flow, removed 5 redundant places.
[2024-06-14 16:19:30,118 INFO  L231             Difference]: Finished difference. Result has 217 places, 250 transitions, 2775 flow
[2024-06-14 16:19:30,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2341, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2775, PETRI_PLACES=217, PETRI_TRANSITIONS=250}
[2024-06-14 16:19:30,119 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-14 16:19:30,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 250 transitions, 2775 flow
[2024-06-14 16:19:30,119 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:30,119 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:30,119 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:30,119 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-14 16:19:30,119 INFO  L420      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:30,120 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:30,120 INFO  L85        PathProgramCache]: Analyzing trace with hash 926014845, now seen corresponding path program 1 times
[2024-06-14 16:19:30,120 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:30,120 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428626311]
[2024-06-14 16:19:30,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:30,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:30,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:38,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:38,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:38,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428626311]
[2024-06-14 16:19:38,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428626311] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:38,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:38,454 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:38,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379802659]
[2024-06-14 16:19:38,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:38,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:38,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:38,455 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:38,455 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:38,550 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:38,551 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 250 transitions, 2775 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:38,551 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:38,551 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:38,551 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:39,881 INFO  L124   PetriNetUnfolderBase]: 2675/4285 cut-off events.
[2024-06-14 16:19:39,881 INFO  L125   PetriNetUnfolderBase]: For 361621/361621 co-relation queries the response was YES.
[2024-06-14 16:19:39,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33409 conditions, 4285 events. 2675/4285 cut-off events. For 361621/361621 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 25098 event pairs, 634 based on Foata normal form. 2/4286 useless extension candidates. Maximal degree in co-relation 33303. Up to 4043 conditions per place. 
[2024-06-14 16:19:39,917 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 236 selfloop transitions, 37 changer transitions 0/278 dead transitions.
[2024-06-14 16:19:39,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 278 transitions, 3453 flow
[2024-06-14 16:19:39,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:19:39,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:19:39,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-14 16:19:39,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3976190476190476
[2024-06-14 16:19:39,919 INFO  L175             Difference]: Start difference. First operand has 217 places, 250 transitions, 2775 flow. Second operand 10 states and 167 transitions.
[2024-06-14 16:19:39,919 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 278 transitions, 3453 flow
[2024-06-14 16:19:40,406 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 278 transitions, 3344 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-14 16:19:40,409 INFO  L231             Difference]: Finished difference. Result has 222 places, 253 transitions, 2823 flow
[2024-06-14 16:19:40,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2668, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2823, PETRI_PLACES=222, PETRI_TRANSITIONS=253}
[2024-06-14 16:19:40,409 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places.
[2024-06-14 16:19:40,409 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 253 transitions, 2823 flow
[2024-06-14 16:19:40,409 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:40,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:40,410 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:40,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-14 16:19:40,410 INFO  L420      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:40,410 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:40,410 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132935195, now seen corresponding path program 2 times
[2024-06-14 16:19:40,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:40,410 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033999894]
[2024-06-14 16:19:40,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:40,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:40,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:48,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:48,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:48,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033999894]
[2024-06-14 16:19:48,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033999894] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:48,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:48,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:48,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646407448]
[2024-06-14 16:19:48,142 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:48,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:48,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:48,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:48,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:48,322 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:48,322 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 253 transitions, 2823 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:48,322 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:48,322 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:48,322 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:49,629 INFO  L124   PetriNetUnfolderBase]: 2741/4372 cut-off events.
[2024-06-14 16:19:49,630 INFO  L125   PetriNetUnfolderBase]: For 391187/391189 co-relation queries the response was YES.
[2024-06-14 16:19:49,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34483 conditions, 4372 events. 2741/4372 cut-off events. For 391187/391189 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25702 event pairs, 616 based on Foata normal form. 2/4373 useless extension candidates. Maximal degree in co-relation 34375. Up to 3680 conditions per place. 
[2024-06-14 16:19:49,668 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 172 selfloop transitions, 129 changer transitions 0/306 dead transitions.
[2024-06-14 16:19:49,668 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 306 transitions, 4421 flow
[2024-06-14 16:19:49,668 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:19:49,668 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:19:49,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-14 16:19:49,669 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-14 16:19:49,669 INFO  L175             Difference]: Start difference. First operand has 222 places, 253 transitions, 2823 flow. Second operand 9 states and 167 transitions.
[2024-06-14 16:19:49,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 306 transitions, 4421 flow
[2024-06-14 16:19:50,053 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 306 transitions, 4292 flow, removed 30 selfloop flow, removed 8 redundant places.
[2024-06-14 16:19:50,057 INFO  L231             Difference]: Finished difference. Result has 226 places, 282 transitions, 3659 flow
[2024-06-14 16:19:50,057 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3659, PETRI_PLACES=226, PETRI_TRANSITIONS=282}
[2024-06-14 16:19:50,057 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-14 16:19:50,057 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 282 transitions, 3659 flow
[2024-06-14 16:19:50,057 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:50,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:50,058 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:50,058 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-14 16:19:50,058 INFO  L420      AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:50,058 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:50,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132668068, now seen corresponding path program 4 times
[2024-06-14 16:19:50,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:50,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338427384]
[2024-06-14 16:19:50,059 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:50,059 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:50,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:19:57,359 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:19:57,360 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:19:57,360 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338427384]
[2024-06-14 16:19:57,360 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338427384] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:19:57,375 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:19:57,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:19:57,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989562552]
[2024-06-14 16:19:57,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:19:57,376 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:19:57,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:19:57,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:19:57,376 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:19:57,547 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:19:57,547 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 282 transitions, 3659 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:57,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:19:57,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:19:57,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:19:58,845 INFO  L124   PetriNetUnfolderBase]: 2853/4527 cut-off events.
[2024-06-14 16:19:58,846 INFO  L125   PetriNetUnfolderBase]: For 442766/442768 co-relation queries the response was YES.
[2024-06-14 16:19:58,957 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38051 conditions, 4527 events. 2853/4527 cut-off events. For 442766/442768 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26517 event pairs, 623 based on Foata normal form. 8/4534 useless extension candidates. Maximal degree in co-relation 37939. Up to 3634 conditions per place. 
[2024-06-14 16:19:58,972 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 146 changer transitions 0/332 dead transitions.
[2024-06-14 16:19:58,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 332 transitions, 5300 flow
[2024-06-14 16:19:58,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:19:58,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:19:58,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:19:58,973 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:19:58,973 INFO  L175             Difference]: Start difference. First operand has 226 places, 282 transitions, 3659 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:19:58,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 332 transitions, 5300 flow
[2024-06-14 16:19:59,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 332 transitions, 5099 flow, removed 82 selfloop flow, removed 3 redundant places.
[2024-06-14 16:19:59,441 INFO  L231             Difference]: Finished difference. Result has 234 places, 304 transitions, 4345 flow
[2024-06-14 16:19:59,441 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3494, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4345, PETRI_PLACES=234, PETRI_TRANSITIONS=304}
[2024-06-14 16:19:59,442 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places.
[2024-06-14 16:19:59,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 304 transitions, 4345 flow
[2024-06-14 16:19:59,442 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:19:59,442 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:19:59,442 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:19:59,442 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-14 16:19:59,442 INFO  L420      AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:19:59,443 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:19:59,443 INFO  L85        PathProgramCache]: Analyzing trace with hash -430472815, now seen corresponding path program 3 times
[2024-06-14 16:19:59,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:19:59,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204860382]
[2024-06-14 16:19:59,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:19:59,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:19:59,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:07,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:07,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:07,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204860382]
[2024-06-14 16:20:07,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204860382] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:07,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:07,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:07,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740011259]
[2024-06-14 16:20:07,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:07,202 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:07,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:07,202 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:07,202 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:07,346 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:20:07,346 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 304 transitions, 4345 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:07,346 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:07,346 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:20:07,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:08,880 INFO  L124   PetriNetUnfolderBase]: 2827/4501 cut-off events.
[2024-06-14 16:20:08,880 INFO  L125   PetriNetUnfolderBase]: For 438369/438371 co-relation queries the response was YES.
[2024-06-14 16:20:08,909 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38417 conditions, 4501 events. 2827/4501 cut-off events. For 438369/438371 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 26451 event pairs, 623 based on Foata normal form. 6/4506 useless extension candidates. Maximal degree in co-relation 38301. Up to 3870 conditions per place. 
[2024-06-14 16:20:08,923 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 204 selfloop transitions, 119 changer transitions 0/328 dead transitions.
[2024-06-14 16:20:08,923 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 328 transitions, 5339 flow
[2024-06-14 16:20:08,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:20:08,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:20:08,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-14 16:20:08,924 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-14 16:20:08,924 INFO  L175             Difference]: Start difference. First operand has 234 places, 304 transitions, 4345 flow. Second operand 9 states and 167 transitions.
[2024-06-14 16:20:08,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 328 transitions, 5339 flow
[2024-06-14 16:20:09,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 328 transitions, 5060 flow, removed 121 selfloop flow, removed 3 redundant places.
[2024-06-14 16:20:09,401 INFO  L231             Difference]: Finished difference. Result has 240 places, 304 transitions, 4313 flow
[2024-06-14 16:20:09,401 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4066, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4313, PETRI_PLACES=240, PETRI_TRANSITIONS=304}
[2024-06-14 16:20:09,402 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-14 16:20:09,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 304 transitions, 4313 flow
[2024-06-14 16:20:09,402 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:09,402 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:09,402 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:09,402 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-14 16:20:09,402 INFO  L420      AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:09,403 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:09,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -437830262, now seen corresponding path program 5 times
[2024-06-14 16:20:09,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:09,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155111937]
[2024-06-14 16:20:09,403 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:09,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:09,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:16,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:16,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:16,798 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155111937]
[2024-06-14 16:20:16,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155111937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:16,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:16,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:16,798 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253411383]
[2024-06-14 16:20:16,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:16,799 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:16,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:16,799 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:16,799 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:16,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:20:16,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 304 transitions, 4313 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:16,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:16,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:20:16,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:18,258 INFO  L124   PetriNetUnfolderBase]: 2867/4557 cut-off events.
[2024-06-14 16:20:18,258 INFO  L125   PetriNetUnfolderBase]: For 446234/446236 co-relation queries the response was YES.
[2024-06-14 16:20:18,289 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38840 conditions, 4557 events. 2867/4557 cut-off events. For 446234/446236 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26769 event pairs, 635 based on Foata normal form. 4/4560 useless extension candidates. Maximal degree in co-relation 38722. Up to 3641 conditions per place. 
[2024-06-14 16:20:18,306 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 205 selfloop transitions, 133 changer transitions 0/343 dead transitions.
[2024-06-14 16:20:18,306 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 343 transitions, 5744 flow
[2024-06-14 16:20:18,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:20:18,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:20:18,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 16:20:18,308 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 16:20:18,308 INFO  L175             Difference]: Start difference. First operand has 240 places, 304 transitions, 4313 flow. Second operand 9 states and 170 transitions.
[2024-06-14 16:20:18,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 343 transitions, 5744 flow
[2024-06-14 16:20:18,886 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 343 transitions, 5486 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-14 16:20:18,890 INFO  L231             Difference]: Finished difference. Result has 245 places, 318 transitions, 4734 flow
[2024-06-14 16:20:18,890 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4067, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4734, PETRI_PLACES=245, PETRI_TRANSITIONS=318}
[2024-06-14 16:20:18,890 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places.
[2024-06-14 16:20:18,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 318 transitions, 4734 flow
[2024-06-14 16:20:18,891 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:18,891 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:18,891 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:18,891 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-14 16:20:18,891 INFO  L420      AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:18,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:18,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -437824682, now seen corresponding path program 6 times
[2024-06-14 16:20:18,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:18,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82066449]
[2024-06-14 16:20:18,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:18,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:18,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:26,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:26,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:26,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82066449]
[2024-06-14 16:20:26,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82066449] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:26,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:26,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:26,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850530741]
[2024-06-14 16:20:26,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:26,486 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:26,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:26,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:26,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:26,640 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:20:26,640 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 318 transitions, 4734 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:26,640 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:26,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:20:26,641 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:27,930 INFO  L124   PetriNetUnfolderBase]: 2851/4541 cut-off events.
[2024-06-14 16:20:27,930 INFO  L125   PetriNetUnfolderBase]: For 449791/449793 co-relation queries the response was YES.
[2024-06-14 16:20:27,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38962 conditions, 4541 events. 2851/4541 cut-off events. For 449791/449793 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26707 event pairs, 632 based on Foata normal form. 8/4548 useless extension candidates. Maximal degree in co-relation 38840. Up to 3637 conditions per place. 
[2024-06-14 16:20:27,980 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 208 selfloop transitions, 130 changer transitions 0/343 dead transitions.
[2024-06-14 16:20:27,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 343 transitions, 5910 flow
[2024-06-14 16:20:27,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:20:27,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:20:27,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:20:27,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:20:27,982 INFO  L175             Difference]: Start difference. First operand has 245 places, 318 transitions, 4734 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:20:27,982 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 343 transitions, 5910 flow
[2024-06-14 16:20:28,749 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 343 transitions, 5612 flow, removed 85 selfloop flow, removed 4 redundant places.
[2024-06-14 16:20:28,753 INFO  L231             Difference]: Finished difference. Result has 250 places, 318 transitions, 4708 flow
[2024-06-14 16:20:28,753 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4436, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4708, PETRI_PLACES=250, PETRI_TRANSITIONS=318}
[2024-06-14 16:20:28,753 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places.
[2024-06-14 16:20:28,754 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 318 transitions, 4708 flow
[2024-06-14 16:20:28,754 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:28,754 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:28,754 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:28,754 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-14 16:20:28,755 INFO  L420      AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:28,755 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:28,755 INFO  L85        PathProgramCache]: Analyzing trace with hash 1125316635, now seen corresponding path program 4 times
[2024-06-14 16:20:28,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:28,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273380149]
[2024-06-14 16:20:28,756 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:28,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:28,818 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:36,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:36,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:36,832 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273380149]
[2024-06-14 16:20:36,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273380149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:36,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:36,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:36,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245042790]
[2024-06-14 16:20:36,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:36,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:36,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:36,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:36,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:37,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:20:37,015 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 318 transitions, 4708 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:37,015 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:37,015 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:20:37,015 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:38,489 INFO  L124   PetriNetUnfolderBase]: 2829/4502 cut-off events.
[2024-06-14 16:20:38,490 INFO  L125   PetriNetUnfolderBase]: For 440404/440406 co-relation queries the response was YES.
[2024-06-14 16:20:38,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38021 conditions, 4502 events. 2829/4502 cut-off events. For 440404/440406 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 26426 event pairs, 616 based on Foata normal form. 6/4507 useless extension candidates. Maximal degree in co-relation 37898. Up to 3860 conditions per place. 
[2024-06-14 16:20:38,534 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 230 selfloop transitions, 107 changer transitions 0/342 dead transitions.
[2024-06-14 16:20:38,534 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 342 transitions, 5742 flow
[2024-06-14 16:20:38,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:20:38,535 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:20:38,536 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-14 16:20:38,536 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-14 16:20:38,536 INFO  L175             Difference]: Start difference. First operand has 250 places, 318 transitions, 4708 flow. Second operand 9 states and 167 transitions.
[2024-06-14 16:20:38,536 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 342 transitions, 5742 flow
[2024-06-14 16:20:39,201 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 342 transitions, 5315 flow, removed 85 selfloop flow, removed 7 redundant places.
[2024-06-14 16:20:39,205 INFO  L231             Difference]: Finished difference. Result has 252 places, 318 transitions, 4505 flow
[2024-06-14 16:20:39,205 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4281, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4505, PETRI_PLACES=252, PETRI_TRANSITIONS=318}
[2024-06-14 16:20:39,205 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places.
[2024-06-14 16:20:39,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 318 transitions, 4505 flow
[2024-06-14 16:20:39,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:39,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:39,206 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:39,206 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-14 16:20:39,206 INFO  L420      AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:39,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:39,206 INFO  L85        PathProgramCache]: Analyzing trace with hash -522180848, now seen corresponding path program 1 times
[2024-06-14 16:20:39,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:39,206 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689937185]
[2024-06-14 16:20:39,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:39,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:39,238 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:46,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:46,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:46,178 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689937185]
[2024-06-14 16:20:46,178 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689937185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:46,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:46,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:46,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449322888]
[2024-06-14 16:20:46,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:46,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:46,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:46,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:46,180 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:46,320 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:20:46,320 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 318 transitions, 4505 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:46,320 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:46,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:20:46,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:47,711 INFO  L124   PetriNetUnfolderBase]: 2839/4508 cut-off events.
[2024-06-14 16:20:47,712 INFO  L125   PetriNetUnfolderBase]: For 438352/438354 co-relation queries the response was YES.
[2024-06-14 16:20:47,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37604 conditions, 4508 events. 2839/4508 cut-off events. For 438352/438354 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 26352 event pairs, 665 based on Foata normal form. 2/4509 useless extension candidates. Maximal degree in co-relation 37482. Up to 4222 conditions per place. 
[2024-06-14 16:20:47,754 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 303 selfloop transitions, 38 changer transitions 0/346 dead transitions.
[2024-06-14 16:20:47,755 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 346 transitions, 5339 flow
[2024-06-14 16:20:47,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:20:47,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:20:47,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-14 16:20:47,756 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-14 16:20:47,756 INFO  L175             Difference]: Start difference. First operand has 252 places, 318 transitions, 4505 flow. Second operand 8 states and 145 transitions.
[2024-06-14 16:20:47,756 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 346 transitions, 5339 flow
[2024-06-14 16:20:48,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 346 transitions, 5171 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 16:20:48,330 INFO  L231             Difference]: Finished difference. Result has 255 places, 322 transitions, 4519 flow
[2024-06-14 16:20:48,330 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4339, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4519, PETRI_PLACES=255, PETRI_TRANSITIONS=322}
[2024-06-14 16:20:48,330 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 212 predicate places.
[2024-06-14 16:20:48,330 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 322 transitions, 4519 flow
[2024-06-14 16:20:48,330 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:48,331 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:48,331 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:48,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-14 16:20:48,331 INFO  L420      AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:48,331 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:48,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -522060878, now seen corresponding path program 2 times
[2024-06-14 16:20:48,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:48,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565706971]
[2024-06-14 16:20:48,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:48,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:48,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:20:56,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:20:56,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:20:56,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565706971]
[2024-06-14 16:20:56,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565706971] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:20:56,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:20:56,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:20:56,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206330482]
[2024-06-14 16:20:56,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:20:56,169 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:20:56,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:20:56,169 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:20:56,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:20:56,311 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:20:56,312 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 322 transitions, 4519 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:56,312 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:20:56,312 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:20:56,312 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:20:57,741 INFO  L124   PetriNetUnfolderBase]: 2857/4554 cut-off events.
[2024-06-14 16:20:57,742 INFO  L125   PetriNetUnfolderBase]: For 452010/452012 co-relation queries the response was YES.
[2024-06-14 16:20:57,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37803 conditions, 4554 events. 2857/4554 cut-off events. For 452010/452012 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26799 event pairs, 653 based on Foata normal form. 2/4555 useless extension candidates. Maximal degree in co-relation 37680. Up to 4234 conditions per place. 
[2024-06-14 16:20:57,785 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 301 selfloop transitions, 45 changer transitions 0/351 dead transitions.
[2024-06-14 16:20:57,786 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 351 transitions, 5581 flow
[2024-06-14 16:20:57,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:20:57,786 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:20:57,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 16:20:57,787 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-14 16:20:57,787 INFO  L175             Difference]: Start difference. First operand has 255 places, 322 transitions, 4519 flow. Second operand 8 states and 146 transitions.
[2024-06-14 16:20:57,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 351 transitions, 5581 flow
[2024-06-14 16:20:58,509 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 351 transitions, 5495 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 16:20:58,513 INFO  L231             Difference]: Finished difference. Result has 260 places, 328 transitions, 4711 flow
[2024-06-14 16:20:58,513 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4433, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4711, PETRI_PLACES=260, PETRI_TRANSITIONS=328}
[2024-06-14 16:20:58,514 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places.
[2024-06-14 16:20:58,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 328 transitions, 4711 flow
[2024-06-14 16:20:58,514 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:20:58,514 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:20:58,514 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:20:58,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-14 16:20:58,514 INFO  L420      AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:20:58,514 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:20:58,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 818448868, now seen corresponding path program 3 times
[2024-06-14 16:20:58,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:20:58,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568988814]
[2024-06-14 16:20:58,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:20:58,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:20:58,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:06,349 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:06,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:06,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568988814]
[2024-06-14 16:21:06,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568988814] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:06,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:06,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:21:06,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391867738]
[2024-06-14 16:21:06,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:06,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:21:06,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:06,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:21:06,350 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:21:06,499 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:21:06,499 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 328 transitions, 4711 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:06,499 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:06,499 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:21:06,499 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:07,901 INFO  L124   PetriNetUnfolderBase]: 2907/4638 cut-off events.
[2024-06-14 16:21:07,901 INFO  L125   PetriNetUnfolderBase]: For 480046/480048 co-relation queries the response was YES.
[2024-06-14 16:21:07,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39195 conditions, 4638 events. 2907/4638 cut-off events. For 480046/480048 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27421 event pairs, 642 based on Foata normal form. 2/4639 useless extension candidates. Maximal degree in co-relation 39070. Up to 4262 conditions per place. 
[2024-06-14 16:21:07,958 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 292 selfloop transitions, 63 changer transitions 0/360 dead transitions.
[2024-06-14 16:21:07,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 360 transitions, 5943 flow
[2024-06-14 16:21:07,959 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 16:21:07,959 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 16:21:07,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 16:21:07,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 16:21:07,960 INFO  L175             Difference]: Start difference. First operand has 260 places, 328 transitions, 4711 flow. Second operand 8 states and 142 transitions.
[2024-06-14 16:21:07,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 360 transitions, 5943 flow
[2024-06-14 16:21:08,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 360 transitions, 5837 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 16:21:08,745 INFO  L231             Difference]: Finished difference. Result has 264 places, 340 transitions, 5111 flow
[2024-06-14 16:21:08,746 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4605, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5111, PETRI_PLACES=264, PETRI_TRANSITIONS=340}
[2024-06-14 16:21:08,748 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places.
[2024-06-14 16:21:08,749 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 340 transitions, 5111 flow
[2024-06-14 16:21:08,749 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:08,749 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:08,749 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:08,749 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-14 16:21:08,749 INFO  L420      AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:08,749 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:08,750 INFO  L85        PathProgramCache]: Analyzing trace with hash 151348148, now seen corresponding path program 4 times
[2024-06-14 16:21:08,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:08,750 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645024352]
[2024-06-14 16:21:08,750 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:08,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:08,782 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:16,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:16,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:16,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645024352]
[2024-06-14 16:21:16,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645024352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:16,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:16,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 16:21:16,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758457292]
[2024-06-14 16:21:16,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:16,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 16:21:16,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:16,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 16:21:16,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 16:21:17,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:21:17,040 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 340 transitions, 5111 flow. Second operand  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:17,040 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:17,040 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:21:17,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:18,568 INFO  L124   PetriNetUnfolderBase]: 2962/4710 cut-off events.
[2024-06-14 16:21:18,568 INFO  L125   PetriNetUnfolderBase]: For 492637/492637 co-relation queries the response was YES.
[2024-06-14 16:21:18,598 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40361 conditions, 4710 events. 2962/4710 cut-off events. For 492637/492637 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 27737 event pairs, 674 based on Foata normal form. 2/4711 useless extension candidates. Maximal degree in co-relation 40234. Up to 4400 conditions per place. 
[2024-06-14 16:21:18,613 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 340 selfloop transitions, 46 changer transitions 0/391 dead transitions.
[2024-06-14 16:21:18,614 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 391 transitions, 6324 flow
[2024-06-14 16:21:18,615 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-14 16:21:18,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-14 16:21:18,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions.
[2024-06-14 16:21:18,615 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-14 16:21:18,616 INFO  L175             Difference]: Start difference. First operand has 264 places, 340 transitions, 5111 flow. Second operand 12 states and 196 transitions.
[2024-06-14 16:21:18,616 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 391 transitions, 6324 flow
[2024-06-14 16:21:19,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 391 transitions, 6173 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-14 16:21:19,303 INFO  L231             Difference]: Finished difference. Result has 275 places, 358 transitions, 5479 flow
[2024-06-14 16:21:19,303 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4983, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5479, PETRI_PLACES=275, PETRI_TRANSITIONS=358}
[2024-06-14 16:21:19,304 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places.
[2024-06-14 16:21:19,304 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 358 transitions, 5479 flow
[2024-06-14 16:21:19,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:19,304 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:19,304 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:19,304 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-14 16:21:19,304 INFO  L420      AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:19,305 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:19,305 INFO  L85        PathProgramCache]: Analyzing trace with hash -1949302806, now seen corresponding path program 5 times
[2024-06-14 16:21:19,305 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:19,305 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191263192]
[2024-06-14 16:21:19,305 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:19,305 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:19,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:27,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:27,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:27,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191263192]
[2024-06-14 16:21:27,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191263192] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:27,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:27,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:21:27,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99500970]
[2024-06-14 16:21:27,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:27,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:21:27,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:27,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:21:27,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:21:27,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:21:27,251 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 358 transitions, 5479 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:27,251 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:27,251 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:21:27,251 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:28,837 INFO  L124   PetriNetUnfolderBase]: 2950/4697 cut-off events.
[2024-06-14 16:21:28,838 INFO  L125   PetriNetUnfolderBase]: For 497150/497150 co-relation queries the response was YES.
[2024-06-14 16:21:28,871 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40091 conditions, 4697 events. 2950/4697 cut-off events. For 497150/497150 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27674 event pairs, 646 based on Foata normal form. 4/4700 useless extension candidates. Maximal degree in co-relation 39959. Up to 4278 conditions per place. 
[2024-06-14 16:21:28,887 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 317 selfloop transitions, 70 changer transitions 0/392 dead transitions.
[2024-06-14 16:21:28,887 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 392 transitions, 6501 flow
[2024-06-14 16:21:28,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 16:21:28,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 16:21:28,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions.
[2024-06-14 16:21:28,890 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41125541125541126
[2024-06-14 16:21:28,890 INFO  L175             Difference]: Start difference. First operand has 275 places, 358 transitions, 5479 flow. Second operand 11 states and 190 transitions.
[2024-06-14 16:21:28,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 392 transitions, 6501 flow
[2024-06-14 16:21:29,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 392 transitions, 6377 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-14 16:21:29,727 INFO  L231             Difference]: Finished difference. Result has 279 places, 358 transitions, 5503 flow
[2024-06-14 16:21:29,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5355, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5503, PETRI_PLACES=279, PETRI_TRANSITIONS=358}
[2024-06-14 16:21:29,727 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places.
[2024-06-14 16:21:29,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 358 transitions, 5503 flow
[2024-06-14 16:21:29,727 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:29,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:29,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:29,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-14 16:21:29,728 INFO  L420      AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:29,728 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:29,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 503279376, now seen corresponding path program 6 times
[2024-06-14 16:21:29,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:29,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996059711]
[2024-06-14 16:21:29,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:29,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:29,760 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:36,826 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:36,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:36,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996059711]
[2024-06-14 16:21:36,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996059711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:36,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:36,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:21:36,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515918415]
[2024-06-14 16:21:36,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:36,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:21:36,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:36,827 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:21:36,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:21:36,973 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:21:36,973 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 358 transitions, 5503 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:36,973 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:36,973 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:21:36,974 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:38,502 INFO  L124   PetriNetUnfolderBase]: 2940/4693 cut-off events.
[2024-06-14 16:21:38,503 INFO  L125   PetriNetUnfolderBase]: For 497474/497474 co-relation queries the response was YES.
[2024-06-14 16:21:38,535 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40020 conditions, 4693 events. 2940/4693 cut-off events. For 497474/497474 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27704 event pairs, 593 based on Foata normal form. 2/4694 useless extension candidates. Maximal degree in co-relation 39887. Up to 4334 conditions per place. 
[2024-06-14 16:21:38,550 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 334 selfloop transitions, 50 changer transitions 0/389 dead transitions.
[2024-06-14 16:21:38,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 389 transitions, 6355 flow
[2024-06-14 16:21:38,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:21:38,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:21:38,552 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-14 16:21:38,552 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-14 16:21:38,552 INFO  L175             Difference]: Start difference. First operand has 279 places, 358 transitions, 5503 flow. Second operand 10 states and 176 transitions.
[2024-06-14 16:21:38,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 389 transitions, 6355 flow
[2024-06-14 16:21:39,442 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 389 transitions, 6183 flow, removed 28 selfloop flow, removed 8 redundant places.
[2024-06-14 16:21:39,447 INFO  L231             Difference]: Finished difference. Result has 281 places, 358 transitions, 5437 flow
[2024-06-14 16:21:39,447 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5331, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5437, PETRI_PLACES=281, PETRI_TRANSITIONS=358}
[2024-06-14 16:21:39,447 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places.
[2024-06-14 16:21:39,447 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 358 transitions, 5437 flow
[2024-06-14 16:21:39,448 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:39,448 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:39,448 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:39,448 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-14 16:21:39,448 INFO  L420      AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:39,448 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:39,448 INFO  L85        PathProgramCache]: Analyzing trace with hash 503399346, now seen corresponding path program 7 times
[2024-06-14 16:21:39,448 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:39,449 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678311122]
[2024-06-14 16:21:39,449 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:39,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:39,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:46,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:46,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:46,800 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678311122]
[2024-06-14 16:21:46,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678311122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:46,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:46,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:21:46,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170865151]
[2024-06-14 16:21:46,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:46,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:21:46,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:46,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:21:46,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:21:46,994 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:21:46,995 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 358 transitions, 5437 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:46,995 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:46,995 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:21:46,995 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:48,530 INFO  L124   PetriNetUnfolderBase]: 2934/4680 cut-off events.
[2024-06-14 16:21:48,530 INFO  L125   PetriNetUnfolderBase]: For 501616/501616 co-relation queries the response was YES.
[2024-06-14 16:21:48,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39744 conditions, 4680 events. 2934/4680 cut-off events. For 501616/501616 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 27635 event pairs, 647 based on Foata normal form. 2/4681 useless extension candidates. Maximal degree in co-relation 39610. Up to 4305 conditions per place. 
[2024-06-14 16:21:48,577 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 323 selfloop transitions, 60 changer transitions 0/388 dead transitions.
[2024-06-14 16:21:48,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 388 transitions, 6445 flow
[2024-06-14 16:21:48,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:21:48,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:21:48,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-14 16:21:48,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-14 16:21:48,578 INFO  L175             Difference]: Start difference. First operand has 281 places, 358 transitions, 5437 flow. Second operand 10 states and 176 transitions.
[2024-06-14 16:21:48,579 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 388 transitions, 6445 flow
[2024-06-14 16:21:49,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 388 transitions, 6303 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-06-14 16:21:49,427 INFO  L231             Difference]: Finished difference. Result has 282 places, 358 transitions, 5421 flow
[2024-06-14 16:21:49,427 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5295, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5421, PETRI_PLACES=282, PETRI_TRANSITIONS=358}
[2024-06-14 16:21:49,427 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 239 predicate places.
[2024-06-14 16:21:49,428 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 358 transitions, 5421 flow
[2024-06-14 16:21:49,428 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:49,428 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:21:49,428 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:21:49,428 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-14 16:21:49,428 INFO  L420      AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:21:49,428 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:21:49,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -1358504254, now seen corresponding path program 8 times
[2024-06-14 16:21:49,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:21:49,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688677850]
[2024-06-14 16:21:49,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:21:49,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:21:49,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:21:57,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:21:57,394 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:21:57,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688677850]
[2024-06-14 16:21:57,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688677850] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:21:57,394 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:21:57,394 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:21:57,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076839476]
[2024-06-14 16:21:57,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:21:57,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:21:57,395 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:21:57,395 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:21:57,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:21:57,538 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:21:57,538 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 358 transitions, 5421 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:21:57,538 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:21:57,538 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:21:57,538 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:21:59,092 INFO  L124   PetriNetUnfolderBase]: 2964/4724 cut-off events.
[2024-06-14 16:21:59,092 INFO  L125   PetriNetUnfolderBase]: For 527087/527087 co-relation queries the response was YES.
[2024-06-14 16:21:59,127 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40302 conditions, 4724 events. 2964/4724 cut-off events. For 527087/527087 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27880 event pairs, 638 based on Foata normal form. 6/4729 useless extension candidates. Maximal degree in co-relation 40168. Up to 4021 conditions per place. 
[2024-06-14 16:21:59,144 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 274 selfloop transitions, 115 changer transitions 0/394 dead transitions.
[2024-06-14 16:21:59,145 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 394 transitions, 6760 flow
[2024-06-14 16:21:59,145 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:21:59,145 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:21:59,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-14 16:21:59,147 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-14 16:21:59,147 INFO  L175             Difference]: Start difference. First operand has 282 places, 358 transitions, 5421 flow. Second operand 10 states and 181 transitions.
[2024-06-14 16:21:59,147 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 394 transitions, 6760 flow
[2024-06-14 16:22:00,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 394 transitions, 6569 flow, removed 18 selfloop flow, removed 9 redundant places.
[2024-06-14 16:22:00,063 INFO  L231             Difference]: Finished difference. Result has 283 places, 365 transitions, 5632 flow
[2024-06-14 16:22:00,063 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5230, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5632, PETRI_PLACES=283, PETRI_TRANSITIONS=365}
[2024-06-14 16:22:00,063 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places.
[2024-06-14 16:22:00,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 365 transitions, 5632 flow
[2024-06-14 16:22:00,064 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:00,064 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:00,064 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:00,064 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-14 16:22:00,065 INFO  L420      AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:22:00,065 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:00,065 INFO  L85        PathProgramCache]: Analyzing trace with hash -1358771164, now seen corresponding path program 9 times
[2024-06-14 16:22:00,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:00,065 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609741228]
[2024-06-14 16:22:00,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:00,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:00,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:07,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:22:07,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:07,576 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609741228]
[2024-06-14 16:22:07,576 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609741228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:07,576 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:07,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:22:07,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284787665]
[2024-06-14 16:22:07,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:07,577 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:22:07,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:07,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:22:07,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:22:07,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:22:07,722 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 365 transitions, 5632 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:07,722 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:07,722 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:22:07,722 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:09,205 INFO  L124   PetriNetUnfolderBase]: 2946/4700 cut-off events.
[2024-06-14 16:22:09,206 INFO  L125   PetriNetUnfolderBase]: For 520190/520190 co-relation queries the response was YES.
[2024-06-14 16:22:09,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39950 conditions, 4700 events. 2946/4700 cut-off events. For 520190/520190 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 27775 event pairs, 637 based on Foata normal form. 6/4705 useless extension candidates. Maximal degree in co-relation 39816. Up to 4012 conditions per place. 
[2024-06-14 16:22:09,258 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 270 selfloop transitions, 119 changer transitions 0/394 dead transitions.
[2024-06-14 16:22:09,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 394 transitions, 6818 flow
[2024-06-14 16:22:09,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 16:22:09,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 16:22:09,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-14 16:22:09,259 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-14 16:22:09,259 INFO  L175             Difference]: Start difference. First operand has 283 places, 365 transitions, 5632 flow. Second operand 10 states and 181 transitions.
[2024-06-14 16:22:09,259 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 394 transitions, 6818 flow
[2024-06-14 16:22:10,245 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 394 transitions, 6535 flow, removed 48 selfloop flow, removed 7 redundant places.
[2024-06-14 16:22:10,250 INFO  L231             Difference]: Finished difference. Result has 286 places, 365 transitions, 5598 flow
[2024-06-14 16:22:10,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5349, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5598, PETRI_PLACES=286, PETRI_TRANSITIONS=365}
[2024-06-14 16:22:10,251 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 243 predicate places.
[2024-06-14 16:22:10,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 365 transitions, 5598 flow
[2024-06-14 16:22:10,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:10,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:10,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:10,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-14 16:22:10,251 INFO  L420      AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:22:10,252 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:10,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 317963590, now seen corresponding path program 10 times
[2024-06-14 16:22:10,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:10,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919961311]
[2024-06-14 16:22:10,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:10,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:10,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:17,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 16:22:17,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:17,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919961311]
[2024-06-14 16:22:17,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919961311] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:17,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:17,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:22:17,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500897049]
[2024-06-14 16:22:17,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:17,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:22:17,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:17,774 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:22:17,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:22:17,884 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:22:17,884 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 365 transitions, 5598 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:17,885 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:17,885 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:22:17,885 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:19,380 INFO  L124   PetriNetUnfolderBase]: 3004/4788 cut-off events.
[2024-06-14 16:22:19,381 INFO  L125   PetriNetUnfolderBase]: For 542844/542846 co-relation queries the response was YES.
[2024-06-14 16:22:19,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40807 conditions, 4788 events. 3004/4788 cut-off events. For 542844/542846 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 28342 event pairs, 641 based on Foata normal form. 6/4793 useless extension candidates. Maximal degree in co-relation 40672. Up to 3749 conditions per place. 
[2024-06-14 16:22:19,439 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 204 selfloop transitions, 191 changer transitions 0/400 dead transitions.
[2024-06-14 16:22:19,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 400 transitions, 7142 flow
[2024-06-14 16:22:19,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:22:19,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:22:19,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:22:19,440 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:22:19,441 INFO  L175             Difference]: Start difference. First operand has 286 places, 365 transitions, 5598 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:22:19,441 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 400 transitions, 7142 flow
[2024-06-14 16:22:20,473 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 400 transitions, 6684 flow, removed 18 selfloop flow, removed 12 redundant places.
[2024-06-14 16:22:20,478 INFO  L231             Difference]: Finished difference. Result has 284 places, 376 transitions, 5736 flow
[2024-06-14 16:22:20,478 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5140, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=180, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5736, PETRI_PLACES=284, PETRI_TRANSITIONS=376}
[2024-06-14 16:22:20,478 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places.
[2024-06-14 16:22:20,478 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 376 transitions, 5736 flow
[2024-06-14 16:22:20,478 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:20,478 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 16:22:20,479 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 16:22:20,479 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-14 16:22:20,479 INFO  L420      AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 16:22:20,479 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 16:22:20,479 INFO  L85        PathProgramCache]: Analyzing trace with hash -1490235214, now seen corresponding path program 11 times
[2024-06-14 16:22:20,479 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 16:22:20,479 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739042839]
[2024-06-14 16:22:20,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 16:22:20,480 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 16:22:20,513 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 16:22:28,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-14 16:22:28,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 16:22:28,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739042839]
[2024-06-14 16:22:28,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739042839] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 16:22:28,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 16:22:28,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 16:22:28,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886347705]
[2024-06-14 16:22:28,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 16:22:28,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 16:22:28,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 16:22:28,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 16:22:28,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 16:22:28,652 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 16:22:28,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 376 transitions, 5736 flow. Second operand  has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 16:22:28,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 16:22:28,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 16:22:28,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 16:22:30,022 INFO  L124   PetriNetUnfolderBase]: 3038/4822 cut-off events.
[2024-06-14 16:22:30,023 INFO  L125   PetriNetUnfolderBase]: For 554518/554520 co-relation queries the response was YES.
[2024-06-14 16:22:30,061 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41414 conditions, 4822 events. 3038/4822 cut-off events. For 554518/554520 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 28443 event pairs, 667 based on Foata normal form. 6/4827 useless extension candidates. Maximal degree in co-relation 41279. Up to 3776 conditions per place. 
[2024-06-14 16:22:30,079 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 178 changer transitions 0/407 dead transitions.
[2024-06-14 16:22:30,080 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 407 transitions, 7245 flow
[2024-06-14 16:22:30,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 16:22:30,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 16:22:30,081 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 16:22:30,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 16:22:30,081 INFO  L175             Difference]: Start difference. First operand has 284 places, 376 transitions, 5736 flow. Second operand 9 states and 171 transitions.
[2024-06-14 16:22:30,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 407 transitions, 7245 flow
Killed by 15