./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 bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/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-bcb38a6-m
[2024-06-03 22:46:03,516 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 22:46:03,562 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 22:46:03,565 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 22:46:03,565 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 22:46:03,605 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 22:46:03,605 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 22:46:03,606 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 22:46:03,606 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 22:46:03,606 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 22:46:03,606 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 22:46:03,607 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 22:46:03,607 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 22:46:03,607 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 22:46:03,607 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 22:46:03,608 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 22:46:03,610 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 22:46:03,612 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 22:46:03,613 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 22:46:03,613 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 22:46:03,614 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 22:46:03,614 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 22:46:03,614 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 22:46:03,614 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 22:46:03,614 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 22:46:03,614 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 22:46:03,615 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 22:46:03,615 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 22:46:03,615 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 22:46:03,615 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 22:46:03,616 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 22:46:03,616 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 22:46:03,616 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:46:03,616 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 22:46:03,616 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 22:46:03,617 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 22:46:03,817 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 22:46:03,841 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 22:46:03,843 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 22:46:03,844 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 22:46:03,844 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 22:46:03,845 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-03 22:46:04,004 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 22:46:04,005 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 22:46:04,005 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-03 22:46:04,995 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 22:46:05,227 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 22:46:05,227 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt_pso.opt_rmo.opt.i
[2024-06-03 22:46:05,238 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be0d997/655eb2dd09fa439d81cfdda3b03b7d56/FLAG3306dee7a
[2024-06-03 22:46:05,248 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28be0d997/655eb2dd09fa439d81cfdda3b03b7d56
[2024-06-03 22:46:05,249 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 22:46:05,250 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 22:46:05,250 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 22:46:05,251 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 22:46:05,256 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 22:46:05,256 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:46:04" (1/2) ...
[2024-06-03 22:46:05,257 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7452af18 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:05, skipping insertion in model container
[2024-06-03 22:46:05,257 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:46:04" (1/2) ...
[2024-06-03 22:46:05,258 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b1a98d1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:05, skipping insertion in model container
[2024-06-03 22:46:05,258 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:46:05" (2/2) ...
[2024-06-03 22:46:05,259 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7452af18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:05, skipping insertion in model container
[2024-06-03 22:46:05,259 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:46:05" (2/2) ...
[2024-06-03 22:46:05,259 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 22:46:05,324 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 22:46:05,325 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-03 22:46:05,325 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-03 22:46:05,326 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-03 22:46:05,326 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 22:46:05,326 INFO  L106   edCorrectnessWitness]: ghost_update [L816-L816] multithreaded = 1;
[2024-06-03 22:46:05,360 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 22:46:05,628 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:46:05,643 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 22:46:06,005 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 22:46:06,032 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 22:46:06,032 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06 WrapperNode
[2024-06-03 22:46:06,032 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 22:46:06,033 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 22:46:06,033 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 22:46:06,033 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 22:46:06,038 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,069 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,152 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143
[2024-06-03 22:46:06,153 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 22:46:06,153 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 22:46:06,154 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 22:46:06,154 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 22:46:06,162 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,162 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,191 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,232 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-03 22:46:06,233 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,233 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,262 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,264 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,275 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,279 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,294 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 22:46:06,295 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 22:46:06,295 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 22:46:06,295 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 22:46:06,296 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (1/1) ...
[2024-06-03 22:46:06,300 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 22:46:06,306 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 22:46:06,317 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 22:46:06,339 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 22:46:06,349 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 22:46:06,349 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 22:46:06,349 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 22:46:06,350 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 22:46:06,350 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 22:46:06,350 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 22:46:06,350 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 22:46:06,350 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 22:46:06,350 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 22:46:06,350 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 22:46:06,351 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 22:46:06,351 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 22:46:06,352 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 22:46:06,464 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 22:46:06,465 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 22:46:07,474 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 22:46:07,475 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 22:46:07,713 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 22:46:07,714 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 22:46:07,714 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:46:07 BoogieIcfgContainer
[2024-06-03 22:46:07,714 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 22:46:07,717 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 22:46:07,717 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 22:46:07,720 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 22:46:07,720 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:46:04" (1/4) ...
[2024-06-03 22:46:07,720 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73186514 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:46:07, skipping insertion in model container
[2024-06-03 22:46:07,721 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:46:05" (2/4) ...
[2024-06-03 22:46:07,721 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73186514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:46:07, skipping insertion in model container
[2024-06-03 22:46:07,721 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:06" (3/4) ...
[2024-06-03 22:46:07,722 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73186514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:46:07, skipping insertion in model container
[2024-06-03 22:46:07,722 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:46:07" (4/4) ...
[2024-06-03 22:46:07,723 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe031_power.opt_pso.opt_rmo.opt.i
[2024-06-03 22:46:07,736 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 22:46:07,736 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 22:46:07,736 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 22:46:07,816 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 22:46:07,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 22:46:07,891 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-03 22:46:07,891 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:46:07,893 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-03 22:46:07,894 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-03 22:46:07,896 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-03 22:46:07,904 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 22:46:07,910 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;@13c7c557, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 22:46:07,910 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 22:46:07,917 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 22:46:07,917 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 22:46:07,918 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 22:46:07,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:07,918 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:07,919 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:07,923 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:07,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -1617218559, now seen corresponding path program 1 times
[2024-06-03 22:46:07,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:07,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680886606]
[2024-06-03 22:46:07,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:07,949 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:08,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:12,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:12,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:12,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680886606]
[2024-06-03 22:46:12,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680886606] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:12,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:12,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 22:46:12,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440833755]
[2024-06-03 22:46:12,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:12,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 22:46:12,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:12,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 22:46:12,339 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 22:46:12,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:46:12,393 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-03 22:46:12,393 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:12,393 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:46:12,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:12,971 INFO  L124   PetriNetUnfolderBase]: 1059/1630 cut-off events.
[2024-06-03 22:46:12,972 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-06-03 22:46:12,976 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-03 22:46:12,983 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 33 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-03 22:46:12,983 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow
[2024-06-03 22:46:12,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 22:46:12,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 22:46:12,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-03 22:46:12,993 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5793650793650794
[2024-06-03 22:46:12,994 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 73 transitions.
[2024-06-03 22:46:12,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow
[2024-06-03 22:46:12,996 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 22:46:12,998 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-03 22:46:12,999 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-03 22:46:13,002 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-03 22:46:13,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-03 22:46:13,002 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:13,002 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:13,002 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:13,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 22:46:13,003 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:13,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:13,003 INFO  L85        PathProgramCache]: Analyzing trace with hash 631156512, now seen corresponding path program 1 times
[2024-06-03 22:46:13,003 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:13,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039066378]
[2024-06-03 22:46:13,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:13,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:13,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:16,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:16,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:16,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039066378]
[2024-06-03 22:46:16,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039066378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:16,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:16,326 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 22:46:16,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875121963]
[2024-06-03 22:46:16,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:16,328 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 22:46:16,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:16,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 22:46:16,329 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 22:46:16,419 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-03 22:46:16,420 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-03 22:46:16,420 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:16,420 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-03 22:46:16,420 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:16,957 INFO  L124   PetriNetUnfolderBase]: 1053/1621 cut-off events.
[2024-06-03 22:46:16,957 INFO  L125   PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES.
[2024-06-03 22:46:16,960 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-03 22:46:16,967 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-03 22:46:16,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 242 flow
[2024-06-03 22:46:16,967 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 22:46:16,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 22:46:16,968 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions.
[2024-06-03 22:46:16,969 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5595238095238095
[2024-06-03 22:46:16,969 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 94 transitions.
[2024-06-03 22:46:16,969 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 242 flow
[2024-06-03 22:46:16,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 22:46:16,970 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-03 22:46:16,971 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-03 22:46:16,971 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-03 22:46:16,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-03 22:46:16,972 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-03 22:46:16,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:16,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:16,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 22:46:16,972 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-03 22:46:16,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:16,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -1104764257, now seen corresponding path program 1 times
[2024-06-03 22:46:16,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:16,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234682683]
[2024-06-03 22:46:16,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:16,974 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:17,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:25,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:25,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:25,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234682683]
[2024-06-03 22:46:25,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234682683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:25,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:25,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:46:25,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054597144]
[2024-06-03 22:46:25,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:25,131 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:46:25,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:25,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:46:25,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:46:25,190 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:46:25,190 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-03 22:46:25,191 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:25,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:46:25,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:25,962 INFO  L124   PetriNetUnfolderBase]: 1342/2033 cut-off events.
[2024-06-03 22:46:25,962 INFO  L125   PetriNetUnfolderBase]: For 1070/1070 co-relation queries the response was YES.
[2024-06-03 22:46:25,964 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-03 22:46:25,971 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 40 selfloop transitions, 8 changer transitions 0/53 dead transitions.
[2024-06-03 22:46:25,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 274 flow
[2024-06-03 22:46:25,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:46:25,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:46:25,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-03 22:46:25,976 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-03 22:46:25,976 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 92 transitions.
[2024-06-03 22:46:25,977 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 274 flow
[2024-06-03 22:46:25,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 260 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-03 22:46:25,980 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 166 flow
[2024-06-03 22:46:25,980 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-03 22:46:25,981 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places.
[2024-06-03 22:46:25,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 166 flow
[2024-06-03 22:46:25,982 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-03 22:46:25,982 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:25,982 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:25,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 22:46:25,982 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:25,983 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:25,983 INFO  L85        PathProgramCache]: Analyzing trace with hash -867182242, now seen corresponding path program 1 times
[2024-06-03 22:46:25,983 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:25,983 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698150789]
[2024-06-03 22:46:25,983 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:25,983 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:26,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:28,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:28,888 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:28,888 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698150789]
[2024-06-03 22:46:28,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698150789] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:28,889 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:28,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:46:28,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310245848]
[2024-06-03 22:46:28,889 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:28,889 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:46:28,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:28,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:46:28,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:46:29,006 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:46:29,007 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-03 22:46:29,007 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:29,007 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:46:29,007 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:29,677 INFO  L124   PetriNetUnfolderBase]: 1333/2018 cut-off events.
[2024-06-03 22:46:29,678 INFO  L125   PetriNetUnfolderBase]: For 1936/1936 co-relation queries the response was YES.
[2024-06-03 22:46:29,681 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-03 22:46:29,690 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 55 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-03 22:46:29,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 384 flow
[2024-06-03 22:46:29,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:46:29,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:46:29,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions.
[2024-06-03 22:46:29,694 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.503968253968254
[2024-06-03 22:46:29,694 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 166 flow. Second operand 6 states and 127 transitions.
[2024-06-03 22:46:29,694 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 384 flow
[2024-06-03 22:46:29,697 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 366 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-03 22:46:29,698 INFO  L231             Difference]: Finished difference. Result has 52 places, 46 transitions, 207 flow
[2024-06-03 22:46:29,698 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-03 22:46:29,699 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 9 predicate places.
[2024-06-03 22:46:29,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 207 flow
[2024-06-03 22:46:29,700 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-03 22:46:29,700 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:29,700 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:29,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 22:46:29,700 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:29,701 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:29,701 INFO  L85        PathProgramCache]: Analyzing trace with hash 73616824, now seen corresponding path program 1 times
[2024-06-03 22:46:29,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:29,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065913400]
[2024-06-03 22:46:29,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:29,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:29,728 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:38,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:38,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:38,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065913400]
[2024-06-03 22:46:38,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065913400] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:38,006 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:38,006 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:46:38,006 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639090958]
[2024-06-03 22:46:38,006 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:38,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:46:38,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:38,007 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:46:38,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:46:38,161 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:46:38,161 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-03 22:46:38,161 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:38,161 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:46:38,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:38,920 INFO  L124   PetriNetUnfolderBase]: 1323/2004 cut-off events.
[2024-06-03 22:46:38,920 INFO  L125   PetriNetUnfolderBase]: For 3162/3162 co-relation queries the response was YES.
[2024-06-03 22:46:38,923 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-03 22:46:38,931 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 49 selfloop transitions, 11 changer transitions 0/65 dead transitions.
[2024-06-03 22:46:38,931 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 385 flow
[2024-06-03 22:46:38,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:46:38,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:46:38,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-03 22:46:38,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 22:46:38,932 INFO  L175             Difference]: Start difference. First operand has 52 places, 46 transitions, 207 flow. Second operand 6 states and 108 transitions.
[2024-06-03 22:46:38,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 385 flow
[2024-06-03 22:46:38,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 356 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-03 22:46:38,935 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 232 flow
[2024-06-03 22:46:38,936 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-03 22:46:38,936 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places.
[2024-06-03 22:46:38,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 232 flow
[2024-06-03 22:46:38,936 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:38,937 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:38,937 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:38,937 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 22:46:38,937 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:38,937 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:38,937 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019520076, now seen corresponding path program 1 times
[2024-06-03 22:46:38,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:38,938 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247239226]
[2024-06-03 22:46:38,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:38,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:38,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:46,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:46,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:46,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247239226]
[2024-06-03 22:46:46,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247239226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:46,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:46,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:46:46,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161270559]
[2024-06-03 22:46:46,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:46,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:46:46,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:46,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:46:46,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:46:46,974 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:46:46,974 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-03 22:46:46,974 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:46,974 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:46:46,975 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:47,682 INFO  L124   PetriNetUnfolderBase]: 1334/2026 cut-off events.
[2024-06-03 22:46:47,683 INFO  L125   PetriNetUnfolderBase]: For 4463/4467 co-relation queries the response was YES.
[2024-06-03 22:46:47,686 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-03 22:46:47,694 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 54 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-03 22:46:47,694 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 482 flow
[2024-06-03 22:46:47,695 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:46:47,695 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:46:47,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-03 22:46:47,695 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:46:47,695 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 232 flow. Second operand 6 states and 114 transitions.
[2024-06-03 22:46:47,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 482 flow
[2024-06-03 22:46:47,697 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 452 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-03 22:46:47,698 INFO  L231             Difference]: Finished difference. Result has 57 places, 55 transitions, 288 flow
[2024-06-03 22:46:47,699 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-03 22:46:47,699 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-03 22:46:47,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 288 flow
[2024-06-03 22:46:47,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:47,700 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:47,700 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:47,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 22:46:47,700 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:47,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:47,700 INFO  L85        PathProgramCache]: Analyzing trace with hash -782187626, now seen corresponding path program 2 times
[2024-06-03 22:46:47,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:47,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306257014]
[2024-06-03 22:46:47,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:47,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:47,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:46:55,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:46:55,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:46:55,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306257014]
[2024-06-03 22:46:55,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306257014] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:46:55,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:46:55,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:46:55,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559758824]
[2024-06-03 22:46:55,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:46:55,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:46:55,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:46:55,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:46:55,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:46:55,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:46:55,872 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-03 22:46:55,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:46:55,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:46:55,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:46:56,669 INFO  L124   PetriNetUnfolderBase]: 1329/2018 cut-off events.
[2024-06-03 22:46:56,669 INFO  L125   PetriNetUnfolderBase]: For 5951/5951 co-relation queries the response was YES.
[2024-06-03 22:46:56,673 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-03 22:46:56,681 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 17 changer transitions 0/81 dead transitions.
[2024-06-03 22:46:56,681 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 506 flow
[2024-06-03 22:46:56,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:46:56,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:46:56,682 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-03 22:46:56,683 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-03 22:46:56,683 INFO  L175             Difference]: Start difference. First operand has 57 places, 55 transitions, 288 flow. Second operand 8 states and 142 transitions.
[2024-06-03 22:46:56,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 506 flow
[2024-06-03 22:46:56,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 472 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-03 22:46:56,688 INFO  L231             Difference]: Finished difference. Result has 63 places, 55 transitions, 296 flow
[2024-06-03 22:46:56,688 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-03 22:46:56,690 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-03 22:46:56,690 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 296 flow
[2024-06-03 22:46:56,691 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:46:56,691 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:46:56,691 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:46:56,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 22:46:56,691 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:46:56,691 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:46:56,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 1292991493, now seen corresponding path program 1 times
[2024-06-03 22:46:56,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:46:56,692 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685095405]
[2024-06-03 22:46:56,692 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:46:56,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:46:56,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:05,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:05,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:05,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685095405]
[2024-06-03 22:47:05,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685095405] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:05,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:05,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:47:05,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492537228]
[2024-06-03 22:47:05,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:05,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:47:05,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:05,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:47:05,326 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:47:05,406 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:47:05,407 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-03 22:47:05,407 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:05,407 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:47:05,407 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:06,260 INFO  L124   PetriNetUnfolderBase]: 1351/2061 cut-off events.
[2024-06-03 22:47:06,261 INFO  L125   PetriNetUnfolderBase]: For 7344/7348 co-relation queries the response was YES.
[2024-06-03 22:47:06,264 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-03 22:47:06,271 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 63 selfloop transitions, 24 changer transitions 0/92 dead transitions.
[2024-06-03 22:47:06,272 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 618 flow
[2024-06-03 22:47:06,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:47:06,274 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:47:06,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-03 22:47:06,274 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-03 22:47:06,275 INFO  L175             Difference]: Start difference. First operand has 63 places, 55 transitions, 296 flow. Second operand 8 states and 150 transitions.
[2024-06-03 22:47:06,275 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 618 flow
[2024-06-03 22:47:06,278 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 572 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-03 22:47:06,279 INFO  L231             Difference]: Finished difference. Result has 63 places, 61 transitions, 356 flow
[2024-06-03 22:47:06,279 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-03 22:47:06,279 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-03 22:47:06,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 356 flow
[2024-06-03 22:47:06,280 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:06,280 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:06,280 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:06,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 22:47:06,280 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:06,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:06,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 1522255093, now seen corresponding path program 2 times
[2024-06-03 22:47:06,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:06,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077533121]
[2024-06-03 22:47:06,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:06,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:06,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:14,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:14,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:14,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077533121]
[2024-06-03 22:47:14,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077533121] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:14,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:14,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:47:14,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124679027]
[2024-06-03 22:47:14,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:14,806 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:47:14,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:14,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:47:14,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:47:14,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:47:14,923 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-03 22:47:14,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:14,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:47:14,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:15,788 INFO  L124   PetriNetUnfolderBase]: 1373/2092 cut-off events.
[2024-06-03 22:47:15,788 INFO  L125   PetriNetUnfolderBase]: For 9388/9388 co-relation queries the response was YES.
[2024-06-03 22:47:15,792 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-03 22:47:15,799 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 29 changer transitions 0/98 dead transitions.
[2024-06-03 22:47:15,800 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 686 flow
[2024-06-03 22:47:15,801 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:47:15,801 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:47:15,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-03 22:47:15,802 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-03 22:47:15,802 INFO  L175             Difference]: Start difference. First operand has 63 places, 61 transitions, 356 flow. Second operand 9 states and 163 transitions.
[2024-06-03 22:47:15,802 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 686 flow
[2024-06-03 22:47:15,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 654 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-03 22:47:15,808 INFO  L231             Difference]: Finished difference. Result has 68 places, 64 transitions, 418 flow
[2024-06-03 22:47:15,808 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-03 22:47:15,809 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-03 22:47:15,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 418 flow
[2024-06-03 22:47:15,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:15,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:15,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:15,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 22:47:15,809 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:15,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:15,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 302940463, now seen corresponding path program 3 times
[2024-06-03 22:47:15,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:15,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843031023]
[2024-06-03 22:47:15,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:15,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:15,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:24,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-03 22:47:24,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:24,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843031023]
[2024-06-03 22:47:24,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843031023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:24,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:24,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:47:24,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226587702]
[2024-06-03 22:47:24,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:24,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:47:24,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:24,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:47:24,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:47:24,498 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:47:24,498 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-03 22:47:24,498 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:24,498 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:47:24,498 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:25,405 INFO  L124   PetriNetUnfolderBase]: 1363/2078 cut-off events.
[2024-06-03 22:47:25,405 INFO  L125   PetriNetUnfolderBase]: For 11010/11010 co-relation queries the response was YES.
[2024-06-03 22:47:25,408 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-03 22:47:25,414 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 64 selfloop transitions, 28 changer transitions 0/97 dead transitions.
[2024-06-03 22:47:25,415 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 97 transitions, 684 flow
[2024-06-03 22:47:25,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:47:25,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:47:25,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-03 22:47:25,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-03 22:47:25,417 INFO  L175             Difference]: Start difference. First operand has 68 places, 64 transitions, 418 flow. Second operand 9 states and 164 transitions.
[2024-06-03 22:47:25,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 97 transitions, 684 flow
[2024-06-03 22:47:25,424 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 97 transitions, 610 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-03 22:47:25,425 INFO  L231             Difference]: Finished difference. Result has 71 places, 64 transitions, 408 flow
[2024-06-03 22:47:25,425 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-03 22:47:25,425 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places.
[2024-06-03 22:47:25,426 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 408 flow
[2024-06-03 22:47:25,426 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:25,426 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:25,426 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:25,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 22:47:25,426 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:25,427 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:25,427 INFO  L85        PathProgramCache]: Analyzing trace with hash 303217293, now seen corresponding path program 1 times
[2024-06-03 22:47:25,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:25,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199015042]
[2024-06-03 22:47:25,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:25,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:25,460 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:33,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:33,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:33,716 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199015042]
[2024-06-03 22:47:33,716 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199015042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:33,716 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:33,716 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:47:33,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960657030]
[2024-06-03 22:47:33,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:33,717 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:47:33,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:33,717 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:47:33,717 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:47:33,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:47:33,832 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-03 22:47:33,832 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:33,832 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:47:33,832 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:34,629 INFO  L124   PetriNetUnfolderBase]: 1355/2066 cut-off events.
[2024-06-03 22:47:34,629 INFO  L125   PetriNetUnfolderBase]: For 12487/12487 co-relation queries the response was YES.
[2024-06-03 22:47:34,633 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-03 22:47:34,640 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 69 selfloop transitions, 13 changer transitions 0/87 dead transitions.
[2024-06-03 22:47:34,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 87 transitions, 648 flow
[2024-06-03 22:47:34,645 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:47:34,645 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:47:34,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-03 22:47:34,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-03 22:47:34,646 INFO  L175             Difference]: Start difference. First operand has 71 places, 64 transitions, 408 flow. Second operand 7 states and 124 transitions.
[2024-06-03 22:47:34,646 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 87 transitions, 648 flow
[2024-06-03 22:47:34,653 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 570 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-03 22:47:34,654 INFO  L231             Difference]: Finished difference. Result has 69 places, 66 transitions, 391 flow
[2024-06-03 22:47:34,654 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-03 22:47:34,655 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-03 22:47:34,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 391 flow
[2024-06-03 22:47:34,655 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-03 22:47:34,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:34,655 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:34,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 22:47:34,655 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-03 22:47:34,656 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:34,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694568561, now seen corresponding path program 1 times
[2024-06-03 22:47:34,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:34,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520404265]
[2024-06-03 22:47:34,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:34,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:34,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:41,750 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:41,750 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:41,750 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520404265]
[2024-06-03 22:47:41,750 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520404265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:41,750 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:41,750 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 22:47:41,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982602986]
[2024-06-03 22:47:41,751 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:41,751 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 22:47:41,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:41,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 22:47:41,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 22:47:41,858 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:47:41,858 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-03 22:47:41,858 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:41,858 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:47:41,858 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:42,420 INFO  L124   PetriNetUnfolderBase]: 1250/1960 cut-off events.
[2024-06-03 22:47:42,420 INFO  L125   PetriNetUnfolderBase]: For 13857/13857 co-relation queries the response was YES.
[2024-06-03 22:47:42,424 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-03 22:47:42,431 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 57 selfloop transitions, 8 changer transitions 0/77 dead transitions.
[2024-06-03 22:47:42,431 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 561 flow
[2024-06-03 22:47:42,431 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 22:47:42,431 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 22:47:42,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-06-03 22:47:42,432 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-03 22:47:42,432 INFO  L175             Difference]: Start difference. First operand has 69 places, 66 transitions, 391 flow. Second operand 5 states and 91 transitions.
[2024-06-03 22:47:42,432 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 561 flow
[2024-06-03 22:47:42,438 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 77 transitions, 518 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-03 22:47:42,439 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 396 flow
[2024-06-03 22:47:42,440 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-03 22:47:42,441 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-03 22:47:42,441 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 396 flow
[2024-06-03 22:47:42,441 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-03 22:47:42,442 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:42,442 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:42,442 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 22:47:42,442 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-03 22:47:42,442 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:42,443 INFO  L85        PathProgramCache]: Analyzing trace with hash 561682259, now seen corresponding path program 1 times
[2024-06-03 22:47:42,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:42,443 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373937451]
[2024-06-03 22:47:42,443 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:42,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:42,466 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:47:51,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:47:51,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:47:51,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373937451]
[2024-06-03 22:47:51,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373937451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:47:51,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:47:51,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:47:51,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808239857]
[2024-06-03 22:47:51,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:47:51,355 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:47:51,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:47:51,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:47:51,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:47:51,506 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:47:51,506 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-03 22:47:51,506 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:47:51,506 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:47:51,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:47:52,277 INFO  L124   PetriNetUnfolderBase]: 1363/2083 cut-off events.
[2024-06-03 22:47:52,278 INFO  L125   PetriNetUnfolderBase]: For 16144/16144 co-relation queries the response was YES.
[2024-06-03 22:47:52,282 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-03 22:47:52,289 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 69 selfloop transitions, 16 changer transitions 0/90 dead transitions.
[2024-06-03 22:47:52,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 640 flow
[2024-06-03 22:47:52,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:47:52,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:47:52,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-03 22:47:52,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-03 22:47:52,292 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 396 flow. Second operand 6 states and 112 transitions.
[2024-06-03 22:47:52,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 640 flow
[2024-06-03 22:47:52,299 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 614 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-03 22:47:52,300 INFO  L231             Difference]: Finished difference. Result has 72 places, 72 transitions, 448 flow
[2024-06-03 22:47:52,300 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-03 22:47:52,300 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places.
[2024-06-03 22:47:52,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 448 flow
[2024-06-03 22:47:52,301 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:47:52,301 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:47:52,301 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:47:52,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 22:47:52,301 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:47:52,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:47:52,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -1845135243, now seen corresponding path program 2 times
[2024-06-03 22:47:52,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:47:52,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701030156]
[2024-06-03 22:47:52,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:47:52,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:47:52,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:01,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:01,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:01,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701030156]
[2024-06-03 22:48:01,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701030156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:01,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:01,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:48:01,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087126080]
[2024-06-03 22:48:01,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:01,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:48:01,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:01,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:48:01,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:48:01,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:48:01,465 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-03 22:48:01,465 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:01,465 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:48:01,465 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:02,271 INFO  L124   PetriNetUnfolderBase]: 1374/2105 cut-off events.
[2024-06-03 22:48:02,271 INFO  L125   PetriNetUnfolderBase]: For 18918/18920 co-relation queries the response was YES.
[2024-06-03 22:48:02,275 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-03 22:48:02,282 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 71 selfloop transitions, 26 changer transitions 0/102 dead transitions.
[2024-06-03 22:48:02,282 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 102 transitions, 820 flow
[2024-06-03 22:48:02,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:48:02,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:48:02,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-03 22:48:02,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4489795918367347
[2024-06-03 22:48:02,285 INFO  L175             Difference]: Start difference. First operand has 72 places, 72 transitions, 448 flow. Second operand 7 states and 132 transitions.
[2024-06-03 22:48:02,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 102 transitions, 820 flow
[2024-06-03 22:48:02,296 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 768 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-03 22:48:02,297 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 534 flow
[2024-06-03 22:48:02,297 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-03 22:48:02,298 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places.
[2024-06-03 22:48:02,298 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 534 flow
[2024-06-03 22:48:02,298 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:02,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:02,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:02,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 22:48:02,299 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:02,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:02,299 INFO  L85        PathProgramCache]: Analyzing trace with hash -63012683, now seen corresponding path program 3 times
[2024-06-03 22:48:02,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:02,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009648626]
[2024-06-03 22:48:02,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:02,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:02,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:11,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-03 22:48:11,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:11,210 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009648626]
[2024-06-03 22:48:11,210 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009648626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:11,210 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:11,210 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:48:11,210 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117496414]
[2024-06-03 22:48:11,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:11,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:48:11,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:11,211 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:48:11,211 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:48:11,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:48:11,283 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-03 22:48:11,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:11,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:48:11,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:12,186 INFO  L124   PetriNetUnfolderBase]: 1369/2097 cut-off events.
[2024-06-03 22:48:12,186 INFO  L125   PetriNetUnfolderBase]: For 19751/19751 co-relation queries the response was YES.
[2024-06-03 22:48:12,190 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-03 22:48:12,196 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 76 selfloop transitions, 27 changer transitions 0/108 dead transitions.
[2024-06-03 22:48:12,197 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 108 transitions, 816 flow
[2024-06-03 22:48:12,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:48:12,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:48:12,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-03 22:48:12,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-03 22:48:12,199 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 534 flow. Second operand 9 states and 160 transitions.
[2024-06-03 22:48:12,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 108 transitions, 816 flow
[2024-06-03 22:48:12,212 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 754 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-03 22:48:12,213 INFO  L231             Difference]: Finished difference. Result has 80 places, 78 transitions, 534 flow
[2024-06-03 22:48:12,213 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-03 22:48:12,214 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-03 22:48:12,214 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 534 flow
[2024-06-03 22:48:12,214 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:12,214 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:12,214 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:12,214 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 22:48:12,215 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-03 22:48:12,215 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:12,215 INFO  L85        PathProgramCache]: Analyzing trace with hash 1029555678, now seen corresponding path program 1 times
[2024-06-03 22:48:12,215 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:12,215 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756824357]
[2024-06-03 22:48:12,215 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:12,215 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:12,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:19,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-03 22:48:19,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:19,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756824357]
[2024-06-03 22:48:19,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756824357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:19,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:19,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:48:19,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578746462]
[2024-06-03 22:48:19,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:19,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:48:19,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:19,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:48:19,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:48:19,980 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:48:19,980 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-03 22:48:19,980 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:19,980 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:48:19,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:20,631 INFO  L124   PetriNetUnfolderBase]: 1262/1998 cut-off events.
[2024-06-03 22:48:20,631 INFO  L125   PetriNetUnfolderBase]: For 21600/21604 co-relation queries the response was YES.
[2024-06-03 22:48:20,635 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-03 22:48:20,641 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 71 selfloop transitions, 20 changer transitions 0/103 dead transitions.
[2024-06-03 22:48:20,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 103 transitions, 842 flow
[2024-06-03 22:48:20,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:48:20,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:48:20,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-03 22:48:20,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4387755102040816
[2024-06-03 22:48:20,642 INFO  L175             Difference]: Start difference. First operand has 80 places, 78 transitions, 534 flow. Second operand 7 states and 129 transitions.
[2024-06-03 22:48:20,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 103 transitions, 842 flow
[2024-06-03 22:48:20,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 770 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-06-03 22:48:20,652 INFO  L231             Difference]: Finished difference. Result has 80 places, 86 transitions, 586 flow
[2024-06-03 22:48:20,653 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-03 22:48:20,653 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-03 22:48:20,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 586 flow
[2024-06-03 22:48:20,653 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-03 22:48:20,653 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:20,653 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:20,654 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 22:48:20,654 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:20,654 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:20,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 374384728, now seen corresponding path program 1 times
[2024-06-03 22:48:20,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:20,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292514440]
[2024-06-03 22:48:20,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:20,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:20,678 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:30,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:30,499 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:30,500 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292514440]
[2024-06-03 22:48:30,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292514440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:30,500 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:30,500 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:48:30,500 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231352619]
[2024-06-03 22:48:30,500 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:30,500 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:48:30,500 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:30,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:48:30,501 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:48:30,683 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:48:30,684 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-03 22:48:30,684 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:30,684 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:48:30,684 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:31,586 INFO  L124   PetriNetUnfolderBase]: 1402/2149 cut-off events.
[2024-06-03 22:48:31,586 INFO  L125   PetriNetUnfolderBase]: For 25765/25765 co-relation queries the response was YES.
[2024-06-03 22:48:31,591 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-03 22:48:31,633 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 97 selfloop transitions, 17 changer transitions 0/119 dead transitions.
[2024-06-03 22:48:31,634 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 119 transitions, 928 flow
[2024-06-03 22:48:31,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:48:31,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:48:31,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-03 22:48:31,636 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-03 22:48:31,637 INFO  L175             Difference]: Start difference. First operand has 80 places, 86 transitions, 586 flow. Second operand 8 states and 146 transitions.
[2024-06-03 22:48:31,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 119 transitions, 928 flow
[2024-06-03 22:48:31,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 890 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-03 22:48:31,650 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 634 flow
[2024-06-03 22:48:31,650 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-03 22:48:31,650 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-03 22:48:31,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 634 flow
[2024-06-03 22:48:31,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:31,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:31,651 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:31,651 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 22:48:31,651 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:31,653 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:31,653 INFO  L85        PathProgramCache]: Analyzing trace with hash 236000728, now seen corresponding path program 2 times
[2024-06-03 22:48:31,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:31,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30353746]
[2024-06-03 22:48:31,654 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:31,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:31,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:41,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:41,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:41,273 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30353746]
[2024-06-03 22:48:41,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30353746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:41,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:41,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:48:41,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102103842]
[2024-06-03 22:48:41,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:41,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:48:41,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:41,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:48:41,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:48:41,394 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:48:41,394 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-03 22:48:41,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:41,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:48:41,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:42,255 INFO  L124   PetriNetUnfolderBase]: 1456/2243 cut-off events.
[2024-06-03 22:48:42,255 INFO  L125   PetriNetUnfolderBase]: For 30408/30410 co-relation queries the response was YES.
[2024-06-03 22:48:42,260 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-03 22:48:42,268 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 88 selfloop transitions, 44 changer transitions 0/137 dead transitions.
[2024-06-03 22:48:42,268 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 137 transitions, 1244 flow
[2024-06-03 22:48:42,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:48:42,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:48:42,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions.
[2024-06-03 22:48:42,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4603174603174603
[2024-06-03 22:48:42,270 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 634 flow. Second operand 9 states and 174 transitions.
[2024-06-03 22:48:42,270 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 137 transitions, 1244 flow
[2024-06-03 22:48:42,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1172 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 22:48:42,285 INFO  L231             Difference]: Finished difference. Result has 88 places, 98 transitions, 796 flow
[2024-06-03 22:48:42,285 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-03 22:48:42,286 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 45 predicate places.
[2024-06-03 22:48:42,286 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 796 flow
[2024-06-03 22:48:42,286 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:42,286 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:42,286 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:42,286 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 22:48:42,286 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-03 22:48:42,287 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:42,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 1319295332, now seen corresponding path program 3 times
[2024-06-03 22:48:42,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:42,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953843143]
[2024-06-03 22:48:42,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:42,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:42,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:48:52,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:48:52,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:48:52,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953843143]
[2024-06-03 22:48:52,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953843143] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:48:52,217 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:48:52,217 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:48:52,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122617358]
[2024-06-03 22:48:52,217 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:48:52,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:48:52,218 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:48:52,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:48:52,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:48:52,353 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:48:52,354 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-03 22:48:52,354 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:48:52,354 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:48:52,354 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:48:53,164 INFO  L124   PetriNetUnfolderBase]: 1446/2235 cut-off events.
[2024-06-03 22:48:53,164 INFO  L125   PetriNetUnfolderBase]: For 34201/34201 co-relation queries the response was YES.
[2024-06-03 22:48:53,169 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-03 22:48:53,177 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 81 selfloop transitions, 44 changer transitions 0/130 dead transitions.
[2024-06-03 22:48:53,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 130 transitions, 1188 flow
[2024-06-03 22:48:53,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:48:53,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:48:53,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-03 22:48:53,179 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-03 22:48:53,179 INFO  L175             Difference]: Start difference. First operand has 88 places, 98 transitions, 796 flow. Second operand 8 states and 155 transitions.
[2024-06-03 22:48:53,179 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 130 transitions, 1188 flow
[2024-06-03 22:48:53,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 130 transitions, 1092 flow, removed 36 selfloop flow, removed 4 redundant places.
[2024-06-03 22:48:53,200 INFO  L231             Difference]: Finished difference. Result has 92 places, 98 transitions, 796 flow
[2024-06-03 22:48:53,201 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-03 22:48:53,201 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places.
[2024-06-03 22:48:53,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 796 flow
[2024-06-03 22:48:53,201 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:48:53,201 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:48:53,201 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:48:53,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 22:48:53,202 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:48:53,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:48:53,202 INFO  L85        PathProgramCache]: Analyzing trace with hash -240116752, now seen corresponding path program 1 times
[2024-06-03 22:48:53,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:48:53,202 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690205707]
[2024-06-03 22:48:53,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:48:53,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:48:53,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:02,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:02,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:02,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690205707]
[2024-06-03 22:49:02,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690205707] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:02,429 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:02,429 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:49:02,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817981475]
[2024-06-03 22:49:02,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:02,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:49:02,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:02,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:49:02,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:49:02,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:49:02,548 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-03 22:49:02,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:02,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:49:02,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:03,450 INFO  L124   PetriNetUnfolderBase]: 1463/2261 cut-off events.
[2024-06-03 22:49:03,450 INFO  L125   PetriNetUnfolderBase]: For 37064/37066 co-relation queries the response was YES.
[2024-06-03 22:49:03,455 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-03 22:49:03,462 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 100 selfloop transitions, 29 changer transitions 0/134 dead transitions.
[2024-06-03 22:49:03,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 1170 flow
[2024-06-03 22:49:03,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:49:03,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:49:03,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-03 22:49:03,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-03 22:49:03,465 INFO  L175             Difference]: Start difference. First operand has 92 places, 98 transitions, 796 flow. Second operand 9 states and 164 transitions.
[2024-06-03 22:49:03,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 1170 flow
[2024-06-03 22:49:03,481 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 134 transitions, 1074 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-03 22:49:03,482 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 801 flow
[2024-06-03 22:49:03,482 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-03 22:49:03,483 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-03 22:49:03,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 801 flow
[2024-06-03 22:49:03,483 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-03 22:49:03,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:03,483 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:03,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 22:49:03,483 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-03 22:49:03,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:03,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 675424656, now seen corresponding path program 1 times
[2024-06-03 22:49:03,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:03,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907686469]
[2024-06-03 22:49:03,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:03,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:03,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:11,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:11,435 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:11,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907686469]
[2024-06-03 22:49:11,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907686469] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:11,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:11,436 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:49:11,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675432723]
[2024-06-03 22:49:11,436 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:11,436 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:49:11,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:11,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:49:11,437 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:49:11,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:49:11,510 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-03 22:49:11,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:11,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:49:11,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:12,180 INFO  L124   PetriNetUnfolderBase]: 1342/2122 cut-off events.
[2024-06-03 22:49:12,181 INFO  L125   PetriNetUnfolderBase]: For 39870/39880 co-relation queries the response was YES.
[2024-06-03 22:49:12,187 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-03 22:49:12,194 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 92 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2024-06-03 22:49:12,194 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 118 transitions, 1079 flow
[2024-06-03 22:49:12,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:49:12,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:49:12,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-03 22:49:12,195 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-03 22:49:12,195 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 801 flow. Second operand 6 states and 111 transitions.
[2024-06-03 22:49:12,195 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 118 transitions, 1079 flow
[2024-06-03 22:49:12,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 118 transitions, 996 flow, removed 14 selfloop flow, removed 7 redundant places.
[2024-06-03 22:49:12,215 INFO  L231             Difference]: Finished difference. Result has 93 places, 103 transitions, 787 flow
[2024-06-03 22:49:12,215 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-03 22:49:12,216 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-03 22:49:12,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 103 transitions, 787 flow
[2024-06-03 22:49:12,216 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-03 22:49:12,216 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:12,216 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:12,216 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 22:49:12,216 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:12,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:12,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 1662059382, now seen corresponding path program 4 times
[2024-06-03 22:49:12,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:12,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488733587]
[2024-06-03 22:49:12,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:12,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:12,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:21,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:21,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:21,792 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488733587]
[2024-06-03 22:49:21,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488733587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:21,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:21,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:49:21,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122719765]
[2024-06-03 22:49:21,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:21,792 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:49:21,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:21,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:49:21,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:49:21,916 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:49:21,916 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-03 22:49:21,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:21,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:49:21,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:22,850 INFO  L124   PetriNetUnfolderBase]: 1495/2315 cut-off events.
[2024-06-03 22:49:22,851 INFO  L125   PetriNetUnfolderBase]: For 44148/44148 co-relation queries the response was YES.
[2024-06-03 22:49:22,857 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-03 22:49:22,864 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 94 selfloop transitions, 51 changer transitions 0/150 dead transitions.
[2024-06-03 22:49:22,864 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 150 transitions, 1309 flow
[2024-06-03 22:49:22,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:49:22,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:49:22,866 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 199 transitions.
[2024-06-03 22:49:22,867 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43073593073593075
[2024-06-03 22:49:22,867 INFO  L175             Difference]: Start difference. First operand has 93 places, 103 transitions, 787 flow. Second operand 11 states and 199 transitions.
[2024-06-03 22:49:22,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 150 transitions, 1309 flow
[2024-06-03 22:49:22,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 150 transitions, 1274 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-03 22:49:22,887 INFO  L231             Difference]: Finished difference. Result has 100 places, 106 transitions, 912 flow
[2024-06-03 22:49:22,887 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-03 22:49:22,887 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places.
[2024-06-03 22:49:22,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 912 flow
[2024-06-03 22:49:22,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:22,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:22,888 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:22,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 22:49:22,888 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:22,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:22,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -931972082, now seen corresponding path program 5 times
[2024-06-03 22:49:22,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:22,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833854399]
[2024-06-03 22:49:22,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:22,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:22,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:32,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:32,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:32,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833854399]
[2024-06-03 22:49:32,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833854399] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:32,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:32,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:49:32,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972298930]
[2024-06-03 22:49:32,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:32,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:49:32,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:32,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:49:32,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:49:32,646 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:49:32,647 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-03 22:49:32,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:32,647 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:49:32,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:33,546 INFO  L124   PetriNetUnfolderBase]: 1517/2347 cut-off events.
[2024-06-03 22:49:33,546 INFO  L125   PetriNetUnfolderBase]: For 48821/48821 co-relation queries the response was YES.
[2024-06-03 22:49:33,553 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-03 22:49:33,560 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 95 selfloop transitions, 50 changer transitions 0/150 dead transitions.
[2024-06-03 22:49:33,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 150 transitions, 1436 flow
[2024-06-03 22:49:33,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:49:33,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:49:33,562 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-03 22:49:33,563 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-03 22:49:33,563 INFO  L175             Difference]: Start difference. First operand has 100 places, 106 transitions, 912 flow. Second operand 10 states and 188 transitions.
[2024-06-03 22:49:33,563 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 150 transitions, 1436 flow
[2024-06-03 22:49:33,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 150 transitions, 1302 flow, removed 27 selfloop flow, removed 8 redundant places.
[2024-06-03 22:49:33,592 INFO  L231             Difference]: Finished difference. Result has 102 places, 109 transitions, 942 flow
[2024-06-03 22:49:33,592 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-03 22:49:33,592 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places.
[2024-06-03 22:49:33,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 109 transitions, 942 flow
[2024-06-03 22:49:33,593 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:33,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:33,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:33,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 22:49:33,593 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:33,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:33,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -932179472, now seen corresponding path program 6 times
[2024-06-03 22:49:33,593 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:33,593 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045348586]
[2024-06-03 22:49:33,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:33,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:33,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:43,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:43,210 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:43,211 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045348586]
[2024-06-03 22:49:43,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045348586] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:43,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:43,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:49:43,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557051540]
[2024-06-03 22:49:43,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:43,211 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:49:43,211 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:43,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:49:43,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:49:43,356 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:49:43,356 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-03 22:49:43,356 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:43,356 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:49:43,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:44,291 INFO  L124   PetriNetUnfolderBase]: 1507/2338 cut-off events.
[2024-06-03 22:49:44,291 INFO  L125   PetriNetUnfolderBase]: For 51178/51178 co-relation queries the response was YES.
[2024-06-03 22:49:44,298 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-03 22:49:44,305 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 90 selfloop transitions, 52 changer transitions 0/147 dead transitions.
[2024-06-03 22:49:44,305 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 147 transitions, 1320 flow
[2024-06-03 22:49:44,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:49:44,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:49:44,307 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-03 22:49:44,307 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-03 22:49:44,308 INFO  L175             Difference]: Start difference. First operand has 102 places, 109 transitions, 942 flow. Second operand 10 states and 184 transitions.
[2024-06-03 22:49:44,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 147 transitions, 1320 flow
[2024-06-03 22:49:44,335 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 147 transitions, 1128 flow, removed 28 selfloop flow, removed 9 redundant places.
[2024-06-03 22:49:44,337 INFO  L231             Difference]: Finished difference. Result has 103 places, 109 transitions, 862 flow
[2024-06-03 22:49:44,337 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-03 22:49:44,337 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 60 predicate places.
[2024-06-03 22:49:44,337 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 109 transitions, 862 flow
[2024-06-03 22:49:44,338 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:49:44,338 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:44,338 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:44,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 22:49:44,338 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-03 22:49:44,338 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:44,338 INFO  L85        PathProgramCache]: Analyzing trace with hash -675204166, now seen corresponding path program 2 times
[2024-06-03 22:49:44,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:44,339 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317721153]
[2024-06-03 22:49:44,339 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:44,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:44,372 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:49:53,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:49:53,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:49:53,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317721153]
[2024-06-03 22:49:53,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317721153] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:49:53,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:49:53,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:49:53,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503031974]
[2024-06-03 22:49:53,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:49:53,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:49:53,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:49:53,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:49:53,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:49:53,898 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:49:53,898 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-03 22:49:53,898 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:49:53,898 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:49:53,899 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:49:54,816 INFO  L124   PetriNetUnfolderBase]: 1524/2375 cut-off events.
[2024-06-03 22:49:54,817 INFO  L125   PetriNetUnfolderBase]: For 54116/54116 co-relation queries the response was YES.
[2024-06-03 22:49:54,823 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-03 22:49:54,831 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 112 selfloop transitions, 31 changer transitions 0/148 dead transitions.
[2024-06-03 22:49:54,831 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 1276 flow
[2024-06-03 22:49:54,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:49:54,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:49:54,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions.
[2024-06-03 22:49:54,833 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42142857142857143
[2024-06-03 22:49:54,833 INFO  L175             Difference]: Start difference. First operand has 103 places, 109 transitions, 862 flow. Second operand 10 states and 177 transitions.
[2024-06-03 22:49:54,833 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 148 transitions, 1276 flow
[2024-06-03 22:49:54,862 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 148 transitions, 1164 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-03 22:49:54,864 INFO  L231             Difference]: Finished difference. Result has 104 places, 111 transitions, 859 flow
[2024-06-03 22:49:54,864 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-03 22:49:54,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-03 22:49:54,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 111 transitions, 859 flow
[2024-06-03 22:49:54,865 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-03 22:49:54,865 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:49:54,865 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:49:54,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 22:49:54,865 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:49:54,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:49:54,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 1671590518, now seen corresponding path program 3 times
[2024-06-03 22:49:54,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:49:54,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925770817]
[2024-06-03 22:49:54,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:49:54,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:49:54,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:04,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:04,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:04,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925770817]
[2024-06-03 22:50:04,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925770817] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:04,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:04,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:50:04,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220932686]
[2024-06-03 22:50:04,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:04,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:50:04,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:04,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:50:04,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:50:04,202 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:50:04,203 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-03 22:50:04,203 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:04,203 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:50:04,203 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:05,164 INFO  L124   PetriNetUnfolderBase]: 1541/2402 cut-off events.
[2024-06-03 22:50:05,164 INFO  L125   PetriNetUnfolderBase]: For 59106/59106 co-relation queries the response was YES.
[2024-06-03 22:50:05,171 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-03 22:50:05,178 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 111 selfloop transitions, 38 changer transitions 0/154 dead transitions.
[2024-06-03 22:50:05,178 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 154 transitions, 1423 flow
[2024-06-03 22:50:05,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:50:05,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:50:05,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 179 transitions.
[2024-06-03 22:50:05,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4261904761904762
[2024-06-03 22:50:05,181 INFO  L175             Difference]: Start difference. First operand has 104 places, 111 transitions, 859 flow. Second operand 10 states and 179 transitions.
[2024-06-03 22:50:05,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 154 transitions, 1423 flow
[2024-06-03 22:50:05,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 154 transitions, 1332 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-03 22:50:05,215 INFO  L231             Difference]: Finished difference. Result has 106 places, 115 transitions, 935 flow
[2024-06-03 22:50:05,216 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-03 22:50:05,216 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places.
[2024-06-03 22:50:05,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 115 transitions, 935 flow
[2024-06-03 22:50:05,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:05,216 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:05,216 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:05,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 22:50:05,217 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:50:05,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:05,217 INFO  L85        PathProgramCache]: Analyzing trace with hash 812102542, now seen corresponding path program 4 times
[2024-06-03 22:50:05,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:05,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389235682]
[2024-06-03 22:50:05,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:05,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:05,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:14,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:14,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:14,517 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389235682]
[2024-06-03 22:50:14,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389235682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:14,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:14,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:50:14,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894184937]
[2024-06-03 22:50:14,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:14,518 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:50:14,518 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:14,518 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:50:14,518 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:50:14,622 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:50:14,622 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-03 22:50:14,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:14,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:50:14,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:15,606 INFO  L124   PetriNetUnfolderBase]: 1533/2390 cut-off events.
[2024-06-03 22:50:15,606 INFO  L125   PetriNetUnfolderBase]: For 62705/62705 co-relation queries the response was YES.
[2024-06-03 22:50:15,613 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-03 22:50:15,621 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 118 selfloop transitions, 30 changer transitions 0/153 dead transitions.
[2024-06-03 22:50:15,621 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 153 transitions, 1325 flow
[2024-06-03 22:50:15,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:50:15,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:50:15,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-03 22:50:15,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 22:50:15,624 INFO  L175             Difference]: Start difference. First operand has 106 places, 115 transitions, 935 flow. Second operand 10 states and 180 transitions.
[2024-06-03 22:50:15,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 153 transitions, 1325 flow
[2024-06-03 22:50:15,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 153 transitions, 1227 flow, removed 31 selfloop flow, removed 6 redundant places.
[2024-06-03 22:50:15,669 INFO  L231             Difference]: Finished difference. Result has 110 places, 115 transitions, 904 flow
[2024-06-03 22:50:15,670 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-03 22:50:15,670 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-03 22:50:15,670 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 904 flow
[2024-06-03 22:50:15,670 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-03 22:50:15,670 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:15,670 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:15,670 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 22:50:15,671 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-03 22:50:15,671 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:15,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -874781862, now seen corresponding path program 2 times
[2024-06-03 22:50:15,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:15,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690679672]
[2024-06-03 22:50:15,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:15,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:15,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:23,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:23,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:23,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690679672]
[2024-06-03 22:50:23,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690679672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:23,284 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:23,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:50:23,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399208745]
[2024-06-03 22:50:23,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:23,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:50:23,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:23,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:50:23,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:50:23,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:50:23,388 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-03 22:50:23,388 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:23,388 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:50:23,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:24,038 INFO  L124   PetriNetUnfolderBase]: 1374/2205 cut-off events.
[2024-06-03 22:50:24,038 INFO  L125   PetriNetUnfolderBase]: For 63747/63757 co-relation queries the response was YES.
[2024-06-03 22:50:24,046 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-03 22:50:24,053 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 93 selfloop transitions, 22 changer transitions 0/131 dead transitions.
[2024-06-03 22:50:24,053 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 131 transitions, 1174 flow
[2024-06-03 22:50:24,054 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:50:24,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:50:24,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-03 22:50:24,054 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-03 22:50:24,054 INFO  L175             Difference]: Start difference. First operand has 110 places, 115 transitions, 904 flow. Second operand 7 states and 128 transitions.
[2024-06-03 22:50:24,054 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 131 transitions, 1174 flow
[2024-06-03 22:50:24,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 131 transitions, 1085 flow, removed 10 selfloop flow, removed 9 redundant places.
[2024-06-03 22:50:24,100 INFO  L231             Difference]: Finished difference. Result has 108 places, 115 transitions, 867 flow
[2024-06-03 22:50:24,100 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-03 22:50:24,101 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-03 22:50:24,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 115 transitions, 867 flow
[2024-06-03 22:50:24,101 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-03 22:50:24,101 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:24,101 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:24,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 22:50:24,101 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-03 22:50:24,102 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:24,102 INFO  L85        PathProgramCache]: Analyzing trace with hash 682097840, now seen corresponding path program 1 times
[2024-06-03 22:50:24,102 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:24,102 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807580148]
[2024-06-03 22:50:24,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:24,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:24,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:31,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:31,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:31,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807580148]
[2024-06-03 22:50:31,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807580148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:31,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:31,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:50:31,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095267153]
[2024-06-03 22:50:31,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:31,375 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:50:31,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:31,375 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:50:31,375 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:50:31,447 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:50:31,447 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-03 22:50:31,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:31,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:50:31,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:32,152 INFO  L124   PetriNetUnfolderBase]: 1522/2375 cut-off events.
[2024-06-03 22:50:32,152 INFO  L125   PetriNetUnfolderBase]: For 67259/67259 co-relation queries the response was YES.
[2024-06-03 22:50:32,160 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-03 22:50:32,167 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 114 selfloop transitions, 11 changer transitions 0/130 dead transitions.
[2024-06-03 22:50:32,167 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 130 transitions, 1177 flow
[2024-06-03 22:50:32,169 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:50:32,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:50:32,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-03 22:50:32,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-03 22:50:32,169 INFO  L175             Difference]: Start difference. First operand has 108 places, 115 transitions, 867 flow. Second operand 6 states and 103 transitions.
[2024-06-03 22:50:32,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 130 transitions, 1177 flow
[2024-06-03 22:50:32,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 130 transitions, 1116 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-03 22:50:32,209 INFO  L231             Difference]: Finished difference. Result has 108 places, 118 transitions, 870 flow
[2024-06-03 22:50:32,209 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-03 22:50:32,209 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-03 22:50:32,210 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 870 flow
[2024-06-03 22:50:32,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:32,210 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:32,210 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:32,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 22:50:32,210 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-03 22:50:32,210 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:32,211 INFO  L85        PathProgramCache]: Analyzing trace with hash 682247570, now seen corresponding path program 2 times
[2024-06-03 22:50:32,211 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:32,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561935939]
[2024-06-03 22:50:32,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:32,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:32,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:39,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:39,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:39,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561935939]
[2024-06-03 22:50:39,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561935939] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:39,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:39,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 22:50:39,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615762430]
[2024-06-03 22:50:39,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:39,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 22:50:39,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:39,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 22:50:39,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 22:50:39,784 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:50:39,784 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-03 22:50:39,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:39,785 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:50:39,785 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:40,458 INFO  L124   PetriNetUnfolderBase]: 1519/2372 cut-off events.
[2024-06-03 22:50:40,458 INFO  L125   PetriNetUnfolderBase]: For 70961/70963 co-relation queries the response was YES.
[2024-06-03 22:50:40,465 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-03 22:50:40,471 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 109 selfloop transitions, 16 changer transitions 0/130 dead transitions.
[2024-06-03 22:50:40,471 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 130 transitions, 1178 flow
[2024-06-03 22:50:40,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 22:50:40,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 22:50:40,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-03 22:50:40,472 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 22:50:40,472 INFO  L175             Difference]: Start difference. First operand has 108 places, 118 transitions, 870 flow. Second operand 6 states and 102 transitions.
[2024-06-03 22:50:40,472 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 130 transitions, 1178 flow
[2024-06-03 22:50:40,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 130 transitions, 1136 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-03 22:50:40,513 INFO  L231             Difference]: Finished difference. Result has 110 places, 121 transitions, 908 flow
[2024-06-03 22:50:40,513 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-03 22:50:40,513 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 67 predicate places.
[2024-06-03 22:50:40,513 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 121 transitions, 908 flow
[2024-06-03 22:50:40,514 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:50:40,514 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:40,514 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:40,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 22:50:40,514 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-03 22:50:40,514 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:40,514 INFO  L85        PathProgramCache]: Analyzing trace with hash 1851456156, now seen corresponding path program 1 times
[2024-06-03 22:50:40,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:40,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019986081]
[2024-06-03 22:50:40,514 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:40,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:40,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:50:48,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:50:48,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:50:48,863 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019986081]
[2024-06-03 22:50:48,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019986081] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:50:48,863 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:50:48,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:50:48,863 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120641085]
[2024-06-03 22:50:48,863 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:50:48,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:50:48,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:50:48,864 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:50:48,864 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:50:49,003 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:50:49,004 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-03 22:50:49,004 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:50:49,004 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:50:49,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:50:49,752 INFO  L124   PetriNetUnfolderBase]: 1394/2233 cut-off events.
[2024-06-03 22:50:49,752 INFO  L125   PetriNetUnfolderBase]: For 74146/74156 co-relation queries the response was YES.
[2024-06-03 22:50:49,761 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-03 22:50:49,769 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 99 selfloop transitions, 27 changer transitions 0/142 dead transitions.
[2024-06-03 22:50:49,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 142 transitions, 1248 flow
[2024-06-03 22:50:49,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:50:49,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:50:49,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-03 22:50:49,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-03 22:50:49,770 INFO  L175             Difference]: Start difference. First operand has 110 places, 121 transitions, 908 flow. Second operand 8 states and 143 transitions.
[2024-06-03 22:50:49,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 142 transitions, 1248 flow
[2024-06-03 22:50:49,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 142 transitions, 1190 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-03 22:50:49,812 INFO  L231             Difference]: Finished difference. Result has 114 places, 125 transitions, 965 flow
[2024-06-03 22:50:49,812 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-03 22:50:49,813 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places.
[2024-06-03 22:50:49,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 125 transitions, 965 flow
[2024-06-03 22:50:49,813 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-03 22:50:49,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:50:49,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:50:49,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 22:50:49,813 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-03 22:50:49,813 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:50:49,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1026709730, now seen corresponding path program 1 times
[2024-06-03 22:50:49,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:50:49,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966843254]
[2024-06-03 22:50:49,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:50:49,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:50:49,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:00,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:00,181 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:00,181 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966843254]
[2024-06-03 22:51:00,181 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966843254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:00,181 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:00,181 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:51:00,181 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380019303]
[2024-06-03 22:51:00,181 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:00,182 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:51:00,182 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:00,182 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:51:00,182 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:51:00,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:51:00,318 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-03 22:51:00,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:00,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:51:00,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:01,293 INFO  L124   PetriNetUnfolderBase]: 1568/2451 cut-off events.
[2024-06-03 22:51:01,293 INFO  L125   PetriNetUnfolderBase]: For 81955/81955 co-relation queries the response was YES.
[2024-06-03 22:51:01,303 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-03 22:51:01,311 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 132 selfloop transitions, 22 changer transitions 0/159 dead transitions.
[2024-06-03 22:51:01,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 159 transitions, 1545 flow
[2024-06-03 22:51:01,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:51:01,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:51:01,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-03 22:51:01,314 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-03 22:51:01,314 INFO  L175             Difference]: Start difference. First operand has 114 places, 125 transitions, 965 flow. Second operand 8 states and 147 transitions.
[2024-06-03 22:51:01,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 159 transitions, 1545 flow
[2024-06-03 22:51:01,366 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 159 transitions, 1458 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 22:51:01,368 INFO  L231             Difference]: Finished difference. Result has 116 places, 129 transitions, 1025 flow
[2024-06-03 22:51:01,368 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-03 22:51:01,369 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-03 22:51:01,369 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 129 transitions, 1025 flow
[2024-06-03 22:51:01,369 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:01,369 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:01,369 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:01,369 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 22:51:01,369 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-03 22:51:01,370 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:01,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392003820, now seen corresponding path program 2 times
[2024-06-03 22:51:01,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:01,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4622907]
[2024-06-03 22:51:01,370 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:01,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:01,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:11,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:11,606 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:11,606 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4622907]
[2024-06-03 22:51:11,606 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4622907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:11,606 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:11,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:51:11,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958352152]
[2024-06-03 22:51:11,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:11,607 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:51:11,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:11,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:51:11,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:51:11,729 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:51:11,729 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-03 22:51:11,729 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:11,729 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:51:11,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:12,658 INFO  L124   PetriNetUnfolderBase]: 1560/2435 cut-off events.
[2024-06-03 22:51:12,658 INFO  L125   PetriNetUnfolderBase]: For 86213/86213 co-relation queries the response was YES.
[2024-06-03 22:51:12,667 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-03 22:51:12,676 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 129 selfloop transitions, 18 changer transitions 0/152 dead transitions.
[2024-06-03 22:51:12,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 152 transitions, 1377 flow
[2024-06-03 22:51:12,678 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:51:12,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:51:12,678 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-03 22:51:12,678 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43537414965986393
[2024-06-03 22:51:12,678 INFO  L175             Difference]: Start difference. First operand has 116 places, 129 transitions, 1025 flow. Second operand 7 states and 128 transitions.
[2024-06-03 22:51:12,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 152 transitions, 1377 flow
[2024-06-03 22:51:12,727 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 152 transitions, 1275 flow, removed 41 selfloop flow, removed 4 redundant places.
[2024-06-03 22:51:12,729 INFO  L231             Difference]: Finished difference. Result has 119 places, 129 transitions, 966 flow
[2024-06-03 22:51:12,729 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-03 22:51:12,729 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places.
[2024-06-03 22:51:12,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 966 flow
[2024-06-03 22:51:12,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:12,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:12,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:12,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 22:51:12,730 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-03 22:51:12,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:12,730 INFO  L85        PathProgramCache]: Analyzing trace with hash -2057950874, now seen corresponding path program 3 times
[2024-06-03 22:51:12,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:12,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833579401]
[2024-06-03 22:51:12,730 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:12,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:12,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:22,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:22,824 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:22,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833579401]
[2024-06-03 22:51:22,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833579401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:22,825 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:22,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:51:22,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378249180]
[2024-06-03 22:51:22,825 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:22,825 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:51:22,825 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:22,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:51:22,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:51:22,913 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:51:22,913 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-03 22:51:22,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:22,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:51:22,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:23,925 INFO  L124   PetriNetUnfolderBase]: 1577/2463 cut-off events.
[2024-06-03 22:51:23,925 INFO  L125   PetriNetUnfolderBase]: For 92024/92026 co-relation queries the response was YES.
[2024-06-03 22:51:23,933 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-03 22:51:23,939 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 125 selfloop transitions, 28 changer transitions 0/158 dead transitions.
[2024-06-03 22:51:23,940 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 158 transitions, 1390 flow
[2024-06-03 22:51:23,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:51:23,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:51:23,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-03 22:51:23,942 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-03 22:51:23,942 INFO  L175             Difference]: Start difference. First operand has 119 places, 129 transitions, 966 flow. Second operand 8 states and 146 transitions.
[2024-06-03 22:51:23,942 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 158 transitions, 1390 flow
[2024-06-03 22:51:23,984 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 1349 flow, removed 1 selfloop flow, removed 6 redundant places.
[2024-06-03 22:51:23,986 INFO  L231             Difference]: Finished difference. Result has 121 places, 131 transitions, 1042 flow
[2024-06-03 22:51:23,986 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-03 22:51:23,986 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-03 22:51:23,986 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 131 transitions, 1042 flow
[2024-06-03 22:51:23,987 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:23,987 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:23,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-03 22:51:23,987 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 22:51:23,987 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-03 22:51:23,987 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:23,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -425625132, now seen corresponding path program 4 times
[2024-06-03 22:51:23,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:23,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940849954]
[2024-06-03 22:51:23,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:23,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:24,009 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:34,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:34,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:34,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940849954]
[2024-06-03 22:51:34,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940849954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:34,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:34,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:51:34,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637374298]
[2024-06-03 22:51:34,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:34,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:51:34,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:34,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:51:34,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:51:34,196 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:51:34,200 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-03 22:51:34,200 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:34,200 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:51:34,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:35,247 INFO  L124   PetriNetUnfolderBase]: 1569/2450 cut-off events.
[2024-06-03 22:51:35,247 INFO  L125   PetriNetUnfolderBase]: For 96074/96074 co-relation queries the response was YES.
[2024-06-03 22:51:35,255 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-03 22:51:35,261 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 134 selfloop transitions, 29 changer transitions 0/168 dead transitions.
[2024-06-03 22:51:35,261 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 1510 flow
[2024-06-03 22:51:35,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:51:35,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:51:35,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-03 22:51:35,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-03 22:51:35,264 INFO  L175             Difference]: Start difference. First operand has 121 places, 131 transitions, 1042 flow. Second operand 10 states and 176 transitions.
[2024-06-03 22:51:35,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 1510 flow
[2024-06-03 22:51:35,315 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 168 transitions, 1411 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 22:51:35,317 INFO  L231             Difference]: Finished difference. Result has 125 places, 133 transitions, 1066 flow
[2024-06-03 22:51:35,317 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-03 22:51:35,317 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-03 22:51:35,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 133 transitions, 1066 flow
[2024-06-03 22:51:35,317 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:35,317 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:35,317 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:35,317 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 22:51:35,318 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:51:35,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:35,318 INFO  L85        PathProgramCache]: Analyzing trace with hash -329922417, now seen corresponding path program 1 times
[2024-06-03 22:51:35,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:35,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902353716]
[2024-06-03 22:51:35,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:35,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:35,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:42,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:42,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:42,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902353716]
[2024-06-03 22:51:42,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902353716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:42,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:42,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:51:42,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649159144]
[2024-06-03 22:51:42,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:42,936 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:51:42,936 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:42,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:51:42,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:51:43,076 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:51:43,077 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-03 22:51:43,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:43,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:51:43,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:43,844 INFO  L124   PetriNetUnfolderBase]: 1579/2459 cut-off events.
[2024-06-03 22:51:43,844 INFO  L125   PetriNetUnfolderBase]: For 100675/100675 co-relation queries the response was YES.
[2024-06-03 22:51:43,853 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-03 22:51:43,861 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 134 selfloop transitions, 17 changer transitions 0/156 dead transitions.
[2024-06-03 22:51:43,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 156 transitions, 1465 flow
[2024-06-03 22:51:43,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:51:43,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:51:43,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-03 22:51:43,862 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-03 22:51:43,862 INFO  L175             Difference]: Start difference. First operand has 125 places, 133 transitions, 1066 flow. Second operand 7 states and 121 transitions.
[2024-06-03 22:51:43,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 156 transitions, 1465 flow
[2024-06-03 22:51:43,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 156 transitions, 1360 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-03 22:51:43,911 INFO  L231             Difference]: Finished difference. Result has 125 places, 139 transitions, 1068 flow
[2024-06-03 22:51:43,912 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-03 22:51:43,912 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 82 predicate places.
[2024-06-03 22:51:43,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 139 transitions, 1068 flow
[2024-06-03 22:51:43,912 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:43,912 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:43,912 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:43,912 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 22:51:43,912 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-03 22:51:43,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:43,913 INFO  L85        PathProgramCache]: Analyzing trace with hash -329802447, now seen corresponding path program 2 times
[2024-06-03 22:51:43,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:43,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716968816]
[2024-06-03 22:51:43,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:43,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:43,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:51:51,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:51:51,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:51:51,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716968816]
[2024-06-03 22:51:51,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716968816] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:51:51,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:51:51,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:51:51,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745247138]
[2024-06-03 22:51:51,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:51:51,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:51:51,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:51:51,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:51:51,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:51:51,978 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:51:51,979 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-03 22:51:51,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:51:51,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:51:51,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:51:52,743 INFO  L124   PetriNetUnfolderBase]: 1597/2484 cut-off events.
[2024-06-03 22:51:52,743 INFO  L125   PetriNetUnfolderBase]: For 106458/106458 co-relation queries the response was YES.
[2024-06-03 22:51:52,753 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-03 22:51:52,762 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 132 selfloop transitions, 24 changer transitions 0/161 dead transitions.
[2024-06-03 22:51:52,762 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1584 flow
[2024-06-03 22:51:52,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:51:52,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:51:52,763 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-03 22:51:52,763 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41496598639455784
[2024-06-03 22:51:52,763 INFO  L175             Difference]: Start difference. First operand has 125 places, 139 transitions, 1068 flow. Second operand 7 states and 122 transitions.
[2024-06-03 22:51:52,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1584 flow
[2024-06-03 22:51:52,823 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 161 transitions, 1532 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-03 22:51:52,825 INFO  L231             Difference]: Finished difference. Result has 129 places, 145 transitions, 1168 flow
[2024-06-03 22:51:52,825 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-03 22:51:52,825 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 86 predicate places.
[2024-06-03 22:51:52,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 145 transitions, 1168 flow
[2024-06-03 22:51:52,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:51:52,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:51:52,826 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:51:52,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 22:51:52,826 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-03 22:51:52,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:51:52,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -329802261, now seen corresponding path program 1 times
[2024-06-03 22:51:52,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:51:52,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557168656]
[2024-06-03 22:51:52,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:51:52,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:51:52,864 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:00,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:52:00,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:00,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557168656]
[2024-06-03 22:52:00,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557168656] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:00,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:00,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:52:00,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479765983]
[2024-06-03 22:52:00,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:00,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:52:00,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:00,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:52:00,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:52:00,481 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:52:00,481 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-03 22:52:00,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:00,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:52:00,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:01,318 INFO  L124   PetriNetUnfolderBase]: 1625/2525 cut-off events.
[2024-06-03 22:52:01,318 INFO  L125   PetriNetUnfolderBase]: For 114453/114453 co-relation queries the response was YES.
[2024-06-03 22:52:01,327 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-03 22:52:01,335 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 146 selfloop transitions, 27 changer transitions 0/178 dead transitions.
[2024-06-03 22:52:01,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 178 transitions, 1758 flow
[2024-06-03 22:52:01,336 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:52:01,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:52:01,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions.
[2024-06-03 22:52:01,336 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41005291005291006
[2024-06-03 22:52:01,336 INFO  L175             Difference]: Start difference. First operand has 129 places, 145 transitions, 1168 flow. Second operand 9 states and 155 transitions.
[2024-06-03 22:52:01,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 178 transitions, 1758 flow
[2024-06-03 22:52:01,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 178 transitions, 1698 flow, removed 23 selfloop flow, removed 3 redundant places.
[2024-06-03 22:52:01,397 INFO  L231             Difference]: Finished difference. Result has 136 places, 153 transitions, 1300 flow
[2024-06-03 22:52:01,398 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-03 22:52:01,398 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 93 predicate places.
[2024-06-03 22:52:01,398 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 153 transitions, 1300 flow
[2024-06-03 22:52:01,398 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:52:01,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:01,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:01,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 22:52:01,398 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:52:01,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:01,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -152670741, now seen corresponding path program 2 times
[2024-06-03 22:52:01,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:01,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148574469]
[2024-06-03 22:52:01,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:01,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:01,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:09,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:52:09,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:09,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148574469]
[2024-06-03 22:52:09,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148574469] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:09,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:09,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:52:09,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249876629]
[2024-06-03 22:52:09,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:09,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:52:09,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:09,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:52:09,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:52:09,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:52:09,229 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-03 22:52:09,229 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:09,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:52:09,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:09,968 INFO  L124   PetriNetUnfolderBase]: 1637/2543 cut-off events.
[2024-06-03 22:52:09,968 INFO  L125   PetriNetUnfolderBase]: For 122039/122043 co-relation queries the response was YES.
[2024-06-03 22:52:09,978 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-03 22:52:09,986 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 145 selfloop transitions, 39 changer transitions 0/189 dead transitions.
[2024-06-03 22:52:09,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 189 transitions, 2072 flow
[2024-06-03 22:52:09,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:52:09,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:52:09,987 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-03 22:52:09,988 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-03 22:52:09,988 INFO  L175             Difference]: Start difference. First operand has 136 places, 153 transitions, 1300 flow. Second operand 8 states and 142 transitions.
[2024-06-03 22:52:09,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 189 transitions, 2072 flow
[2024-06-03 22:52:10,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 189 transitions, 1982 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-03 22:52:10,060 INFO  L231             Difference]: Finished difference. Result has 141 places, 167 transitions, 1516 flow
[2024-06-03 22:52:10,060 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-03 22:52:10,061 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 98 predicate places.
[2024-06-03 22:52:10,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 167 transitions, 1516 flow
[2024-06-03 22:52:10,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:52:10,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:10,061 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:10,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 22:52:10,062 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:52:10,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:10,062 INFO  L85        PathProgramCache]: Analyzing trace with hash -152670927, now seen corresponding path program 3 times
[2024-06-03 22:52:10,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:10,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493620743]
[2024-06-03 22:52:10,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:10,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:10,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:17,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:52:17,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:17,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493620743]
[2024-06-03 22:52:17,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493620743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:17,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:17,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:52:17,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528078321]
[2024-06-03 22:52:17,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:17,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:52:17,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:17,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:52:17,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:52:17,470 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:52:17,470 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-03 22:52:17,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:17,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:52:17,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:18,146 INFO  L124   PetriNetUnfolderBase]: 1631/2540 cut-off events.
[2024-06-03 22:52:18,146 INFO  L125   PetriNetUnfolderBase]: For 130305/130307 co-relation queries the response was YES.
[2024-06-03 22:52:18,156 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-03 22:52:18,164 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 147 selfloop transitions, 31 changer transitions 0/183 dead transitions.
[2024-06-03 22:52:18,164 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 183 transitions, 2042 flow
[2024-06-03 22:52:18,165 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:52:18,165 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:52:18,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-03 22:52:18,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41156462585034015
[2024-06-03 22:52:18,165 INFO  L175             Difference]: Start difference. First operand has 141 places, 167 transitions, 1516 flow. Second operand 7 states and 121 transitions.
[2024-06-03 22:52:18,165 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 183 transitions, 2042 flow
[2024-06-03 22:52:18,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 183 transitions, 1928 flow, removed 48 selfloop flow, removed 3 redundant places.
[2024-06-03 22:52:18,262 INFO  L231             Difference]: Finished difference. Result has 145 places, 170 transitions, 1536 flow
[2024-06-03 22:52:18,262 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-03 22:52:18,262 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-03 22:52:18,263 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 170 transitions, 1536 flow
[2024-06-03 22:52:18,263 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:52:18,263 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:18,263 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:18,263 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 22:52:18,263 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-03 22:52:18,263 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:18,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -152433591, now seen corresponding path program 3 times
[2024-06-03 22:52:18,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:18,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269359597]
[2024-06-03 22:52:18,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:18,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:18,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:25,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-03 22:52:25,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:25,607 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269359597]
[2024-06-03 22:52:25,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269359597] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:25,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:25,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:52:25,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117604641]
[2024-06-03 22:52:25,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:25,607 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:52:25,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:25,608 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:52:25,608 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:52:25,726 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:52:25,726 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-03 22:52:25,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:25,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:52:25,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:26,557 INFO  L124   PetriNetUnfolderBase]: 1633/2544 cut-off events.
[2024-06-03 22:52:26,557 INFO  L125   PetriNetUnfolderBase]: For 133703/133707 co-relation queries the response was YES.
[2024-06-03 22:52:26,565 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-03 22:52:26,573 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 48 changer transitions 0/195 dead transitions.
[2024-06-03 22:52:26,573 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 195 transitions, 2124 flow
[2024-06-03 22:52:26,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:52:26,573 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:52:26,573 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-03 22:52:26,573 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-03 22:52:26,574 INFO  L175             Difference]: Start difference. First operand has 145 places, 170 transitions, 1536 flow. Second operand 8 states and 141 transitions.
[2024-06-03 22:52:26,574 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 195 transitions, 2124 flow
[2024-06-03 22:52:26,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 195 transitions, 2012 flow, removed 27 selfloop flow, removed 5 redundant places.
[2024-06-03 22:52:26,634 INFO  L231             Difference]: Finished difference. Result has 149 places, 177 transitions, 1645 flow
[2024-06-03 22:52:26,634 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-03 22:52:26,634 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 106 predicate places.
[2024-06-03 22:52:26,634 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 177 transitions, 1645 flow
[2024-06-03 22:52:26,634 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:52:26,634 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:26,635 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:26,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 22:52:26,635 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-03 22:52:26,635 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:26,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 1560567229, now seen corresponding path program 1 times
[2024-06-03 22:52:26,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:26,635 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330368539]
[2024-06-03 22:52:26,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:26,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:26,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:34,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:52:34,739 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:34,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330368539]
[2024-06-03 22:52:34,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330368539] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:34,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:34,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:52:34,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726392390]
[2024-06-03 22:52:34,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:34,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:52:34,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:34,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:52:34,740 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:52:34,879 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:52:34,880 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-03 22:52:34,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:34,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:52:34,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:35,603 INFO  L124   PetriNetUnfolderBase]: 1534/2443 cut-off events.
[2024-06-03 22:52:35,603 INFO  L125   PetriNetUnfolderBase]: For 145439/145459 co-relation queries the response was YES.
[2024-06-03 22:52:35,613 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-03 22:52:35,622 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 142 selfloop transitions, 36 changer transitions 0/201 dead transitions.
[2024-06-03 22:52:35,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 201 transitions, 2115 flow
[2024-06-03 22:52:35,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:52:35,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:52:35,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions.
[2024-06-03 22:52:35,624 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42328042328042326
[2024-06-03 22:52:35,624 INFO  L175             Difference]: Start difference. First operand has 149 places, 177 transitions, 1645 flow. Second operand 9 states and 160 transitions.
[2024-06-03 22:52:35,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 201 transitions, 2115 flow
[2024-06-03 22:52:35,716 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 201 transitions, 2021 flow, removed 24 selfloop flow, removed 4 redundant places.
[2024-06-03 22:52:35,718 INFO  L231             Difference]: Finished difference. Result has 154 places, 179 transitions, 1679 flow
[2024-06-03 22:52:35,718 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-03 22:52:35,718 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 111 predicate places.
[2024-06-03 22:52:35,718 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 179 transitions, 1679 flow
[2024-06-03 22:52:35,718 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-03 22:52:35,718 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:35,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:35,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 22:52:35,718 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:52:35,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:35,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 761509651, now seen corresponding path program 1 times
[2024-06-03 22:52:35,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:35,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280946]
[2024-06-03 22:52:35,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:35,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:35,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:46,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-03 22:52:46,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:46,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280946]
[2024-06-03 22:52:46,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280946] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:46,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:46,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:52:46,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716461766]
[2024-06-03 22:52:46,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:46,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:52:46,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:46,144 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:52:46,144 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:52:46,256 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:52:46,256 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-03 22:52:46,256 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:46,256 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:52:46,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:47,464 INFO  L124   PetriNetUnfolderBase]: 1833/2865 cut-off events.
[2024-06-03 22:52:47,464 INFO  L125   PetriNetUnfolderBase]: For 174390/174390 co-relation queries the response was YES.
[2024-06-03 22:52:47,475 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-03 22:52:47,484 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 203 selfloop transitions, 23 changer transitions 0/231 dead transitions.
[2024-06-03 22:52:47,484 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 231 transitions, 2511 flow
[2024-06-03 22:52:47,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:52:47,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:52:47,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-03 22:52:47,486 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-03 22:52:47,486 INFO  L175             Difference]: Start difference. First operand has 154 places, 179 transitions, 1679 flow. Second operand 10 states and 188 transitions.
[2024-06-03 22:52:47,486 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 231 transitions, 2511 flow
[2024-06-03 22:52:47,588 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 231 transitions, 2407 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-03 22:52:47,591 INFO  L231             Difference]: Finished difference. Result has 157 places, 181 transitions, 1705 flow
[2024-06-03 22:52:47,591 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-03 22:52:47,591 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places.
[2024-06-03 22:52:47,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 181 transitions, 1705 flow
[2024-06-03 22:52:47,591 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:52:47,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:47,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:47,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 22:52:47,592 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:52:47,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:47,592 INFO  L85        PathProgramCache]: Analyzing trace with hash 1766892781, now seen corresponding path program 2 times
[2024-06-03 22:52:47,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:47,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908489810]
[2024-06-03 22:52:47,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:47,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:47,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:52:57,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:52:57,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:52:57,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908489810]
[2024-06-03 22:52:57,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908489810] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:52:57,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:52:57,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:52:57,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356262087]
[2024-06-03 22:52:57,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:52:57,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:52:57,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:52:57,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:52:57,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:52:57,997 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:52:57,997 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-03 22:52:57,997 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:52:57,997 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:52:57,997 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:52:59,228 INFO  L124   PetriNetUnfolderBase]: 1891/2974 cut-off events.
[2024-06-03 22:52:59,229 INFO  L125   PetriNetUnfolderBase]: For 181958/181958 co-relation queries the response was YES.
[2024-06-03 22:52:59,239 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-03 22:52:59,247 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 189 selfloop transitions, 26 changer transitions 0/220 dead transitions.
[2024-06-03 22:52:59,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 220 transitions, 2453 flow
[2024-06-03 22:52:59,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:52:59,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:52:59,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-03 22:52:59,249 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46130952380952384
[2024-06-03 22:52:59,250 INFO  L175             Difference]: Start difference. First operand has 157 places, 181 transitions, 1705 flow. Second operand 8 states and 155 transitions.
[2024-06-03 22:52:59,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 220 transitions, 2453 flow
[2024-06-03 22:52:59,358 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 220 transitions, 2394 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-03 22:52:59,361 INFO  L231             Difference]: Finished difference. Result has 159 places, 182 transitions, 1744 flow
[2024-06-03 22:52:59,361 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-03 22:52:59,361 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 116 predicate places.
[2024-06-03 22:52:59,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 182 transitions, 1744 flow
[2024-06-03 22:52:59,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:52:59,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:52:59,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:52:59,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:52:59,361 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-03 22:52:59,361 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:52:59,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 1767040651, now seen corresponding path program 3 times
[2024-06-03 22:52:59,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:52:59,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636767204]
[2024-06-03 22:52:59,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:52:59,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:52:59,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:53:09,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:53:09,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:53:09,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636767204]
[2024-06-03 22:53:09,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636767204] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:53:09,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:53:09,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:53:09,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175384988]
[2024-06-03 22:53:09,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:53:09,644 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:53:09,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:53:09,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:53:09,644 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:53:09,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:53:09,831 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-03 22:53:09,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:53:09,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:53:09,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:53:10,916 INFO  L124   PetriNetUnfolderBase]: 1855/2918 cut-off events.
[2024-06-03 22:53:10,916 INFO  L125   PetriNetUnfolderBase]: For 178534/178534 co-relation queries the response was YES.
[2024-06-03 22:53:10,929 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-03 22:53:10,939 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 184 selfloop transitions, 25 changer transitions 0/214 dead transitions.
[2024-06-03 22:53:10,940 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 214 transitions, 2272 flow
[2024-06-03 22:53:10,941 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:53:10,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:53:10,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-03 22:53:10,942 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-03 22:53:10,942 INFO  L175             Difference]: Start difference. First operand has 159 places, 182 transitions, 1744 flow. Second operand 8 states and 150 transitions.
[2024-06-03 22:53:10,942 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 214 transitions, 2272 flow
[2024-06-03 22:53:11,054 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 2191 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-03 22:53:11,056 INFO  L231             Difference]: Finished difference. Result has 162 places, 182 transitions, 1723 flow
[2024-06-03 22:53:11,056 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-03 22:53:11,056 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-03 22:53:11,056 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 182 transitions, 1723 flow
[2024-06-03 22:53:11,057 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:53:11,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:53:11,057 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:53:11,057 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 22:53:11,057 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-03 22:53:11,057 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:53:11,057 INFO  L85        PathProgramCache]: Analyzing trace with hash -1331816821, now seen corresponding path program 4 times
[2024-06-03 22:53:11,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:53:11,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685389328]
[2024-06-03 22:53:11,058 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:53:11,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:53:11,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:53:21,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:53:21,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:53:21,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685389328]
[2024-06-03 22:53:21,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685389328] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:53:21,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:53:21,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:53:21,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651209427]
[2024-06-03 22:53:21,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:53:21,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:53:21,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:53:21,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:53:21,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:53:21,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:53:21,565 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-03 22:53:21,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:53:21,565 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:53:21,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:53:22,701 INFO  L124   PetriNetUnfolderBase]: 1930/3054 cut-off events.
[2024-06-03 22:53:22,701 INFO  L125   PetriNetUnfolderBase]: For 185409/185413 co-relation queries the response was YES.
[2024-06-03 22:53:22,714 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-03 22:53:22,723 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 166 selfloop transitions, 54 changer transitions 0/225 dead transitions.
[2024-06-03 22:53:22,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 225 transitions, 2341 flow
[2024-06-03 22:53:22,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:53:22,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:53:22,724 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions.
[2024-06-03 22:53:22,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4452380952380952
[2024-06-03 22:53:22,725 INFO  L175             Difference]: Start difference. First operand has 162 places, 182 transitions, 1723 flow. Second operand 10 states and 187 transitions.
[2024-06-03 22:53:22,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 225 transitions, 2341 flow
[2024-06-03 22:53:22,837 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 225 transitions, 2286 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-03 22:53:22,840 INFO  L231             Difference]: Finished difference. Result has 165 places, 183 transitions, 1825 flow
[2024-06-03 22:53:22,840 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-03 22:53:22,840 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 122 predicate places.
[2024-06-03 22:53:22,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 183 transitions, 1825 flow
[2024-06-03 22:53:22,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:53:22,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:53:22,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:53:22,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 22:53:22,840 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-03 22:53:22,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:53:22,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -836545993, now seen corresponding path program 5 times
[2024-06-03 22:53:22,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:53:22,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262455000]
[2024-06-03 22:53:22,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:53:22,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:53:22,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:53:33,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:53:33,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:53:33,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262455000]
[2024-06-03 22:53:33,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262455000] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:53:33,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:53:33,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:53:33,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300267680]
[2024-06-03 22:53:33,152 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:53:33,152 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:53:33,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:53:33,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:53:33,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:53:33,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:53:33,318 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-03 22:53:33,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:53:33,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:53:33,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:53:34,419 INFO  L124   PetriNetUnfolderBase]: 2005/3179 cut-off events.
[2024-06-03 22:53:34,419 INFO  L125   PetriNetUnfolderBase]: For 197798/197802 co-relation queries the response was YES.
[2024-06-03 22:53:34,434 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-03 22:53:34,444 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 169 selfloop transitions, 53 changer transitions 0/227 dead transitions.
[2024-06-03 22:53:34,445 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 227 transitions, 2453 flow
[2024-06-03 22:53:34,446 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:53:34,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:53:34,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions.
[2024-06-03 22:53:34,447 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-03 22:53:34,447 INFO  L175             Difference]: Start difference. First operand has 165 places, 183 transitions, 1825 flow. Second operand 10 states and 189 transitions.
[2024-06-03 22:53:34,447 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 227 transitions, 2453 flow
[2024-06-03 22:53:34,572 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 227 transitions, 2324 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-03 22:53:34,574 INFO  L231             Difference]: Finished difference. Result has 167 places, 184 transitions, 1853 flow
[2024-06-03 22:53:34,574 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-03 22:53:34,574 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places.
[2024-06-03 22:53:34,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 184 transitions, 1853 flow
[2024-06-03 22:53:34,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:53:34,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:53:34,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:53:34,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 22:53:34,575 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-03 22:53:34,575 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:53:34,575 INFO  L85        PathProgramCache]: Analyzing trace with hash 968980243, now seen corresponding path program 6 times
[2024-06-03 22:53:34,575 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:53:34,575 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294533469]
[2024-06-03 22:53:34,575 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:53:34,575 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:53:34,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:53:44,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:53:44,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:53:44,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294533469]
[2024-06-03 22:53:44,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294533469] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:53:44,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:53:44,909 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:53:44,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741910273]
[2024-06-03 22:53:44,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:53:44,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:53:44,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:53:44,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:53:44,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:53:45,088 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:53:45,088 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-03 22:53:45,088 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:53:45,088 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:53:45,088 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:53:46,262 INFO  L124   PetriNetUnfolderBase]: 2063/3273 cut-off events.
[2024-06-03 22:53:46,262 INFO  L125   PetriNetUnfolderBase]: For 203581/203583 co-relation queries the response was YES.
[2024-06-03 22:53:46,276 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-03 22:53:46,287 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 167 selfloop transitions, 55 changer transitions 0/227 dead transitions.
[2024-06-03 22:53:46,287 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 227 transitions, 2493 flow
[2024-06-03 22:53:46,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:53:46,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:53:46,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-03 22:53:46,289 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-03 22:53:46,289 INFO  L175             Difference]: Start difference. First operand has 167 places, 184 transitions, 1853 flow. Second operand 9 states and 176 transitions.
[2024-06-03 22:53:46,289 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 227 transitions, 2493 flow
[2024-06-03 22:53:46,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 227 transitions, 2364 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-06-03 22:53:46,487 INFO  L231             Difference]: Finished difference. Result has 168 places, 185 transitions, 1886 flow
[2024-06-03 22:53:46,487 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-03 22:53:46,487 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-03 22:53:46,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 185 transitions, 1886 flow
[2024-06-03 22:53:46,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:53:46,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:53:46,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:53:46,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 22:53:46,488 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-03 22:53:46,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:53:46,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 835107331, now seen corresponding path program 1 times
[2024-06-03 22:53:46,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:53:46,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079801888]
[2024-06-03 22:53:46,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:53:46,488 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:53:46,517 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:53:55,370 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:53:55,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:53:55,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079801888]
[2024-06-03 22:53:55,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079801888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:53:55,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:53:55,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:53:55,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547703390]
[2024-06-03 22:53:55,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:53:55,371 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:53:55,371 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:53:55,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:53:55,371 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:53:55,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:53:55,535 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-03 22:53:55,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:53:55,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:53:55,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:53:56,723 INFO  L124   PetriNetUnfolderBase]: 2104/3343 cut-off events.
[2024-06-03 22:53:56,723 INFO  L125   PetriNetUnfolderBase]: For 208726/208730 co-relation queries the response was YES.
[2024-06-03 22:53:56,737 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-03 22:53:56,747 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 167 selfloop transitions, 58 changer transitions 0/230 dead transitions.
[2024-06-03 22:53:56,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 230 transitions, 2536 flow
[2024-06-03 22:53:56,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:53:56,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:53:56,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-03 22:53:56,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-03 22:53:56,749 INFO  L175             Difference]: Start difference. First operand has 168 places, 185 transitions, 1886 flow. Second operand 10 states and 188 transitions.
[2024-06-03 22:53:56,750 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 230 transitions, 2536 flow
[2024-06-03 22:53:56,925 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 230 transitions, 2394 flow, removed 17 selfloop flow, removed 7 redundant places.
[2024-06-03 22:53:56,927 INFO  L231             Difference]: Finished difference. Result has 171 places, 186 transitions, 1914 flow
[2024-06-03 22:53:56,927 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-03 22:53:56,928 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 128 predicate places.
[2024-06-03 22:53:56,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 186 transitions, 1914 flow
[2024-06-03 22:53:56,928 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-03 22:53:56,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:53:56,928 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:53:56,928 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 22:53:56,928 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:53:56,928 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:53:56,928 INFO  L85        PathProgramCache]: Analyzing trace with hash 537348623, now seen corresponding path program 1 times
[2024-06-03 22:53:56,928 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:53:56,928 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229223094]
[2024-06-03 22:53:56,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:53:56,929 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:53:56,961 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:54:03,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:54:03,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:54:03,988 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229223094]
[2024-06-03 22:54:03,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229223094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:54:03,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:54:03,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:54:03,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156661241]
[2024-06-03 22:54:03,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:54:03,989 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:54:03,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:54:03,989 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:54:03,989 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:54:04,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:54:04,116 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-03 22:54:04,116 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:54:04,116 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:54:04,116 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:54:05,053 INFO  L124   PetriNetUnfolderBase]: 2109/3350 cut-off events.
[2024-06-03 22:54:05,053 INFO  L125   PetriNetUnfolderBase]: For 202642/202646 co-relation queries the response was YES.
[2024-06-03 22:54:05,071 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-03 22:54:05,081 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 184 selfloop transitions, 19 changer transitions 0/208 dead transitions.
[2024-06-03 22:54:05,081 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 208 transitions, 2423 flow
[2024-06-03 22:54:05,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:54:05,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:54:05,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-03 22:54:05,082 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-03 22:54:05,082 INFO  L175             Difference]: Start difference. First operand has 171 places, 186 transitions, 1914 flow. Second operand 7 states and 124 transitions.
[2024-06-03 22:54:05,082 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 208 transitions, 2423 flow
[2024-06-03 22:54:05,277 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 208 transitions, 2275 flow, removed 17 selfloop flow, removed 8 redundant places.
[2024-06-03 22:54:05,280 INFO  L231             Difference]: Finished difference. Result has 170 places, 189 transitions, 1871 flow
[2024-06-03 22:54:05,280 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-03 22:54:05,280 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 127 predicate places.
[2024-06-03 22:54:05,280 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 189 transitions, 1871 flow
[2024-06-03 22:54:05,281 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:54:05,281 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:54:05,281 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:54:05,281 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 22:54:05,281 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:54:05,281 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:54:05,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 543062543, now seen corresponding path program 2 times
[2024-06-03 22:54:05,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:54:05,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93511240]
[2024-06-03 22:54:05,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:54:05,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:54:05,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:54:12,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:54:12,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:54:12,543 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93511240]
[2024-06-03 22:54:12,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93511240] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:54:12,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:54:12,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:54:12,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646081404]
[2024-06-03 22:54:12,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:54:12,544 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:54:12,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:54:12,544 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:54:12,544 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:54:12,693 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:54:12,693 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-03 22:54:12,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:54:12,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:54:12,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:54:13,639 INFO  L124   PetriNetUnfolderBase]: 2122/3370 cut-off events.
[2024-06-03 22:54:13,639 INFO  L125   PetriNetUnfolderBase]: For 208190/208194 co-relation queries the response was YES.
[2024-06-03 22:54:13,654 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-03 22:54:13,663 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 181 selfloop transitions, 27 changer transitions 0/213 dead transitions.
[2024-06-03 22:54:13,663 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 213 transitions, 2548 flow
[2024-06-03 22:54:13,664 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:54:13,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:54:13,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-03 22:54:13,664 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-03 22:54:13,664 INFO  L175             Difference]: Start difference. First operand has 170 places, 189 transitions, 1871 flow. Second operand 7 states and 123 transitions.
[2024-06-03 22:54:13,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 213 transitions, 2548 flow
[2024-06-03 22:54:13,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 213 transitions, 2488 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-03 22:54:13,855 INFO  L231             Difference]: Finished difference. Result has 173 places, 196 transitions, 2018 flow
[2024-06-03 22:54:13,855 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-03 22:54:13,856 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places.
[2024-06-03 22:54:13,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 2018 flow
[2024-06-03 22:54:13,856 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:54:13,856 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:54:13,856 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:54:13,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 22:54:13,856 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-03 22:54:13,857 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:54:13,857 INFO  L85        PathProgramCache]: Analyzing trace with hash -110026731, now seen corresponding path program 7 times
[2024-06-03 22:54:13,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:54:13,857 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221615545]
[2024-06-03 22:54:13,857 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:54:13,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:54:13,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:54:24,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:54:24,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:54:24,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221615545]
[2024-06-03 22:54:24,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221615545] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:54:24,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:54:24,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:54:24,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023507635]
[2024-06-03 22:54:24,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:54:24,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:54:24,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:54:24,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:54:24,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:54:24,267 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:54:24,268 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-03 22:54:24,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:54:24,268 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:54:24,268 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:54:25,535 INFO  L124   PetriNetUnfolderBase]: 2197/3504 cut-off events.
[2024-06-03 22:54:25,535 INFO  L125   PetriNetUnfolderBase]: For 237663/237663 co-relation queries the response was YES.
[2024-06-03 22:54:25,551 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-03 22:54:25,559 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 185 selfloop transitions, 54 changer transitions 0/244 dead transitions.
[2024-06-03 22:54:25,559 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 244 transitions, 2696 flow
[2024-06-03 22:54:25,561 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:54:25,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:54:25,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions.
[2024-06-03 22:54:25,561 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-03 22:54:25,561 INFO  L175             Difference]: Start difference. First operand has 173 places, 196 transitions, 2018 flow. Second operand 11 states and 204 transitions.
[2024-06-03 22:54:25,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 244 transitions, 2696 flow
[2024-06-03 22:54:25,739 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 244 transitions, 2632 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-03 22:54:25,741 INFO  L231             Difference]: Finished difference. Result has 180 places, 197 transitions, 2119 flow
[2024-06-03 22:54:25,741 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-03 22:54:25,741 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 137 predicate places.
[2024-06-03 22:54:25,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 197 transitions, 2119 flow
[2024-06-03 22:54:25,742 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:54:25,742 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:54:25,742 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:54:25,742 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 22:54:25,742 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-03 22:54:25,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:54:25,742 INFO  L85        PathProgramCache]: Analyzing trace with hash -588097909, now seen corresponding path program 8 times
[2024-06-03 22:54:25,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:54:25,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146932053]
[2024-06-03 22:54:25,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:54:25,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:54:25,763 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:54:36,033 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:54:36,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:54:36,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146932053]
[2024-06-03 22:54:36,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146932053] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:54:36,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:54:36,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:54:36,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725660126]
[2024-06-03 22:54:36,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:54:36,034 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:54:36,034 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:54:36,035 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:54:36,035 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:54:36,153 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:54:36,153 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-03 22:54:36,153 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:54:36,153 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:54:36,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:54:37,413 INFO  L124   PetriNetUnfolderBase]: 2272/3629 cut-off events.
[2024-06-03 22:54:37,414 INFO  L125   PetriNetUnfolderBase]: For 253310/253310 co-relation queries the response was YES.
[2024-06-03 22:54:37,432 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-03 22:54:37,443 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 182 selfloop transitions, 57 changer transitions 0/244 dead transitions.
[2024-06-03 22:54:37,443 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 244 transitions, 2795 flow
[2024-06-03 22:54:37,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:54:37,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:54:37,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 200 transitions.
[2024-06-03 22:54:37,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329004329004329
[2024-06-03 22:54:37,445 INFO  L175             Difference]: Start difference. First operand has 180 places, 197 transitions, 2119 flow. Second operand 11 states and 200 transitions.
[2024-06-03 22:54:37,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 244 transitions, 2795 flow
[2024-06-03 22:54:37,753 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 244 transitions, 2658 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-06-03 22:54:37,755 INFO  L231             Difference]: Finished difference. Result has 182 places, 198 transitions, 2155 flow
[2024-06-03 22:54:37,756 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-03 22:54:37,756 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-03 22:54:37,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 198 transitions, 2155 flow
[2024-06-03 22:54:37,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:54:37,756 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:54:37,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:54:37,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 22:54:37,757 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:54:37,757 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:54:37,758 INFO  L85        PathProgramCache]: Analyzing trace with hash -909427751, now seen corresponding path program 9 times
[2024-06-03 22:54:37,758 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:54:37,758 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679255711]
[2024-06-03 22:54:37,758 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:54:37,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:54:37,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:54:47,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-03 22:54:47,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:54:47,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679255711]
[2024-06-03 22:54:47,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679255711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:54:47,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:54:47,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:54:47,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597436037]
[2024-06-03 22:54:47,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:54:47,827 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:54:47,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:54:47,827 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:54:47,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:54:47,983 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:54:47,984 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-03 22:54:47,984 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:54:47,984 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:54:47,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:54:49,278 INFO  L124   PetriNetUnfolderBase]: 2347/3754 cut-off events.
[2024-06-03 22:54:49,279 INFO  L125   PetriNetUnfolderBase]: For 264595/264595 co-relation queries the response was YES.
[2024-06-03 22:54:49,298 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-03 22:54:49,308 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 187 selfloop transitions, 54 changer transitions 0/246 dead transitions.
[2024-06-03 22:54:49,309 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 246 transitions, 2841 flow
[2024-06-03 22:54:49,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:54:49,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:54:49,310 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 204 transitions.
[2024-06-03 22:54:49,311 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-03 22:54:49,311 INFO  L175             Difference]: Start difference. First operand has 182 places, 198 transitions, 2155 flow. Second operand 11 states and 204 transitions.
[2024-06-03 22:54:49,311 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 246 transitions, 2841 flow
[2024-06-03 22:54:49,582 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 246 transitions, 2696 flow, removed 17 selfloop flow, removed 9 redundant places.
[2024-06-03 22:54:49,585 INFO  L231             Difference]: Finished difference. Result has 184 places, 199 transitions, 2179 flow
[2024-06-03 22:54:49,585 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-03 22:54:49,585 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 141 predicate places.
[2024-06-03 22:54:49,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 199 transitions, 2179 flow
[2024-06-03 22:54:49,586 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:54:49,586 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:54:49,586 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:54:49,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 22:54:49,586 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:54:49,586 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:54:49,586 INFO  L85        PathProgramCache]: Analyzing trace with hash 1823565489, now seen corresponding path program 10 times
[2024-06-03 22:54:49,586 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:54:49,586 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786735186]
[2024-06-03 22:54:49,586 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:54:49,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:54:49,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:54:59,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:54:59,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:54:59,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786735186]
[2024-06-03 22:54:59,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786735186] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:54:59,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:54:59,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:54:59,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845529075]
[2024-06-03 22:54:59,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:54:59,812 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:54:59,812 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:54:59,812 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:54:59,812 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:55:00,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:55:00,010 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-03 22:55:00,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:55:00,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:55:00,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:55:01,321 INFO  L124   PetriNetUnfolderBase]: 2355/3774 cut-off events.
[2024-06-03 22:55:01,321 INFO  L125   PetriNetUnfolderBase]: For 258955/258955 co-relation queries the response was YES.
[2024-06-03 22:55:01,340 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-03 22:55:01,350 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 187 selfloop transitions, 58 changer transitions 0/250 dead transitions.
[2024-06-03 22:55:01,350 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 250 transitions, 2895 flow
[2024-06-03 22:55:01,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:55:01,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:55:01,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 206 transitions.
[2024-06-03 22:55:01,352 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4458874458874459
[2024-06-03 22:55:01,352 INFO  L175             Difference]: Start difference. First operand has 184 places, 199 transitions, 2179 flow. Second operand 11 states and 206 transitions.
[2024-06-03 22:55:01,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 250 transitions, 2895 flow
[2024-06-03 22:55:01,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 250 transitions, 2754 flow, removed 18 selfloop flow, removed 9 redundant places.
[2024-06-03 22:55:01,631 INFO  L231             Difference]: Finished difference. Result has 186 places, 200 transitions, 2216 flow
[2024-06-03 22:55:01,632 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-03 22:55:01,632 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-03 22:55:01,632 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 200 transitions, 2216 flow
[2024-06-03 22:55:01,632 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:55:01,632 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:55:01,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:55:01,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 22:55:01,633 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:55:01,633 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:55:01,633 INFO  L85        PathProgramCache]: Analyzing trace with hash 1829290941, now seen corresponding path program 2 times
[2024-06-03 22:55:01,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:55:01,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589418808]
[2024-06-03 22:55:01,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:55:01,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:55:01,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:55:11,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:55:11,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:55:11,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589418808]
[2024-06-03 22:55:11,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589418808] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:55:11,203 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:55:11,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:55:11,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277641367]
[2024-06-03 22:55:11,203 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:55:11,203 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:55:11,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:55:11,204 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:55:11,204 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:55:11,431 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:55:11,431 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-03 22:55:11,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:55:11,431 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:55:11,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:55:12,708 INFO  L124   PetriNetUnfolderBase]: 2396/3850 cut-off events.
[2024-06-03 22:55:12,708 INFO  L125   PetriNetUnfolderBase]: For 262502/262502 co-relation queries the response was YES.
[2024-06-03 22:55:12,729 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-03 22:55:12,741 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 188 selfloop transitions, 57 changer transitions 0/250 dead transitions.
[2024-06-03 22:55:12,741 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 250 transitions, 2930 flow
[2024-06-03 22:55:12,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:55:12,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:55:12,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions.
[2024-06-03 22:55:12,743 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44372294372294374
[2024-06-03 22:55:12,743 INFO  L175             Difference]: Start difference. First operand has 186 places, 200 transitions, 2216 flow. Second operand 11 states and 205 transitions.
[2024-06-03 22:55:12,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 250 transitions, 2930 flow
[2024-06-03 22:55:13,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 250 transitions, 2772 flow, removed 22 selfloop flow, removed 9 redundant places.
[2024-06-03 22:55:13,014 INFO  L231             Difference]: Finished difference. Result has 188 places, 201 transitions, 2236 flow
[2024-06-03 22:55:13,014 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-03 22:55:13,014 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places.
[2024-06-03 22:55:13,014 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 201 transitions, 2236 flow
[2024-06-03 22:55:13,014 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-03 22:55:13,014 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:55:13,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:55:13,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 22:55:13,014 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-03 22:55:13,015 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:55:13,015 INFO  L85        PathProgramCache]: Analyzing trace with hash 615002759, now seen corresponding path program 3 times
[2024-06-03 22:55:13,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:55:13,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737345478]
[2024-06-03 22:55:13,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:55:13,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:55:13,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:55:22,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:55:22,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:55:22,347 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737345478]
[2024-06-03 22:55:22,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737345478] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:55:22,347 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:55:22,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:55:22,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752571247]
[2024-06-03 22:55:22,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:55:22,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:55:22,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:55:22,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:55:22,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:55:22,596 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:55:22,596 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-03 22:55:22,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:55:22,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:55:22,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:55:23,931 INFO  L124   PetriNetUnfolderBase]: 2437/3936 cut-off events.
[2024-06-03 22:55:23,931 INFO  L125   PetriNetUnfolderBase]: For 270635/270635 co-relation queries the response was YES.
[2024-06-03 22:55:23,951 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-03 22:55:23,961 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 176 selfloop transitions, 70 changer transitions 0/251 dead transitions.
[2024-06-03 22:55:23,961 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 251 transitions, 3060 flow
[2024-06-03 22:55:23,962 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:55:23,962 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:55:23,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 202 transitions.
[2024-06-03 22:55:23,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43722943722943725
[2024-06-03 22:55:23,963 INFO  L175             Difference]: Start difference. First operand has 188 places, 201 transitions, 2236 flow. Second operand 11 states and 202 transitions.
[2024-06-03 22:55:23,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 251 transitions, 3060 flow
[2024-06-03 22:55:24,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 251 transitions, 2904 flow, removed 22 selfloop flow, removed 9 redundant places.
[2024-06-03 22:55:24,250 INFO  L231             Difference]: Finished difference. Result has 190 places, 202 transitions, 2284 flow
[2024-06-03 22:55:24,250 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-03 22:55:24,250 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-03 22:55:24,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 202 transitions, 2284 flow
[2024-06-03 22:55:24,250 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-03 22:55:24,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:55:24,250 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:55:24,250 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 22:55:24,250 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-03 22:55:24,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:55:24,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -231771741, now seen corresponding path program 4 times
[2024-06-03 22:55:24,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:55:24,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737019193]
[2024-06-03 22:55:24,251 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:55:24,251 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:55:24,278 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:55:33,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:55:33,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:55:33,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737019193]
[2024-06-03 22:55:33,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737019193] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:55:33,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:55:33,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 22:55:33,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086436336]
[2024-06-03 22:55:33,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:55:33,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 22:55:33,250 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:55:33,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 22:55:33,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-03 22:55:33,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:55:33,490 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-03 22:55:33,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:55:33,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:55:33,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:55:34,820 INFO  L124   PetriNetUnfolderBase]: 2417/3904 cut-off events.
[2024-06-03 22:55:34,820 INFO  L125   PetriNetUnfolderBase]: For 262773/262773 co-relation queries the response was YES.
[2024-06-03 22:55:34,839 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-03 22:55:34,850 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 185 selfloop transitions, 59 changer transitions 0/249 dead transitions.
[2024-06-03 22:55:34,850 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 249 transitions, 2854 flow
[2024-06-03 22:55:34,851 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:55:34,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:55:34,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions.
[2024-06-03 22:55:34,852 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43506493506493504
[2024-06-03 22:55:34,852 INFO  L175             Difference]: Start difference. First operand has 190 places, 202 transitions, 2284 flow. Second operand 11 states and 201 transitions.
[2024-06-03 22:55:34,852 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 249 transitions, 2854 flow
[2024-06-03 22:55:35,179 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 249 transitions, 2682 flow, removed 32 selfloop flow, removed 8 redundant places.
[2024-06-03 22:55:35,182 INFO  L231             Difference]: Finished difference. Result has 192 places, 201 transitions, 2152 flow
[2024-06-03 22:55:35,182 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-03 22:55:35,182 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places.
[2024-06-03 22:55:35,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 201 transitions, 2152 flow
[2024-06-03 22:55:35,182 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-03 22:55:35,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:55:35,182 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:55:35,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 22:55:35,182 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:55:35,183 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:55:35,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -1448592409, now seen corresponding path program 3 times
[2024-06-03 22:55:35,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:55:35,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695848476]
[2024-06-03 22:55:35,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:55:35,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:55:35,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:55:42,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:55:42,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:55:42,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695848476]
[2024-06-03 22:55:42,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695848476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:55:42,414 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:55:42,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:55:42,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522158596]
[2024-06-03 22:55:42,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:55:42,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:55:42,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:55:42,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:55:42,414 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:55:42,510 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:55:42,510 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-03 22:55:42,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:55:42,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:55:42,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:55:43,658 INFO  L124   PetriNetUnfolderBase]: 2414/3900 cut-off events.
[2024-06-03 22:55:43,658 INFO  L125   PetriNetUnfolderBase]: For 250481/250481 co-relation queries the response was YES.
[2024-06-03 22:55:43,677 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-03 22:55:43,687 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 203 selfloop transitions, 20 changer transitions 0/228 dead transitions.
[2024-06-03 22:55:43,687 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 228 transitions, 2666 flow
[2024-06-03 22:55:43,687 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:55:43,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:55:43,687 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-03 22:55:43,687 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 22:55:43,688 INFO  L175             Difference]: Start difference. First operand has 192 places, 201 transitions, 2152 flow. Second operand 9 states and 153 transitions.
[2024-06-03 22:55:43,688 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 228 transitions, 2666 flow
[2024-06-03 22:55:43,936 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 228 transitions, 2434 flow, removed 30 selfloop flow, removed 12 redundant places.
[2024-06-03 22:55:43,939 INFO  L231             Difference]: Finished difference. Result has 189 places, 201 transitions, 1966 flow
[2024-06-03 22:55:43,939 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-03 22:55:43,939 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-03 22:55:43,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 201 transitions, 1966 flow
[2024-06-03 22:55:43,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:55:43,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:55:43,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:55:43,940 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 22:55:43,940 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:55:43,940 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:55:43,940 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633949169, now seen corresponding path program 4 times
[2024-06-03 22:55:43,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:55:43,940 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343163762]
[2024-06-03 22:55:43,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:55:43,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:55:43,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:55:51,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:55:51,089 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:55:51,089 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343163762]
[2024-06-03 22:55:51,089 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343163762] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:55:51,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:55:51,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:55:51,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331554528]
[2024-06-03 22:55:51,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:55:51,090 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:55:51,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:55:51,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:55:51,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:55:51,219 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:55:51,219 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-03 22:55:51,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:55:51,219 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:55:51,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:55:52,283 INFO  L124   PetriNetUnfolderBase]: 2406/3889 cut-off events.
[2024-06-03 22:55:52,283 INFO  L125   PetriNetUnfolderBase]: For 252415/252415 co-relation queries the response was YES.
[2024-06-03 22:55:52,303 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-03 22:55:52,314 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 189 selfloop transitions, 31 changer transitions 0/225 dead transitions.
[2024-06-03 22:55:52,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 225 transitions, 2466 flow
[2024-06-03 22:55:52,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:55:52,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:55:52,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions.
[2024-06-03 22:55:52,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-03 22:55:52,315 INFO  L175             Difference]: Start difference. First operand has 189 places, 201 transitions, 1966 flow. Second operand 9 states and 153 transitions.
[2024-06-03 22:55:52,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 225 transitions, 2466 flow
[2024-06-03 22:55:52,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 225 transitions, 2400 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 22:55:52,617 INFO  L231             Difference]: Finished difference. Result has 191 places, 201 transitions, 1970 flow
[2024-06-03 22:55:52,617 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-03 22:55:52,617 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-03 22:55:52,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 201 transitions, 1970 flow
[2024-06-03 22:55:52,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:55:52,618 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:55:52,618 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:55:52,618 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-03 22:55:52,618 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:55:52,618 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:55:52,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -444505585, now seen corresponding path program 5 times
[2024-06-03 22:55:52,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:55:52,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145823953]
[2024-06-03 22:55:52,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:55:52,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:55:52,651 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:55:59,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:55:59,932 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:55:59,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145823953]
[2024-06-03 22:55:59,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145823953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:55:59,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:55:59,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:55:59,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606923706]
[2024-06-03 22:55:59,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:55:59,933 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:55:59,934 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:55:59,934 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:55:59,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:56:00,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:56:00,054 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-03 22:56:00,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:00,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:56:00,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:01,131 INFO  L124   PetriNetUnfolderBase]: 2416/3906 cut-off events.
[2024-06-03 22:56:01,131 INFO  L125   PetriNetUnfolderBase]: For 260591/260595 co-relation queries the response was YES.
[2024-06-03 22:56:01,151 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-03 22:56:01,161 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 160 selfloop transitions, 58 changer transitions 0/223 dead transitions.
[2024-06-03 22:56:01,161 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 223 transitions, 2628 flow
[2024-06-03 22:56:01,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:56:01,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:56:01,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-03 22:56:01,162 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-03 22:56:01,163 INFO  L175             Difference]: Start difference. First operand has 191 places, 201 transitions, 1970 flow. Second operand 8 states and 140 transitions.
[2024-06-03 22:56:01,163 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 223 transitions, 2628 flow
[2024-06-03 22:56:01,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 223 transitions, 2538 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-03 22:56:01,425 INFO  L231             Difference]: Finished difference. Result has 191 places, 205 transitions, 2063 flow
[2024-06-03 22:56:01,425 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-03 22:56:01,425 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 148 predicate places.
[2024-06-03 22:56:01,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 205 transitions, 2063 flow
[2024-06-03 22:56:01,425 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:56:01,425 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:01,425 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:01,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-03 22:56:01,426 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-03 22:56:01,426 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:01,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -437839345, now seen corresponding path program 6 times
[2024-06-03 22:56:01,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:01,426 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408124832]
[2024-06-03 22:56:01,426 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:01,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:01,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:56:08,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:56:08,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:56:08,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408124832]
[2024-06-03 22:56:08,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408124832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:56:08,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:56:08,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:56:08,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652718440]
[2024-06-03 22:56:08,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:56:08,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:56:08,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:56:08,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:56:08,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:56:08,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:56:08,828 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-03 22:56:08,828 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:08,828 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:56:08,828 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:09,900 INFO  L124   PetriNetUnfolderBase]: 2408/3891 cut-off events.
[2024-06-03 22:56:09,901 INFO  L125   PetriNetUnfolderBase]: For 265254/265258 co-relation queries the response was YES.
[2024-06-03 22:56:09,920 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-03 22:56:09,928 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 163 selfloop transitions, 54 changer transitions 0/222 dead transitions.
[2024-06-03 22:56:09,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 222 transitions, 2539 flow
[2024-06-03 22:56:09,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:56:09,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:56:09,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-03 22:56:09,929 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41369047619047616
[2024-06-03 22:56:09,930 INFO  L175             Difference]: Start difference. First operand has 191 places, 205 transitions, 2063 flow. Second operand 8 states and 139 transitions.
[2024-06-03 22:56:09,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 222 transitions, 2539 flow
[2024-06-03 22:56:10,224 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 222 transitions, 2333 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-03 22:56:10,226 INFO  L231             Difference]: Finished difference. Result has 192 places, 205 transitions, 1974 flow
[2024-06-03 22:56:10,226 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-03 22:56:10,226 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places.
[2024-06-03 22:56:10,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 205 transitions, 1974 flow
[2024-06-03 22:56:10,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 22:56:10,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:10,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:10,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-03 22:56:10,227 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-03 22:56:10,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:10,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132453021, now seen corresponding path program 1 times
[2024-06-03 22:56:10,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:10,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424949000]
[2024-06-03 22:56:10,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:10,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:10,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:56:17,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:56:17,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:56:17,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424949000]
[2024-06-03 22:56:17,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424949000] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:56:17,918 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:56:17,918 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:56:17,918 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043817135]
[2024-06-03 22:56:17,918 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:56:17,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:56:17,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:56:17,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:56:17,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:56:18,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:56:18,030 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-03 22:56:18,030 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:18,030 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:56:18,030 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:19,071 INFO  L124   PetriNetUnfolderBase]: 2275/3720 cut-off events.
[2024-06-03 22:56:19,071 INFO  L125   PetriNetUnfolderBase]: For 276408/276428 co-relation queries the response was YES.
[2024-06-03 22:56:19,090 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-03 22:56:19,099 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 166 selfloop transitions, 31 changer transitions 0/225 dead transitions.
[2024-06-03 22:56:19,099 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 225 transitions, 2446 flow
[2024-06-03 22:56:19,100 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:56:19,100 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:56:19,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-03 22:56:19,101 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41964285714285715
[2024-06-03 22:56:19,101 INFO  L175             Difference]: Start difference. First operand has 192 places, 205 transitions, 1974 flow. Second operand 8 states and 141 transitions.
[2024-06-03 22:56:19,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 225 transitions, 2446 flow
[2024-06-03 22:56:19,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 225 transitions, 2324 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-03 22:56:19,392 INFO  L231             Difference]: Finished difference. Result has 193 places, 208 transitions, 1963 flow
[2024-06-03 22:56:19,392 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-03 22:56:19,392 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 150 predicate places.
[2024-06-03 22:56:19,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 208 transitions, 1963 flow
[2024-06-03 22:56:19,392 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-03 22:56:19,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:19,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:19,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-03 22:56:19,393 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-03 22:56:19,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:19,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -430212849, now seen corresponding path program 2 times
[2024-06-03 22:56:19,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:19,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504615535]
[2024-06-03 22:56:19,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:19,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:19,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:56:27,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-03 22:56:27,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:56:27,733 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504615535]
[2024-06-03 22:56:27,733 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504615535] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:56:27,733 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:56:27,733 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 22:56:27,733 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255698932]
[2024-06-03 22:56:27,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:56:27,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 22:56:27,734 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:56:27,734 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 22:56:27,734 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 22:56:27,823 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-03 22:56:27,823 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-03 22:56:27,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:27,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-03 22:56:27,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:28,886 INFO  L124   PetriNetUnfolderBase]: 2268/3712 cut-off events.
[2024-06-03 22:56:28,886 INFO  L125   PetriNetUnfolderBase]: For 280568/280596 co-relation queries the response was YES.
[2024-06-03 22:56:28,906 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-03 22:56:28,917 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 163 selfloop transitions, 38 changer transitions 0/229 dead transitions.
[2024-06-03 22:56:28,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 229 transitions, 2451 flow
[2024-06-03 22:56:28,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:56:28,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:56:28,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-03 22:56:28,918 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4126984126984127
[2024-06-03 22:56:28,918 INFO  L175             Difference]: Start difference. First operand has 193 places, 208 transitions, 1963 flow. Second operand 9 states and 156 transitions.
[2024-06-03 22:56:28,918 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 229 transitions, 2451 flow
[2024-06-03 22:56:29,244 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 229 transitions, 2364 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 22:56:29,246 INFO  L231             Difference]: Finished difference. Result has 196 places, 211 transitions, 2011 flow
[2024-06-03 22:56:29,246 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-03 22:56:29,246 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places.
[2024-06-03 22:56:29,246 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 211 transitions, 2011 flow
[2024-06-03 22:56:29,247 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-03 22:56:29,247 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:29,247 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:29,247 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-03 22:56:29,247 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-03 22:56:29,247 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:29,247 INFO  L85        PathProgramCache]: Analyzing trace with hash -1637749521, now seen corresponding path program 1 times
[2024-06-03 22:56:29,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:29,247 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786705099]
[2024-06-03 22:56:29,247 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:29,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:29,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:56:36,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:56:36,569 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:56:36,569 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786705099]
[2024-06-03 22:56:36,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786705099] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:56:36,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:56:36,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:56:36,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520475364]
[2024-06-03 22:56:36,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:56:36,569 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:56:36,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:56:36,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:56:36,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:56:36,681 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:56:36,681 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-03 22:56:36,681 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:36,681 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:56:36,681 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:37,766 INFO  L124   PetriNetUnfolderBase]: 2409/3896 cut-off events.
[2024-06-03 22:56:37,766 INFO  L125   PetriNetUnfolderBase]: For 281346/281346 co-relation queries the response was YES.
[2024-06-03 22:56:37,787 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-03 22:56:37,796 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 19 changer transitions 0/228 dead transitions.
[2024-06-03 22:56:37,796 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 228 transitions, 2501 flow
[2024-06-03 22:56:37,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 22:56:37,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 22:56:37,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-03 22:56:37,798 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40816326530612246
[2024-06-03 22:56:37,798 INFO  L175             Difference]: Start difference. First operand has 196 places, 211 transitions, 2011 flow. Second operand 7 states and 120 transitions.
[2024-06-03 22:56:37,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 228 transitions, 2501 flow
[2024-06-03 22:56:38,090 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 228 transitions, 2372 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-03 22:56:38,093 INFO  L231             Difference]: Finished difference. Result has 196 places, 211 transitions, 1930 flow
[2024-06-03 22:56:38,093 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-03 22:56:38,093 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 153 predicate places.
[2024-06-03 22:56:38,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 211 transitions, 1930 flow
[2024-06-03 22:56:38,093 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-03 22:56:38,093 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:38,093 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:38,093 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-03 22:56:38,094 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-03 22:56:38,094 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:38,094 INFO  L85        PathProgramCache]: Analyzing trace with hash -1439922236, now seen corresponding path program 1 times
[2024-06-03 22:56:38,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:38,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449010850]
[2024-06-03 22:56:38,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:38,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:38,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:56:45,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:56:45,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:56:45,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449010850]
[2024-06-03 22:56:45,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449010850] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:56:45,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:56:45,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:56:45,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772751541]
[2024-06-03 22:56:45,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:56:45,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:56:45,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:56:45,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:56:45,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:56:45,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:56:45,703 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-03 22:56:45,703 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:45,703 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:56:45,703 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:46,912 INFO  L124   PetriNetUnfolderBase]: 2465/3976 cut-off events.
[2024-06-03 22:56:46,912 INFO  L125   PetriNetUnfolderBase]: For 295075/295075 co-relation queries the response was YES.
[2024-06-03 22:56:46,932 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-03 22:56:46,942 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 207 selfloop transitions, 49 changer transitions 0/261 dead transitions.
[2024-06-03 22:56:46,942 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 261 transitions, 2829 flow
[2024-06-03 22:56:46,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:56:46,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:56:46,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions.
[2024-06-03 22:56:46,943 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41125541125541126
[2024-06-03 22:56:46,943 INFO  L175             Difference]: Start difference. First operand has 196 places, 211 transitions, 1930 flow. Second operand 11 states and 190 transitions.
[2024-06-03 22:56:46,943 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 261 transitions, 2829 flow
[2024-06-03 22:56:47,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 261 transitions, 2783 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-03 22:56:47,269 INFO  L231             Difference]: Finished difference. Result has 203 places, 226 transitions, 2194 flow
[2024-06-03 22:56:47,270 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-03 22:56:47,270 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 160 predicate places.
[2024-06-03 22:56:47,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 226 transitions, 2194 flow
[2024-06-03 22:56:47,270 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-03 22:56:47,270 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:47,270 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:47,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-03 22:56:47,270 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-03 22:56:47,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:47,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -1436203166, now seen corresponding path program 2 times
[2024-06-03 22:56:47,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:47,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983080626]
[2024-06-03 22:56:47,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:47,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:47,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:56:54,511 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:56:54,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:56:54,512 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983080626]
[2024-06-03 22:56:54,512 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983080626] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:56:54,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:56:54,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:56:54,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622692385]
[2024-06-03 22:56:54,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:56:54,512 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:56:54,512 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:56:54,512 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:56:54,512 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:56:54,667 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:56:54,667 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-03 22:56:54,667 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:56:54,667 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:56:54,667 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:56:55,877 INFO  L124   PetriNetUnfolderBase]: 2641/4221 cut-off events.
[2024-06-03 22:56:55,877 INFO  L125   PetriNetUnfolderBase]: For 350277/350277 co-relation queries the response was YES.
[2024-06-03 22:56:55,899 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-03 22:56:55,910 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 204 selfloop transitions, 64 changer transitions 0/273 dead transitions.
[2024-06-03 22:56:55,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 273 transitions, 3374 flow
[2024-06-03 22:56:55,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:56:55,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:56:55,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions.
[2024-06-03 22:56:55,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 22:56:55,911 INFO  L175             Difference]: Start difference. First operand has 203 places, 226 transitions, 2194 flow. Second operand 10 states and 180 transitions.
[2024-06-03 22:56:55,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 273 transitions, 3374 flow
[2024-06-03 22:56:56,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 273 transitions, 3270 flow, removed 41 selfloop flow, removed 5 redundant places.
[2024-06-03 22:56:56,287 INFO  L231             Difference]: Finished difference. Result has 210 places, 239 transitions, 2490 flow
[2024-06-03 22:56:56,287 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-03 22:56:56,287 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-03 22:56:56,287 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 239 transitions, 2490 flow
[2024-06-03 22:56:56,287 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-03 22:56:56,287 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:56:56,287 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:56:56,288 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-03 22:56:56,288 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-03 22:56:56,288 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:56:56,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1633934506, now seen corresponding path program 3 times
[2024-06-03 22:56:56,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:56:56,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873157352]
[2024-06-03 22:56:56,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:56:56,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:56:56,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:57:03,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:57:03,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:57:03,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873157352]
[2024-06-03 22:57:03,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873157352] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:57:03,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:57:03,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:57:03,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333534091]
[2024-06-03 22:57:03,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:57:03,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:57:03,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:57:03,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:57:03,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:57:03,649 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:57:03,649 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-03 22:57:03,649 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:57:03,649 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:57:03,649 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:57:04,871 INFO  L124   PetriNetUnfolderBase]: 2689/4295 cut-off events.
[2024-06-03 22:57:04,871 INFO  L125   PetriNetUnfolderBase]: For 370249/370249 co-relation queries the response was YES.
[2024-06-03 22:57:04,897 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-03 22:57:04,910 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 200 selfloop transitions, 77 changer transitions 0/282 dead transitions.
[2024-06-03 22:57:04,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 282 transitions, 3642 flow
[2024-06-03 22:57:04,910 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:57:04,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:57:04,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-03 22:57:04,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-03 22:57:04,911 INFO  L175             Difference]: Start difference. First operand has 210 places, 239 transitions, 2490 flow. Second operand 10 states and 181 transitions.
[2024-06-03 22:57:04,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 282 transitions, 3642 flow
[2024-06-03 22:57:05,378 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 282 transitions, 3461 flow, removed 70 selfloop flow, removed 5 redundant places.
[2024-06-03 22:57:05,381 INFO  L231             Difference]: Finished difference. Result has 217 places, 250 transitions, 2775 flow
[2024-06-03 22:57:05,381 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-03 22:57:05,382 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-03 22:57:05,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 250 transitions, 2775 flow
[2024-06-03 22:57:05,382 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-03 22:57:05,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:57:05,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:57:05,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-03 22:57:05,382 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-03 22:57:05,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:57:05,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 926014845, now seen corresponding path program 1 times
[2024-06-03 22:57:05,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:57:05,382 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708098063]
[2024-06-03 22:57:05,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:57:05,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:57:05,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:57:13,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:57:13,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:57:13,571 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708098063]
[2024-06-03 22:57:13,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708098063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:57:13,572 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:57:13,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:57:13,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132859649]
[2024-06-03 22:57:13,572 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:57:13,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:57:13,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:57:13,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:57:13,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:57:13,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:57:13,663 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-03 22:57:13,663 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:57:13,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:57:13,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:57:14,934 INFO  L124   PetriNetUnfolderBase]: 2675/4285 cut-off events.
[2024-06-03 22:57:14,934 INFO  L125   PetriNetUnfolderBase]: For 361621/361621 co-relation queries the response was YES.
[2024-06-03 22:57:14,959 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-03 22:57:14,970 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 236 selfloop transitions, 37 changer transitions 0/278 dead transitions.
[2024-06-03 22:57:14,970 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 278 transitions, 3453 flow
[2024-06-03 22:57:14,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:57:14,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:57:14,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-03 22:57:14,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3976190476190476
[2024-06-03 22:57:14,972 INFO  L175             Difference]: Start difference. First operand has 217 places, 250 transitions, 2775 flow. Second operand 10 states and 167 transitions.
[2024-06-03 22:57:14,972 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 278 transitions, 3453 flow
[2024-06-03 22:57:15,457 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 278 transitions, 3344 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-06-03 22:57:15,460 INFO  L231             Difference]: Finished difference. Result has 222 places, 253 transitions, 2823 flow
[2024-06-03 22:57:15,461 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-03 22:57:15,461 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 179 predicate places.
[2024-06-03 22:57:15,461 INFO  L495      AbstractCegarLoop]: Abstraction has has 222 places, 253 transitions, 2823 flow
[2024-06-03 22:57:15,461 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-03 22:57:15,461 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:57:15,461 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:57:15,461 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-03 22:57:15,461 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-03 22:57:15,461 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:57:15,462 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132935195, now seen corresponding path program 2 times
[2024-06-03 22:57:15,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:57:15,462 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780901104]
[2024-06-03 22:57:15,462 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:57:15,462 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:57:15,497 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:57:23,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:57:23,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:57:23,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780901104]
[2024-06-03 22:57:23,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780901104] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:57:23,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:57:23,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:57:23,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680684374]
[2024-06-03 22:57:23,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:57:23,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:57:23,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:57:23,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:57:23,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:57:23,330 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:57:23,330 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-03 22:57:23,330 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:57:23,330 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:57:23,330 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:57:24,567 INFO  L124   PetriNetUnfolderBase]: 2741/4372 cut-off events.
[2024-06-03 22:57:24,567 INFO  L125   PetriNetUnfolderBase]: For 391187/391189 co-relation queries the response was YES.
[2024-06-03 22:57:24,592 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-03 22:57:24,606 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 172 selfloop transitions, 129 changer transitions 0/306 dead transitions.
[2024-06-03 22:57:24,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 306 transitions, 4421 flow
[2024-06-03 22:57:24,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:57:24,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:57:24,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-03 22:57:24,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-03 22:57:24,607 INFO  L175             Difference]: Start difference. First operand has 222 places, 253 transitions, 2823 flow. Second operand 9 states and 167 transitions.
[2024-06-03 22:57:24,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 306 transitions, 4421 flow
[2024-06-03 22:57:24,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 306 transitions, 4292 flow, removed 30 selfloop flow, removed 8 redundant places.
[2024-06-03 22:57:24,995 INFO  L231             Difference]: Finished difference. Result has 226 places, 282 transitions, 3659 flow
[2024-06-03 22:57:24,995 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-03 22:57:24,995 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-03 22:57:24,995 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 282 transitions, 3659 flow
[2024-06-03 22:57:24,996 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-03 22:57:24,996 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:57:24,996 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:57:24,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-03 22:57:24,996 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-03 22:57:24,996 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:57:24,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 1132668068, now seen corresponding path program 4 times
[2024-06-03 22:57:24,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:57:24,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180153932]
[2024-06-03 22:57:24,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:57:24,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:57:25,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:57:32,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:57:32,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:57:32,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180153932]
[2024-06-03 22:57:32,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180153932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:57:32,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:57:32,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:57:32,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201847400]
[2024-06-03 22:57:32,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:57:32,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:57:32,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:57:32,357 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:57:32,357 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:57:32,524 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:57:32,524 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-03 22:57:32,524 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:57:32,524 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:57:32,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:57:33,864 INFO  L124   PetriNetUnfolderBase]: 2853/4527 cut-off events.
[2024-06-03 22:57:33,864 INFO  L125   PetriNetUnfolderBase]: For 442766/442768 co-relation queries the response was YES.
[2024-06-03 22:57:33,891 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-03 22:57:33,906 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 181 selfloop transitions, 146 changer transitions 0/332 dead transitions.
[2024-06-03 22:57:33,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 332 transitions, 5300 flow
[2024-06-03 22:57:33,906 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:57:33,906 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:57:33,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 22:57:33,907 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:57:33,907 INFO  L175             Difference]: Start difference. First operand has 226 places, 282 transitions, 3659 flow. Second operand 9 states and 171 transitions.
[2024-06-03 22:57:33,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 332 transitions, 5300 flow
[2024-06-03 22:57:34,372 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 332 transitions, 5099 flow, removed 82 selfloop flow, removed 3 redundant places.
[2024-06-03 22:57:34,376 INFO  L231             Difference]: Finished difference. Result has 234 places, 304 transitions, 4345 flow
[2024-06-03 22:57:34,380 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-03 22:57:34,382 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places.
[2024-06-03 22:57:34,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 304 transitions, 4345 flow
[2024-06-03 22:57:34,382 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-03 22:57:34,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:57:34,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:57:34,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-03 22:57:34,382 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-03 22:57:34,382 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:57:34,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -430472815, now seen corresponding path program 3 times
[2024-06-03 22:57:34,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:57:34,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706121075]
[2024-06-03 22:57:34,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:57:34,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:57:34,418 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:57:42,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:57:42,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:57:42,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706121075]
[2024-06-03 22:57:42,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706121075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:57:42,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:57:42,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:57:42,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812102682]
[2024-06-03 22:57:42,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:57:42,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:57:42,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:57:42,116 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:57:42,116 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:57:42,250 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:57:42,250 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-03 22:57:42,250 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:57:42,250 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:57:42,250 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:57:43,635 INFO  L124   PetriNetUnfolderBase]: 2827/4501 cut-off events.
[2024-06-03 22:57:43,635 INFO  L125   PetriNetUnfolderBase]: For 438369/438371 co-relation queries the response was YES.
[2024-06-03 22:57:43,663 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-03 22:57:43,678 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 204 selfloop transitions, 119 changer transitions 0/328 dead transitions.
[2024-06-03 22:57:43,678 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 328 transitions, 5339 flow
[2024-06-03 22:57:43,679 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:57:43,679 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:57:43,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-03 22:57:43,679 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-03 22:57:43,679 INFO  L175             Difference]: Start difference. First operand has 234 places, 304 transitions, 4345 flow. Second operand 9 states and 167 transitions.
[2024-06-03 22:57:43,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 328 transitions, 5339 flow
[2024-06-03 22:57:44,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 328 transitions, 5060 flow, removed 121 selfloop flow, removed 3 redundant places.
[2024-06-03 22:57:44,167 INFO  L231             Difference]: Finished difference. Result has 240 places, 304 transitions, 4313 flow
[2024-06-03 22:57:44,167 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-03 22:57:44,167 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 197 predicate places.
[2024-06-03 22:57:44,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 304 transitions, 4313 flow
[2024-06-03 22:57:44,167 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-03 22:57:44,167 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:57:44,167 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:57:44,167 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-03 22:57:44,167 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-03 22:57:44,168 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:57:44,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -437830262, now seen corresponding path program 5 times
[2024-06-03 22:57:44,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:57:44,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394885477]
[2024-06-03 22:57:44,168 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:57:44,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:57:44,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:57:51,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:57:51,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:57:51,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394885477]
[2024-06-03 22:57:51,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394885477] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:57:51,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:57:51,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:57:51,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656690996]
[2024-06-03 22:57:51,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:57:51,493 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:57:51,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:57:51,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:57:51,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:57:51,602 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:57:51,602 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-03 22:57:51,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:57:51,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:57:51,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:57:52,978 INFO  L124   PetriNetUnfolderBase]: 2867/4557 cut-off events.
[2024-06-03 22:57:52,978 INFO  L125   PetriNetUnfolderBase]: For 446234/446236 co-relation queries the response was YES.
[2024-06-03 22:57:53,006 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-03 22:57:53,021 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 205 selfloop transitions, 133 changer transitions 0/343 dead transitions.
[2024-06-03 22:57:53,021 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 343 transitions, 5744 flow
[2024-06-03 22:57:53,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:57:53,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:57:53,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-03 22:57:53,023 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-03 22:57:53,023 INFO  L175             Difference]: Start difference. First operand has 240 places, 304 transitions, 4313 flow. Second operand 9 states and 170 transitions.
[2024-06-03 22:57:53,023 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 343 transitions, 5744 flow
[2024-06-03 22:57:53,516 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 343 transitions, 5486 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-03 22:57:53,520 INFO  L231             Difference]: Finished difference. Result has 245 places, 318 transitions, 4734 flow
[2024-06-03 22:57:53,520 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-03 22:57:53,520 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 202 predicate places.
[2024-06-03 22:57:53,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 318 transitions, 4734 flow
[2024-06-03 22:57:53,521 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-03 22:57:53,521 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:57:53,521 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:57:53,521 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-03 22:57:53,521 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-03 22:57:53,521 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:57:53,521 INFO  L85        PathProgramCache]: Analyzing trace with hash -437824682, now seen corresponding path program 6 times
[2024-06-03 22:57:53,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:57:53,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911479441]
[2024-06-03 22:57:53,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:57:53,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:57:53,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:58:00,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:58:00,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:58:00,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911479441]
[2024-06-03 22:58:00,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911479441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:58:00,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:58:00,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:58:00,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242642539]
[2024-06-03 22:58:00,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:58:00,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:58:00,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:58:00,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:58:00,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:58:01,050 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:58:01,051 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-03 22:58:01,051 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:58:01,051 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:58:01,051 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:58:02,415 INFO  L124   PetriNetUnfolderBase]: 2851/4541 cut-off events.
[2024-06-03 22:58:02,415 INFO  L125   PetriNetUnfolderBase]: For 449791/449793 co-relation queries the response was YES.
[2024-06-03 22:58:02,443 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-03 22:58:02,458 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 208 selfloop transitions, 130 changer transitions 0/343 dead transitions.
[2024-06-03 22:58:02,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 343 transitions, 5910 flow
[2024-06-03 22:58:02,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:58:02,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:58:02,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 22:58:02,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:58:02,459 INFO  L175             Difference]: Start difference. First operand has 245 places, 318 transitions, 4734 flow. Second operand 9 states and 171 transitions.
[2024-06-03 22:58:02,459 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 343 transitions, 5910 flow
[2024-06-03 22:58:03,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 343 transitions, 5612 flow, removed 85 selfloop flow, removed 4 redundant places.
[2024-06-03 22:58:03,108 INFO  L231             Difference]: Finished difference. Result has 250 places, 318 transitions, 4708 flow
[2024-06-03 22:58:03,108 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-03 22:58:03,108 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 207 predicate places.
[2024-06-03 22:58:03,108 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 318 transitions, 4708 flow
[2024-06-03 22:58:03,108 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-03 22:58:03,108 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:58:03,108 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:58:03,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-03 22:58:03,109 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-03 22:58:03,109 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:58:03,109 INFO  L85        PathProgramCache]: Analyzing trace with hash 1125316635, now seen corresponding path program 4 times
[2024-06-03 22:58:03,109 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:58:03,109 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171956321]
[2024-06-03 22:58:03,109 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:58:03,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:58:03,144 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:58:11,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:58:11,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:58:11,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171956321]
[2024-06-03 22:58:11,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171956321] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:58:11,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:58:11,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:58:11,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665543200]
[2024-06-03 22:58:11,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:58:11,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:58:11,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:58:11,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:58:11,194 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:58:11,350 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:58:11,351 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-03 22:58:11,351 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:58:11,351 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:58:11,351 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:58:12,675 INFO  L124   PetriNetUnfolderBase]: 2829/4502 cut-off events.
[2024-06-03 22:58:12,676 INFO  L125   PetriNetUnfolderBase]: For 440404/440406 co-relation queries the response was YES.
[2024-06-03 22:58:12,706 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-03 22:58:12,722 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 230 selfloop transitions, 107 changer transitions 0/342 dead transitions.
[2024-06-03 22:58:12,722 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 342 transitions, 5742 flow
[2024-06-03 22:58:12,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:58:12,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:58:12,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-03 22:58:12,723 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-03 22:58:12,723 INFO  L175             Difference]: Start difference. First operand has 250 places, 318 transitions, 4708 flow. Second operand 9 states and 167 transitions.
[2024-06-03 22:58:12,723 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 342 transitions, 5742 flow
[2024-06-03 22:58:13,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 342 transitions, 5315 flow, removed 85 selfloop flow, removed 7 redundant places.
[2024-06-03 22:58:13,392 INFO  L231             Difference]: Finished difference. Result has 252 places, 318 transitions, 4505 flow
[2024-06-03 22:58:13,392 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-03 22:58:13,392 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 209 predicate places.
[2024-06-03 22:58:13,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 318 transitions, 4505 flow
[2024-06-03 22:58:13,392 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-03 22:58:13,392 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:58:13,392 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-03 22:58:13,392 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-03 22:58:13,392 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-03 22:58:13,393 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:58:13,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -522180848, now seen corresponding path program 1 times
[2024-06-03 22:58:13,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:58:13,393 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015585658]
[2024-06-03 22:58:13,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:58:13,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:58:13,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:58:20,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-03 22:58:20,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:58:20,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015585658]
[2024-06-03 22:58:20,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015585658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:58:20,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:58:20,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:58:20,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098442357]
[2024-06-03 22:58:20,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:58:20,349 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:58:20,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:58:20,350 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:58:20,350 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:58:20,487 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:58:20,487 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-03 22:58:20,487 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:58:20,487 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:58:20,487 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:58:21,795 INFO  L124   PetriNetUnfolderBase]: 2839/4508 cut-off events.
[2024-06-03 22:58:21,795 INFO  L125   PetriNetUnfolderBase]: For 438352/438354 co-relation queries the response was YES.
[2024-06-03 22:58:21,825 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-03 22:58:21,840 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 303 selfloop transitions, 38 changer transitions 0/346 dead transitions.
[2024-06-03 22:58:21,840 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 346 transitions, 5339 flow
[2024-06-03 22:58:21,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:58:21,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:58:21,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions.
[2024-06-03 22:58:21,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43154761904761907
[2024-06-03 22:58:21,841 INFO  L175             Difference]: Start difference. First operand has 252 places, 318 transitions, 4505 flow. Second operand 8 states and 145 transitions.
[2024-06-03 22:58:21,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 346 transitions, 5339 flow
[2024-06-03 22:58:22,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 346 transitions, 5171 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-03 22:58:22,424 INFO  L231             Difference]: Finished difference. Result has 255 places, 322 transitions, 4519 flow
[2024-06-03 22:58:22,424 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-03 22:58:22,424 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 212 predicate places.
[2024-06-03 22:58:22,424 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 322 transitions, 4519 flow
[2024-06-03 22:58:22,424 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-03 22:58:22,425 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:58:22,425 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-03 22:58:22,425 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-03 22:58:22,425 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-03 22:58:22,425 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:58:22,425 INFO  L85        PathProgramCache]: Analyzing trace with hash -522060878, now seen corresponding path program 2 times
[2024-06-03 22:58:22,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:58:22,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062222140]
[2024-06-03 22:58:22,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:58:22,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:58:22,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:58:30,050 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:58:30,050 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:58:30,050 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062222140]
[2024-06-03 22:58:30,050 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062222140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:58:30,050 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:58:30,051 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:58:30,051 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238405287]
[2024-06-03 22:58:30,051 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:58:30,051 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:58:30,051 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:58:30,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:58:30,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:58:30,189 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:58:30,189 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-03 22:58:30,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:58:30,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:58:30,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:58:31,503 INFO  L124   PetriNetUnfolderBase]: 2857/4554 cut-off events.
[2024-06-03 22:58:31,503 INFO  L125   PetriNetUnfolderBase]: For 452010/452012 co-relation queries the response was YES.
[2024-06-03 22:58:31,534 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-03 22:58:31,549 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 301 selfloop transitions, 45 changer transitions 0/351 dead transitions.
[2024-06-03 22:58:31,549 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 351 transitions, 5581 flow
[2024-06-03 22:58:31,550 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:58:31,550 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:58:31,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-03 22:58:31,550 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-03 22:58:31,550 INFO  L175             Difference]: Start difference. First operand has 255 places, 322 transitions, 4519 flow. Second operand 8 states and 146 transitions.
[2024-06-03 22:58:31,550 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 351 transitions, 5581 flow
[2024-06-03 22:58:32,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 351 transitions, 5495 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-03 22:58:32,277 INFO  L231             Difference]: Finished difference. Result has 260 places, 328 transitions, 4711 flow
[2024-06-03 22:58:32,278 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-03 22:58:32,278 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 217 predicate places.
[2024-06-03 22:58:32,278 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 328 transitions, 4711 flow
[2024-06-03 22:58:32,278 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-03 22:58:32,278 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:58:32,278 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-03 22:58:32,278 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-03 22:58:32,278 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-03 22:58:32,278 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:58:32,278 INFO  L85        PathProgramCache]: Analyzing trace with hash 818448868, now seen corresponding path program 3 times
[2024-06-03 22:58:32,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:58:32,279 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617633489]
[2024-06-03 22:58:32,279 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:58:32,279 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:58:32,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:58:40,003 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:58:40,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:58:40,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617633489]
[2024-06-03 22:58:40,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617633489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:58:40,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:58:40,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:58:40,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836995014]
[2024-06-03 22:58:40,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:58:40,004 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:58:40,004 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:58:40,004 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:58:40,004 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:58:40,149 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:58:40,150 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-03 22:58:40,150 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:58:40,150 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:58:40,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:58:41,473 INFO  L124   PetriNetUnfolderBase]: 2907/4638 cut-off events.
[2024-06-03 22:58:41,473 INFO  L125   PetriNetUnfolderBase]: For 480046/480048 co-relation queries the response was YES.
[2024-06-03 22:58:41,506 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-03 22:58:41,522 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 292 selfloop transitions, 63 changer transitions 0/360 dead transitions.
[2024-06-03 22:58:41,523 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 360 transitions, 5943 flow
[2024-06-03 22:58:41,528 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 22:58:41,528 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 22:58:41,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-03 22:58:41,529 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-03 22:58:41,529 INFO  L175             Difference]: Start difference. First operand has 260 places, 328 transitions, 4711 flow. Second operand 8 states and 142 transitions.
[2024-06-03 22:58:41,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 360 transitions, 5943 flow
[2024-06-03 22:58:42,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 360 transitions, 5837 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-03 22:58:42,286 INFO  L231             Difference]: Finished difference. Result has 264 places, 340 transitions, 5111 flow
[2024-06-03 22:58:42,286 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-03 22:58:42,287 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 221 predicate places.
[2024-06-03 22:58:42,287 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 340 transitions, 5111 flow
[2024-06-03 22:58:42,287 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-03 22:58:42,287 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:58:42,287 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-03 22:58:42,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-03 22:58:42,287 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-03 22:58:42,287 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:58:42,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 151348148, now seen corresponding path program 4 times
[2024-06-03 22:58:42,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:58:42,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540425548]
[2024-06-03 22:58:42,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:58:42,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:58:42,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:58:50,324 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:58:50,324 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:58:50,324 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540425548]
[2024-06-03 22:58:50,324 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540425548] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:58:50,324 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:58:50,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:58:50,325 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820850068]
[2024-06-03 22:58:50,325 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:58:50,325 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:58:50,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:58:50,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:58:50,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:58:50,402 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:58:50,402 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-03 22:58:50,402 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:58:50,402 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:58:50,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:58:51,961 INFO  L124   PetriNetUnfolderBase]: 2962/4710 cut-off events.
[2024-06-03 22:58:51,961 INFO  L125   PetriNetUnfolderBase]: For 492637/492637 co-relation queries the response was YES.
[2024-06-03 22:58:51,993 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-03 22:58:52,009 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 340 selfloop transitions, 46 changer transitions 0/391 dead transitions.
[2024-06-03 22:58:52,009 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 391 transitions, 6324 flow
[2024-06-03 22:58:52,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 22:58:52,011 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 22:58:52,011 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 196 transitions.
[2024-06-03 22:58:52,011 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-03 22:58:52,011 INFO  L175             Difference]: Start difference. First operand has 264 places, 340 transitions, 5111 flow. Second operand 12 states and 196 transitions.
[2024-06-03 22:58:52,011 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 391 transitions, 6324 flow
[2024-06-03 22:58:52,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 391 transitions, 6173 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-03 22:58:52,714 INFO  L231             Difference]: Finished difference. Result has 275 places, 358 transitions, 5479 flow
[2024-06-03 22:58:52,715 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-03 22:58:52,715 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 232 predicate places.
[2024-06-03 22:58:52,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 358 transitions, 5479 flow
[2024-06-03 22:58:52,715 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-03 22:58:52,715 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:58:52,715 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-03 22:58:52,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-03 22:58:52,715 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-03 22:58:52,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:58:52,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -1949302806, now seen corresponding path program 5 times
[2024-06-03 22:58:52,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:58:52,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479567210]
[2024-06-03 22:58:52,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:58:52,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:58:52,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:59:00,342 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:59:00,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:59:00,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479567210]
[2024-06-03 22:59:00,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479567210] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:59:00,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:59:00,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:59:00,343 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255551728]
[2024-06-03 22:59:00,343 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:59:00,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:59:00,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:59:00,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:59:00,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:59:00,477 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:59:00,477 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-03 22:59:00,478 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:59:00,478 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:59:00,478 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:59:01,962 INFO  L124   PetriNetUnfolderBase]: 2950/4697 cut-off events.
[2024-06-03 22:59:01,962 INFO  L125   PetriNetUnfolderBase]: For 497150/497150 co-relation queries the response was YES.
[2024-06-03 22:59:01,997 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-03 22:59:02,013 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 317 selfloop transitions, 70 changer transitions 0/392 dead transitions.
[2024-06-03 22:59:02,013 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 392 transitions, 6501 flow
[2024-06-03 22:59:02,014 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 22:59:02,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 22:59:02,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions.
[2024-06-03 22:59:02,015 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41125541125541126
[2024-06-03 22:59:02,015 INFO  L175             Difference]: Start difference. First operand has 275 places, 358 transitions, 5479 flow. Second operand 11 states and 190 transitions.
[2024-06-03 22:59:02,015 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 392 transitions, 6501 flow
[2024-06-03 22:59:02,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 392 transitions, 6377 flow, removed 15 selfloop flow, removed 7 redundant places.
[2024-06-03 22:59:02,816 INFO  L231             Difference]: Finished difference. Result has 279 places, 358 transitions, 5503 flow
[2024-06-03 22:59:02,816 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-03 22:59:02,816 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 236 predicate places.
[2024-06-03 22:59:02,816 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 358 transitions, 5503 flow
[2024-06-03 22:59:02,816 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-03 22:59:02,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:59:02,816 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-03 22:59:02,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-03 22:59:02,817 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-03 22:59:02,817 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:59:02,817 INFO  L85        PathProgramCache]: Analyzing trace with hash 503279376, now seen corresponding path program 6 times
[2024-06-03 22:59:02,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:59:02,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157607657]
[2024-06-03 22:59:02,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:59:02,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:59:02,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:59:09,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:59:09,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:59:09,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157607657]
[2024-06-03 22:59:09,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157607657] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:59:09,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:59:09,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:59:09,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041479788]
[2024-06-03 22:59:09,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:59:09,761 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:59:09,761 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:59:09,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:59:09,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:59:09,889 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:59:09,889 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-03 22:59:09,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:59:09,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:59:09,889 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:59:11,308 INFO  L124   PetriNetUnfolderBase]: 2940/4693 cut-off events.
[2024-06-03 22:59:11,308 INFO  L125   PetriNetUnfolderBase]: For 497474/497474 co-relation queries the response was YES.
[2024-06-03 22:59:11,342 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-03 22:59:11,358 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 334 selfloop transitions, 50 changer transitions 0/389 dead transitions.
[2024-06-03 22:59:11,358 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 389 transitions, 6355 flow
[2024-06-03 22:59:11,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:59:11,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:59:11,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-03 22:59:11,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-03 22:59:11,359 INFO  L175             Difference]: Start difference. First operand has 279 places, 358 transitions, 5503 flow. Second operand 10 states and 176 transitions.
[2024-06-03 22:59:11,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 389 transitions, 6355 flow
[2024-06-03 22:59:12,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 389 transitions, 6183 flow, removed 28 selfloop flow, removed 8 redundant places.
[2024-06-03 22:59:12,252 INFO  L231             Difference]: Finished difference. Result has 281 places, 358 transitions, 5437 flow
[2024-06-03 22:59:12,252 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-03 22:59:12,252 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 238 predicate places.
[2024-06-03 22:59:12,252 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 358 transitions, 5437 flow
[2024-06-03 22:59:12,252 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-03 22:59:12,252 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:59:12,253 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-03 22:59:12,253 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-03 22:59:12,253 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-03 22:59:12,253 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:59:12,253 INFO  L85        PathProgramCache]: Analyzing trace with hash 503399346, now seen corresponding path program 7 times
[2024-06-03 22:59:12,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:59:12,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998621932]
[2024-06-03 22:59:12,253 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:59:12,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:59:12,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:59:19,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:59:19,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:59:19,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998621932]
[2024-06-03 22:59:19,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998621932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:59:19,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:59:19,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:59:19,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316056420]
[2024-06-03 22:59:19,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:59:19,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:59:19,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:59:19,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:59:19,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:59:19,603 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:59:19,603 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-03 22:59:19,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:59:19,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:59:19,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:59:21,020 INFO  L124   PetriNetUnfolderBase]: 2934/4680 cut-off events.
[2024-06-03 22:59:21,020 INFO  L125   PetriNetUnfolderBase]: For 501616/501616 co-relation queries the response was YES.
[2024-06-03 22:59:21,055 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-03 22:59:21,071 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 323 selfloop transitions, 60 changer transitions 0/388 dead transitions.
[2024-06-03 22:59:21,071 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 388 transitions, 6445 flow
[2024-06-03 22:59:21,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:59:21,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:59:21,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions.
[2024-06-03 22:59:21,072 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-03 22:59:21,072 INFO  L175             Difference]: Start difference. First operand has 281 places, 358 transitions, 5437 flow. Second operand 10 states and 176 transitions.
[2024-06-03 22:59:21,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 388 transitions, 6445 flow
[2024-06-03 22:59:21,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 388 transitions, 6303 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-06-03 22:59:21,919 INFO  L231             Difference]: Finished difference. Result has 282 places, 358 transitions, 5421 flow
[2024-06-03 22:59:21,920 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-03 22:59:21,920 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 239 predicate places.
[2024-06-03 22:59:21,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 358 transitions, 5421 flow
[2024-06-03 22:59:21,920 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-03 22:59:21,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:59:21,920 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-03 22:59:21,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-03 22:59:21,920 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-03 22:59:21,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:59:21,920 INFO  L85        PathProgramCache]: Analyzing trace with hash -1358504254, now seen corresponding path program 8 times
[2024-06-03 22:59:21,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:59:21,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705763509]
[2024-06-03 22:59:21,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:59:21,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:59:21,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:59:29,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:59:29,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:59:29,649 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705763509]
[2024-06-03 22:59:29,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705763509] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:59:29,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:59:29,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:59:29,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327060021]
[2024-06-03 22:59:29,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:59:29,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:59:29,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:59:29,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:59:29,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:59:29,787 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:59:29,787 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-03 22:59:29,787 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:59:29,787 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:59:29,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:59:31,231 INFO  L124   PetriNetUnfolderBase]: 2964/4724 cut-off events.
[2024-06-03 22:59:31,231 INFO  L125   PetriNetUnfolderBase]: For 527087/527087 co-relation queries the response was YES.
[2024-06-03 22:59:31,268 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-03 22:59:31,285 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 274 selfloop transitions, 115 changer transitions 0/394 dead transitions.
[2024-06-03 22:59:31,285 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 394 transitions, 6760 flow
[2024-06-03 22:59:31,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:59:31,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:59:31,286 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-03 22:59:31,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-03 22:59:31,286 INFO  L175             Difference]: Start difference. First operand has 282 places, 358 transitions, 5421 flow. Second operand 10 states and 181 transitions.
[2024-06-03 22:59:31,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 394 transitions, 6760 flow
[2024-06-03 22:59:32,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 394 transitions, 6569 flow, removed 18 selfloop flow, removed 9 redundant places.
[2024-06-03 22:59:32,193 INFO  L231             Difference]: Finished difference. Result has 283 places, 365 transitions, 5632 flow
[2024-06-03 22:59:32,193 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-03 22:59:32,193 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 240 predicate places.
[2024-06-03 22:59:32,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 283 places, 365 transitions, 5632 flow
[2024-06-03 22:59:32,194 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-03 22:59:32,194 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:59:32,194 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-03 22:59:32,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-03 22:59:32,194 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-03 22:59:32,194 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:59:32,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -1358771164, now seen corresponding path program 9 times
[2024-06-03 22:59:32,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:59:32,195 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327494198]
[2024-06-03 22:59:32,195 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:59:32,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:59:32,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:59:39,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:59:39,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:59:39,659 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327494198]
[2024-06-03 22:59:39,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327494198] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:59:39,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:59:39,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:59:39,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114973343]
[2024-06-03 22:59:39,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:59:39,659 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:59:39,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:59:39,660 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:59:39,660 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:59:39,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:59:39,795 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-03 22:59:39,795 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:59:39,795 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:59:39,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:59:41,184 INFO  L124   PetriNetUnfolderBase]: 2946/4700 cut-off events.
[2024-06-03 22:59:41,184 INFO  L125   PetriNetUnfolderBase]: For 520190/520190 co-relation queries the response was YES.
[2024-06-03 22:59:41,219 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-03 22:59:41,236 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 270 selfloop transitions, 119 changer transitions 0/394 dead transitions.
[2024-06-03 22:59:41,236 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 394 transitions, 6818 flow
[2024-06-03 22:59:41,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 22:59:41,237 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 22:59:41,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions.
[2024-06-03 22:59:41,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.430952380952381
[2024-06-03 22:59:41,237 INFO  L175             Difference]: Start difference. First operand has 283 places, 365 transitions, 5632 flow. Second operand 10 states and 181 transitions.
[2024-06-03 22:59:41,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 394 transitions, 6818 flow
[2024-06-03 22:59:42,215 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 394 transitions, 6535 flow, removed 48 selfloop flow, removed 7 redundant places.
[2024-06-03 22:59:42,219 INFO  L231             Difference]: Finished difference. Result has 286 places, 365 transitions, 5598 flow
[2024-06-03 22:59:42,219 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-03 22:59:42,220 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 243 predicate places.
[2024-06-03 22:59:42,220 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 365 transitions, 5598 flow
[2024-06-03 22:59:42,220 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-03 22:59:42,220 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:59:42,220 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-03 22:59:42,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83
[2024-06-03 22:59:42,220 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-03 22:59:42,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:59:42,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 317963590, now seen corresponding path program 10 times
[2024-06-03 22:59:42,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:59:42,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896279160]
[2024-06-03 22:59:42,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:59:42,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:59:42,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:59:49,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:59:49,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:59:49,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896279160]
[2024-06-03 22:59:49,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896279160] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:59:49,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:59:49,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 22:59:49,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490161493]
[2024-06-03 22:59:49,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:59:49,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 22:59:49,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:59:49,818 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 22:59:49,818 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 22:59:49,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 22:59:49,923 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-03 22:59:49,924 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:59:49,924 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 22:59:49,924 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:59:51,361 INFO  L124   PetriNetUnfolderBase]: 3004/4788 cut-off events.
[2024-06-03 22:59:51,361 INFO  L125   PetriNetUnfolderBase]: For 542844/542846 co-relation queries the response was YES.
[2024-06-03 22:59:51,399 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-03 22:59:51,417 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 204 selfloop transitions, 191 changer transitions 0/400 dead transitions.
[2024-06-03 22:59:51,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 400 transitions, 7142 flow
[2024-06-03 22:59:51,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:59:51,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:59:51,418 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 22:59:51,418 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 22:59:51,418 INFO  L175             Difference]: Start difference. First operand has 286 places, 365 transitions, 5598 flow. Second operand 9 states and 171 transitions.
[2024-06-03 22:59:51,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 400 transitions, 7142 flow
[2024-06-03 22:59:52,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 400 transitions, 6684 flow, removed 18 selfloop flow, removed 12 redundant places.
[2024-06-03 22:59:52,494 INFO  L231             Difference]: Finished difference. Result has 284 places, 376 transitions, 5736 flow
[2024-06-03 22:59:52,494 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-03 22:59:52,494 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 241 predicate places.
[2024-06-03 22:59:52,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 284 places, 376 transitions, 5736 flow
[2024-06-03 22:59:52,495 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-03 22:59:52,495 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:59:52,495 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-03 22:59:52,495 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84
[2024-06-03 22:59:52,495 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-03 22:59:52,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:59:52,495 INFO  L85        PathProgramCache]: Analyzing trace with hash -1490235214, now seen corresponding path program 11 times
[2024-06-03 22:59:52,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:59:52,496 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631157357]
[2024-06-03 22:59:52,496 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:59:52,496 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:59:52,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 23:00:00,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 23:00:00,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 23:00:00,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631157357]
[2024-06-03 23:00:00,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631157357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 23:00:00,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 23:00:00,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 23:00:00,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567984716]
[2024-06-03 23:00:00,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 23:00:00,528 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 23:00:00,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 23:00:00,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 23:00:00,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 23:00:00,669 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-03 23:00:00,669 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-03 23:00:00,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 23:00:00,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-03 23:00:00,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 23:00:02,088 INFO  L124   PetriNetUnfolderBase]: 3038/4822 cut-off events.
[2024-06-03 23:00:02,088 INFO  L125   PetriNetUnfolderBase]: For 554518/554520 co-relation queries the response was YES.
[2024-06-03 23:00:02,123 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-03 23:00:02,141 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 224 selfloop transitions, 178 changer transitions 0/407 dead transitions.
[2024-06-03 23:00:02,141 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 407 transitions, 7245 flow
[2024-06-03 23:00:02,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 23:00:02,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 23:00:02,142 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-03 23:00:02,142 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-03 23:00:02,142 INFO  L175             Difference]: Start difference. First operand has 284 places, 376 transitions, 5736 flow. Second operand 9 states and 171 transitions.
[2024-06-03 23:00:02,142 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 407 transitions, 7245 flow
Killed by 15