./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_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-04 18:02:18,889 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-04 18:02:18,969 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-04 18:02:18,975 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-04 18:02:18,976 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-04 18:02:19,030 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-04 18:02:19,031 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-04 18:02:19,031 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-04 18:02:19,032 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-04 18:02:19,036 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-04 18:02:19,036 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-04 18:02:19,036 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-04 18:02:19,038 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-04 18:02:19,039 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-04 18:02:19,039 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-04 18:02:19,039 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-04 18:02:19,040 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-04 18:02:19,040 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-04 18:02:19,040 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-04 18:02:19,041 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-04 18:02:19,041 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-04 18:02:19,041 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-04 18:02:19,042 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-04 18:02:19,042 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-04 18:02:19,042 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-04 18:02:19,043 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-04 18:02:19,043 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-04 18:02:19,043 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-04 18:02:19,044 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-04 18:02:19,044 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-04 18:02:19,045 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-04 18:02:19,046 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-04 18:02:19,046 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:02:19,046 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-04 18:02:19,046 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-04 18:02:19,047 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-04 18:02:19,047 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-04 18:02:19,047 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-04 18:02:19,056 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-04 18:02:19,056 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-04 18:02:19,057 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-04 18:02:19,057 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-04 18:02:19,057 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-04 18:02:19,057 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-04 18:02:19,379 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-04 18:02:19,424 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-04 18:02:19,427 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-04 18:02:19,428 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-04 18:02:19,429 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-04 18:02:19,430 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml
[2024-06-04 18:02:19,812 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-04 18:02:19,812 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-04 18:02:19,813 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:02:21,817 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-04 18:02:22,106 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-04 18:02:22,107 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:02:22,127 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc37ff04/4c6374abc837458a8d1de69566925541/FLAG4306827a9
[2024-06-04 18:02:22,147 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbc37ff04/4c6374abc837458a8d1de69566925541
[2024-06-04 18:02:22,148 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-04 18:02:22,150 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-04 18:02:22,152 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-04 18:02:22,152 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-04 18:02:22,157 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-04 18:02:22,158 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:02:19" (1/2) ...
[2024-06-04 18:02:22,159 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e1c9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:02:22, skipping insertion in model container
[2024-06-04 18:02:22,159 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:02:19" (1/2) ...
[2024-06-04 18:02:22,161 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@185ceef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:02:22, skipping insertion in model container
[2024-06-04 18:02:22,162 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:02:22" (2/2) ...
[2024-06-04 18:02:22,162 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:22, skipping insertion in model container
[2024-06-04 18:02:22,162 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:02:22" (2/2) ...
[2024-06-04 18:02:22,162 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-04 18:02:22,245 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-04 18:02:22,247 INFO  L97    edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 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) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_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_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 )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_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_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 )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_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_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$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_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_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$mem_tmp + (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 + (long long )y$r_buff1_thd0 >= 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_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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 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_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_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 )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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 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_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_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_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_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 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_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_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 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_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_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 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_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 )x - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 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_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_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 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_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_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$mem_tmp - (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 - (long long )y$r_buff1_thd0 >= 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_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_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_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 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_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$$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_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-04 18:02:22,247 INFO  L97    edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 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) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_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_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 )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_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_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 )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_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_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$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_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_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$mem_tmp + (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 + (long long )y$r_buff1_thd0 >= 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_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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 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_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_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 )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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 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_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_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_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_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 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_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_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 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_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_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 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_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 )x - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 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_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_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 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_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_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$mem_tmp - (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 - (long long )y$r_buff1_thd0 >= 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_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_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_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 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_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$$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_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-04 18:02:22,248 INFO  L97    edCorrectnessWitness]: Location invariant before [L818-L818] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_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_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 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_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_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 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) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_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_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_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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_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_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_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 )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_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_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 )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_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_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$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_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_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$mem_tmp + (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 + (long long )y$r_buff1_thd0 >= 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_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_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_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$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 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_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_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 )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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 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_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_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_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_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 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_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_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 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_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_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 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_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 )x - (long long )y$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 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_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_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 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_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_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$mem_tmp - (long long )y$r_buff0_thd0 >= 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_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$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_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_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_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_thd3 - (long long )y$r_buff1_thd0 >= 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_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_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_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 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_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$$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_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2)))
[2024-06-04 18:02:22,249 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-04 18:02:22,249 INFO  L106   edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1;
[2024-06-04 18:02:22,293 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-04 18:02:22,832 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:02:22,878 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-04 18:02:23,601 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-04 18:02:23,670 INFO  L206         MainTranslator]: Completed translation
[2024-06-04 18:02:23,671 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23 WrapperNode
[2024-06-04 18:02:23,684 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-04 18:02:23,686 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-04 18:02:23,687 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-04 18:02:23,687 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-04 18:02:23,694 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:23,776 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:23,979 INFO  L138                Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142
[2024-06-04 18:02:23,980 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-04 18:02:23,981 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-04 18:02:23,981 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-04 18:02:23,982 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-04 18:02:23,999 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,000 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,059 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,184 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-04 18:02:24,185 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,185 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,269 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,286 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,323 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,330 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,394 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-04 18:02:24,396 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-04 18:02:24,410 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-04 18:02:24,410 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-04 18:02:24,412 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (1/1) ...
[2024-06-04 18:02:24,418 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-04 18:02:24,426 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-04 18:02:24,478 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-04 18:02:24,518 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-04 18:02:24,573 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-04 18:02:24,574 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-04 18:02:24,574 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-04 18:02:24,574 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-04 18:02:24,575 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-04 18:02:24,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-04 18:02:24,575 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-04 18:02:24,575 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-04 18:02:24,575 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-04 18:02:24,575 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-04 18:02:24,576 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-04 18:02:24,576 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-04 18:02:24,577 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-04 18:02:24,850 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-04 18:02:24,864 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-04 18:02:26,808 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-04 18:02:26,810 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-04 18:02:27,352 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-04 18:02:27,352 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-04 18:02:27,353 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:02:27 BoogieIcfgContainer
[2024-06-04 18:02:27,353 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-04 18:02:27,355 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-04 18:02:27,356 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-04 18:02:27,359 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-04 18:02:27,359 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:02:19" (1/4) ...
[2024-06-04 18:02:27,360 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcf291 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:02:27, skipping insertion in model container
[2024-06-04 18:02:27,360 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:02:22" (2/4) ...
[2024-06-04 18:02:27,367 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcf291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:02:27, skipping insertion in model container
[2024-06-04 18:02:27,367 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:02:23" (3/4) ...
[2024-06-04 18:02:27,367 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dcf291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:02:27, skipping insertion in model container
[2024-06-04 18:02:27,367 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:02:27" (4/4) ...
[2024-06-04 18:02:27,369 INFO  L112   eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2024-06-04 18:02:27,401 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-04 18:02:27,416 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-04 18:02:27,416 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-04 18:02:27,654 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-04 18:02:27,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 92 flow
[2024-06-04 18:02:27,846 INFO  L124   PetriNetUnfolderBase]: 0/37 cut-off events.
[2024-06-04 18:02:27,847 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:02:27,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-04 18:02:27,850 INFO  L82        GeneralOperation]: Start removeDead. Operand has 50 places, 40 transitions, 92 flow
[2024-06-04 18:02:27,854 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 41 places, 31 transitions, 71 flow
[2024-06-04 18:02:27,874 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-04 18:02:27,895 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;@108d1a74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-04 18:02:27,895 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-04 18:02:27,906 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-04 18:02:27,917 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-04 18:02:27,918 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-04 18:02:27,918 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:27,919 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:27,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-04 18:02:27,925 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:27,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -1507050491, now seen corresponding path program 1 times
[2024-06-04 18:02:27,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:27,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448717954]
[2024-06-04 18:02:27,952 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:27,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:28,567 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:33,513 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:02:33,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:33,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448717954]
[2024-06-04 18:02:33,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448717954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:33,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:33,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-04 18:02:33,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718535951]
[2024-06-04 18:02:33,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:33,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-04 18:02:33,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:33,547 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-04 18:02:33,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-04 18:02:33,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-04 18:02:33,615 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:33,615 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:33,615 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-04 18:02:33,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:34,196 INFO  L124   PetriNetUnfolderBase]: 1156/1754 cut-off events.
[2024-06-04 18:02:34,196 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-04 18:02:34,201 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1754 events. 1156/1754 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7866 event pairs, 805 based on Foata normal form. 1/1718 useless extension candidates. Maximal degree in co-relation 3568. Up to 1740 conditions per place. 
[2024-06-04 18:02:34,208 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 33 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2024-06-04 18:02:34,208 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 171 flow
[2024-06-04 18:02:34,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-04 18:02:34,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-04 18:02:34,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions.
[2024-06-04 18:02:34,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5583333333333333
[2024-06-04 18:02:34,219 INFO  L175             Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 3 states and 67 transitions.
[2024-06-04 18:02:34,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 171 flow
[2024-06-04 18:02:34,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-04 18:02:34,223 INFO  L231             Difference]: Finished difference. Result has 41 places, 34 transitions, 98 flow
[2024-06-04 18:02:34,224 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=34}
[2024-06-04 18:02:34,226 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places.
[2024-06-04 18:02:34,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 98 flow
[2024-06-04 18:02:34,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:34,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:34,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:34,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-04 18:02:34,227 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:34,228 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:34,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -871499996, now seen corresponding path program 1 times
[2024-06-04 18:02:34,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:34,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926694189]
[2024-06-04 18:02:34,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:34,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:34,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:37,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:02:37,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:37,115 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926694189]
[2024-06-04 18:02:37,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926694189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:37,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:37,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-04 18:02:37,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240437979]
[2024-06-04 18:02:37,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:37,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-04 18:02:37,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:37,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-04 18:02:37,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-04 18:02:37,200 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40
[2024-06-04 18:02:37,200 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 98 flow. Second operand  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:37,200 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:37,200 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40
[2024-06-04 18:02:37,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:37,793 INFO  L124   PetriNetUnfolderBase]: 1150/1745 cut-off events.
[2024-06-04 18:02:37,794 INFO  L125   PetriNetUnfolderBase]: For 338/346 co-relation queries the response was YES.
[2024-06-04 18:02:37,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4054 conditions, 1745 events. 1150/1745 cut-off events. For 338/346 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7766 event pairs, 699 based on Foata normal form. 6/1749 useless extension candidates. Maximal degree in co-relation 4039. Up to 1716 conditions per place. 
[2024-06-04 18:02:37,803 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 40 selfloop transitions, 7 changer transitions 0/51 dead transitions.
[2024-06-04 18:02:37,804 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 238 flow
[2024-06-04 18:02:37,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-04 18:02:37,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-04 18:02:37,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions.
[2024-06-04 18:02:37,806 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5375
[2024-06-04 18:02:37,806 INFO  L175             Difference]: Start difference. First operand has 41 places, 34 transitions, 98 flow. Second operand 4 states and 86 transitions.
[2024-06-04 18:02:37,806 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 238 flow
[2024-06-04 18:02:37,807 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-04 18:02:37,808 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 134 flow
[2024-06-04 18:02:37,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-04 18:02:37,809 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places.
[2024-06-04 18:02:37,809 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 134 flow
[2024-06-04 18:02:37,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:37,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:37,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:37,810 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-04 18:02:37,810 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:37,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:37,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -1246694692, now seen corresponding path program 1 times
[2024-06-04 18:02:37,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:37,811 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179406968]
[2024-06-04 18:02:37,811 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:37,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:37,852 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:40,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:02:40,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:40,323 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179406968]
[2024-06-04 18:02:40,323 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179406968] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:40,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:40,324 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-04 18:02:40,324 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305329129]
[2024-06-04 18:02:40,324 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:40,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-04 18:02:40,325 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:40,325 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-04 18:02:40,325 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-04 18:02:40,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:02:40,411 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 134 flow. Second operand  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:40,412 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:40,412 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:02:40,412 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:41,067 INFO  L124   PetriNetUnfolderBase]: 1405/2113 cut-off events.
[2024-06-04 18:02:41,067 INFO  L125   PetriNetUnfolderBase]: For 1053/1053 co-relation queries the response was YES.
[2024-06-04 18:02:41,070 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 2113 events. 1405/2113 cut-off events. For 1053/1053 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9500 event pairs, 627 based on Foata normal form. 7/2119 useless extension candidates. Maximal degree in co-relation 5392. Up to 1974 conditions per place. 
[2024-06-04 18:02:41,080 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 62 selfloop transitions, 14 changer transitions 0/79 dead transitions.
[2024-06-04 18:02:41,080 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 423 flow
[2024-06-04 18:02:41,096 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:02:41,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:02:41,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions.
[2024-06-04 18:02:41,097 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.555
[2024-06-04 18:02:41,097 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 134 flow. Second operand 5 states and 111 transitions.
[2024-06-04 18:02:41,097 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 423 flow
[2024-06-04 18:02:41,100 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 402 flow, removed 3 selfloop flow, removed 2 redundant places.
[2024-06-04 18:02:41,101 INFO  L231             Difference]: Finished difference. Result has 49 places, 50 transitions, 231 flow
[2024-06-04 18:02:41,101 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=49, PETRI_TRANSITIONS=50}
[2024-06-04 18:02:41,101 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places.
[2024-06-04 18:02:41,102 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 231 flow
[2024-06-04 18:02:41,102 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:41,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:41,102 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:41,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-04 18:02:41,102 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:41,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:41,103 INFO  L85        PathProgramCache]: Analyzing trace with hash 7171651, now seen corresponding path program 1 times
[2024-06-04 18:02:41,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:41,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745510181]
[2024-06-04 18:02:41,103 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:41,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:41,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:44,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:02:44,073 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:44,076 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745510181]
[2024-06-04 18:02:44,076 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745510181] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:44,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:44,077 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:02:44,077 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815297049]
[2024-06-04 18:02:44,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:44,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:02:44,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:44,079 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:02:44,079 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:02:44,137 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:02:44,137 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 231 flow. Second operand  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:44,137 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:44,138 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:02:44,138 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:44,967 INFO  L124   PetriNetUnfolderBase]: 1427/2146 cut-off events.
[2024-06-04 18:02:44,967 INFO  L125   PetriNetUnfolderBase]: For 2544/2546 co-relation queries the response was YES.
[2024-06-04 18:02:44,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6651 conditions, 2146 events. 1427/2146 cut-off events. For 2544/2546 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9646 event pairs, 503 based on Foata normal form. 9/2154 useless extension candidates. Maximal degree in co-relation 6631. Up to 1963 conditions per place. 
[2024-06-04 18:02:44,978 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 70 selfloop transitions, 18 changer transitions 0/91 dead transitions.
[2024-06-04 18:02:44,978 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 91 transitions, 549 flow
[2024-06-04 18:02:44,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:02:44,979 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:02:44,979 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions.
[2024-06-04 18:02:44,980 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5458333333333333
[2024-06-04 18:02:44,980 INFO  L175             Difference]: Start difference. First operand has 49 places, 50 transitions, 231 flow. Second operand 6 states and 131 transitions.
[2024-06-04 18:02:44,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 91 transitions, 549 flow
[2024-06-04 18:02:44,983 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 545 flow, removed 2 selfloop flow, removed 0 redundant places.
[2024-06-04 18:02:44,984 INFO  L231             Difference]: Finished difference. Result has 55 places, 54 transitions, 300 flow
[2024-06-04 18:02:44,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=55, PETRI_TRANSITIONS=54}
[2024-06-04 18:02:44,985 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places.
[2024-06-04 18:02:44,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 300 flow
[2024-06-04 18:02:44,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:44,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:44,986 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:44,986 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-04 18:02:44,986 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:44,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:44,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 1080602535, now seen corresponding path program 1 times
[2024-06-04 18:02:44,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:44,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973218854]
[2024-06-04 18:02:44,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:44,987 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:45,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:47,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:02:47,799 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:47,799 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973218854]
[2024-06-04 18:02:47,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973218854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:47,799 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:47,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:02:47,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697252497]
[2024-06-04 18:02:47,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:47,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:02:47,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:47,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:02:47,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:02:47,896 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:02:47,896 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 300 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:47,896 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:47,896 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:02:47,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:48,772 INFO  L124   PetriNetUnfolderBase]: 1523/2313 cut-off events.
[2024-06-04 18:02:48,773 INFO  L125   PetriNetUnfolderBase]: For 4121/4123 co-relation queries the response was YES.
[2024-06-04 18:02:48,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7924 conditions, 2313 events. 1523/2313 cut-off events. For 4121/4123 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10747 event pairs, 364 based on Foata normal form. 28/2340 useless extension candidates. Maximal degree in co-relation 7901. Up to 1884 conditions per place. 
[2024-06-04 18:02:48,787 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 81 selfloop transitions, 31 changer transitions 0/115 dead transitions.
[2024-06-04 18:02:48,787 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 115 transitions, 778 flow
[2024-06-04 18:02:48,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:02:48,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:02:48,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-04 18:02:48,791 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.55
[2024-06-04 18:02:48,791 INFO  L175             Difference]: Start difference. First operand has 55 places, 54 transitions, 300 flow. Second operand 7 states and 154 transitions.
[2024-06-04 18:02:48,791 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 115 transitions, 778 flow
[2024-06-04 18:02:48,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 115 transitions, 737 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-06-04 18:02:48,800 INFO  L231             Difference]: Finished difference. Result has 61 places, 68 transitions, 469 flow
[2024-06-04 18:02:48,800 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=61, PETRI_TRANSITIONS=68}
[2024-06-04 18:02:48,802 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places.
[2024-06-04 18:02:48,802 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 469 flow
[2024-06-04 18:02:48,802 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:48,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:48,808 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:48,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-04 18:02:48,808 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:48,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:48,809 INFO  L85        PathProgramCache]: Analyzing trace with hash -674294270, now seen corresponding path program 1 times
[2024-06-04 18:02:48,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:48,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547722555]
[2024-06-04 18:02:48,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:48,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:48,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:02:55,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:02:55,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:02:55,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547722555]
[2024-06-04 18:02:55,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547722555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:02:55,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:02:55,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-04 18:02:55,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998599942]
[2024-06-04 18:02:55,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:02:55,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-04 18:02:55,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:02:55,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-04 18:02:55,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-04 18:02:55,185 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:02:55,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 469 flow. Second operand  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:55,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:02:55,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:02:55,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:02:55,900 INFO  L124   PetriNetUnfolderBase]: 1513/2298 cut-off events.
[2024-06-04 18:02:55,900 INFO  L125   PetriNetUnfolderBase]: For 7550/7550 co-relation queries the response was YES.
[2024-06-04 18:02:55,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9256 conditions, 2298 events. 1513/2298 cut-off events. For 7550/7550 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10568 event pairs, 549 based on Foata normal form. 4/2301 useless extension candidates. Maximal degree in co-relation 9228. Up to 2267 conditions per place. 
[2024-06-04 18:02:55,918 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 68 selfloop transitions, 10 changer transitions 0/81 dead transitions.
[2024-06-04 18:02:55,918 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 665 flow
[2024-06-04 18:02:55,918 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:02:55,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:02:55,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions.
[2024-06-04 18:02:55,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41
[2024-06-04 18:02:55,919 INFO  L175             Difference]: Start difference. First operand has 61 places, 68 transitions, 469 flow. Second operand 5 states and 82 transitions.
[2024-06-04 18:02:55,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 665 flow
[2024-06-04 18:02:55,926 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 81 transitions, 647 flow, removed 9 selfloop flow, removed 0 redundant places.
[2024-06-04 18:02:55,928 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 499 flow
[2024-06-04 18:02:55,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=67, PETRI_TRANSITIONS=70}
[2024-06-04 18:02:55,931 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places.
[2024-06-04 18:02:55,932 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 499 flow
[2024-06-04 18:02:55,932 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:02:55,932 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:02:55,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:02:55,932 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-04 18:02:55,933 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:02:55,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:02:55,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -492888641, now seen corresponding path program 1 times
[2024-06-04 18:02:55,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:02:55,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000825695]
[2024-06-04 18:02:55,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:02:55,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:02:55,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:01,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:01,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:01,042 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000825695]
[2024-06-04 18:03:01,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000825695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:01,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:01,043 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:03:01,043 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850133441]
[2024-06-04 18:03:01,043 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:01,043 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:03:01,044 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:01,044 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:03:01,044 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:03:01,156 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:01,157 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 499 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:01,157 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:01,157 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:01,157 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:01,823 INFO  L124   PetriNetUnfolderBase]: 1525/2317 cut-off events.
[2024-06-04 18:03:01,824 INFO  L125   PetriNetUnfolderBase]: For 8771/8773 co-relation queries the response was YES.
[2024-06-04 18:03:01,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 2317 events. 1525/2317 cut-off events. For 8771/8773 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10680 event pairs, 467 based on Foata normal form. 10/2326 useless extension candidates. Maximal degree in co-relation 9469. Up to 2165 conditions per place. 
[2024-06-04 18:03:01,834 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 75 selfloop transitions, 18 changer transitions 0/96 dead transitions.
[2024-06-04 18:03:01,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 803 flow
[2024-06-04 18:03:01,835 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:03:01,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:03:01,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-04 18:03:01,836 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44166666666666665
[2024-06-04 18:03:01,836 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 499 flow. Second operand 6 states and 106 transitions.
[2024-06-04 18:03:01,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 803 flow
[2024-06-04 18:03:01,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 781 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-06-04 18:03:01,843 INFO  L231             Difference]: Finished difference. Result has 71 places, 74 transitions, 569 flow
[2024-06-04 18:03:01,844 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=71, PETRI_TRANSITIONS=74}
[2024-06-04 18:03:01,844 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places.
[2024-06-04 18:03:01,844 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 569 flow
[2024-06-04 18:03:01,844 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:01,845 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:01,845 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:01,845 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-04 18:03:01,845 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:01,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:01,845 INFO  L85        PathProgramCache]: Analyzing trace with hash 429557347, now seen corresponding path program 2 times
[2024-06-04 18:03:01,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:01,846 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697123907]
[2024-06-04 18:03:01,846 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:01,846 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:01,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:06,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:06,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:06,392 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697123907]
[2024-06-04 18:03:06,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697123907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:06,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:06,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-04 18:03:06,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071264040]
[2024-06-04 18:03:06,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:06,397 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-04 18:03:06,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:06,398 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-04 18:03:06,398 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-04 18:03:06,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:06,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 569 flow. Second operand  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:06,479 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:06,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:06,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:07,200 INFO  L124   PetriNetUnfolderBase]: 1499/2274 cut-off events.
[2024-06-04 18:03:07,201 INFO  L125   PetriNetUnfolderBase]: For 10252/10252 co-relation queries the response was YES.
[2024-06-04 18:03:07,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9638 conditions, 2274 events. 1499/2274 cut-off events. For 10252/10252 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10355 event pairs, 509 based on Foata normal form. 4/2277 useless extension candidates. Maximal degree in co-relation 9603. Up to 2234 conditions per place. 
[2024-06-04 18:03:07,213 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 77 selfloop transitions, 11 changer transitions 0/91 dead transitions.
[2024-06-04 18:03:07,213 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 798 flow
[2024-06-04 18:03:07,216 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:03:07,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:03:07,216 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-04 18:03:07,216 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:03:07,217 INFO  L175             Difference]: Start difference. First operand has 71 places, 74 transitions, 569 flow. Second operand 6 states and 96 transitions.
[2024-06-04 18:03:07,217 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 798 flow
[2024-06-04 18:03:07,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 91 transitions, 775 flow, removed 1 selfloop flow, removed 3 redundant places.
[2024-06-04 18:03:07,226 INFO  L231             Difference]: Finished difference. Result has 74 places, 75 transitions, 589 flow
[2024-06-04 18:03:07,226 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=74, PETRI_TRANSITIONS=75}
[2024-06-04 18:03:07,227 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 33 predicate places.
[2024-06-04 18:03:07,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 589 flow
[2024-06-04 18:03:07,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:07,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:07,227 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:07,227 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-04 18:03:07,228 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-04 18:03:07,228 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:07,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -487166785, now seen corresponding path program 1 times
[2024-06-04 18:03:07,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:07,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329233917]
[2024-06-04 18:03:07,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:07,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:07,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:13,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-04 18:03:13,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:13,648 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329233917]
[2024-06-04 18:03:13,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329233917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:13,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:13,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:03:13,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741989940]
[2024-06-04 18:03:13,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:13,649 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:03:13,649 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:13,649 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:03:13,649 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:03:13,750 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:13,750 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 589 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:13,750 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:13,750 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:13,750 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:14,545 INFO  L124   PetriNetUnfolderBase]: 1491/2262 cut-off events.
[2024-06-04 18:03:14,545 INFO  L125   PetriNetUnfolderBase]: For 11636/11636 co-relation queries the response was YES.
[2024-06-04 18:03:14,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9729 conditions, 2262 events. 1491/2262 cut-off events. For 11636/11636 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10327 event pairs, 490 based on Foata normal form. 4/2265 useless extension candidates. Maximal degree in co-relation 9693. Up to 2213 conditions per place. 
[2024-06-04 18:03:14,557 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 78 selfloop transitions, 12 changer transitions 0/93 dead transitions.
[2024-06-04 18:03:14,557 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 93 transitions, 825 flow
[2024-06-04 18:03:14,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:03:14,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:03:14,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions.
[2024-06-04 18:03:14,559 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:03:14,559 INFO  L175             Difference]: Start difference. First operand has 74 places, 75 transitions, 589 flow. Second operand 6 states and 96 transitions.
[2024-06-04 18:03:14,559 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 93 transitions, 825 flow
[2024-06-04 18:03:14,570 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 801 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-04 18:03:14,572 INFO  L231             Difference]: Finished difference. Result has 76 places, 77 transitions, 616 flow
[2024-06-04 18:03:14,572 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=616, PETRI_PLACES=76, PETRI_TRANSITIONS=77}
[2024-06-04 18:03:14,572 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places.
[2024-06-04 18:03:14,573 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 616 flow
[2024-06-04 18:03:14,573 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:14,573 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:14,573 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:14,573 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-04 18:03:14,573 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-04 18:03:14,574 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:14,574 INFO  L85        PathProgramCache]: Analyzing trace with hash -599087197, now seen corresponding path program 1 times
[2024-06-04 18:03:14,574 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:14,574 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920739465]
[2024-06-04 18:03:14,574 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:14,574 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:14,609 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:20,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:20,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:20,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920739465]
[2024-06-04 18:03:20,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920739465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:20,081 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:20,081 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:03:20,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615012722]
[2024-06-04 18:03:20,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:20,082 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:03:20,082 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:20,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:03:20,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:03:20,210 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:20,211 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 616 flow. Second operand  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:20,211 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:20,211 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:20,211 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:20,894 INFO  L124   PetriNetUnfolderBase]: 1486/2255 cut-off events.
[2024-06-04 18:03:20,895 INFO  L125   PetriNetUnfolderBase]: For 13179/13179 co-relation queries the response was YES.
[2024-06-04 18:03:20,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9985 conditions, 2255 events. 1486/2255 cut-off events. For 13179/13179 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10327 event pairs, 503 based on Foata normal form. 2/2256 useless extension candidates. Maximal degree in co-relation 9949. Up to 2197 conditions per place. 
[2024-06-04 18:03:20,908 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 74 selfloop transitions, 16 changer transitions 0/93 dead transitions.
[2024-06-04 18:03:20,909 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 93 transitions, 838 flow
[2024-06-04 18:03:20,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:03:20,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:03:20,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-04 18:03:20,930 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-04 18:03:20,930 INFO  L175             Difference]: Start difference. First operand has 76 places, 77 transitions, 616 flow. Second operand 6 states and 97 transitions.
[2024-06-04 18:03:20,930 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 93 transitions, 838 flow
[2024-06-04 18:03:20,944 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 93 transitions, 801 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-04 18:03:20,946 INFO  L231             Difference]: Finished difference. Result has 78 places, 77 transitions, 623 flow
[2024-06-04 18:03:20,947 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=623, PETRI_PLACES=78, PETRI_TRANSITIONS=77}
[2024-06-04 18:03:20,947 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places.
[2024-06-04 18:03:20,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 623 flow
[2024-06-04 18:03:20,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:20,948 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:20,948 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:20,948 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-04 18:03:20,948 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:20,949 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:20,949 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539740350, now seen corresponding path program 1 times
[2024-06-04 18:03:20,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:20,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118799091]
[2024-06-04 18:03:20,950 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:20,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:20,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:26,740 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:26,740 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:26,740 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118799091]
[2024-06-04 18:03:26,741 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118799091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:26,741 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:26,741 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:03:26,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583626711]
[2024-06-04 18:03:26,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:26,741 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:03:26,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:26,742 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:03:26,742 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:03:26,852 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:26,853 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 623 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 18:03:26,853 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:26,853 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:26,853 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:27,623 INFO  L124   PetriNetUnfolderBase]: 1508/2288 cut-off events.
[2024-06-04 18:03:27,623 INFO  L125   PetriNetUnfolderBase]: For 15329/15331 co-relation queries the response was YES.
[2024-06-04 18:03:27,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 2288 events. 1508/2288 cut-off events. For 15329/15331 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10506 event pairs, 430 based on Foata normal form. 4/2291 useless extension candidates. Maximal degree in co-relation 10260. Up to 2023 conditions per place. 
[2024-06-04 18:03:27,636 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 36 changer transitions 0/115 dead transitions.
[2024-06-04 18:03:27,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 115 transitions, 1067 flow
[2024-06-04 18:03:27,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:03:27,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:03:27,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-04 18:03:27,638 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45357142857142857
[2024-06-04 18:03:27,638 INFO  L175             Difference]: Start difference. First operand has 78 places, 77 transitions, 623 flow. Second operand 7 states and 127 transitions.
[2024-06-04 18:03:27,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 115 transitions, 1067 flow
[2024-06-04 18:03:27,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 1025 flow, removed 1 selfloop flow, removed 5 redundant places.
[2024-06-04 18:03:27,657 INFO  L231             Difference]: Finished difference. Result has 80 places, 83 transitions, 715 flow
[2024-06-04 18:03:27,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=715, PETRI_PLACES=80, PETRI_TRANSITIONS=83}
[2024-06-04 18:03:27,658 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places.
[2024-06-04 18:03:27,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 715 flow
[2024-06-04 18:03:27,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 18:03:27,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:27,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:27,659 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-04 18:03:27,659 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:27,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:27,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539650140, now seen corresponding path program 2 times
[2024-06-04 18:03:27,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:27,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778765289]
[2024-06-04 18:03:27,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:27,660 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:27,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:33,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:33,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:33,141 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778765289]
[2024-06-04 18:03:33,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778765289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:33,141 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:33,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:03:33,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15528652]
[2024-06-04 18:03:33,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:33,141 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:03:33,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:33,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:03:33,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:03:33,296 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:33,296 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 715 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 18:03:33,296 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:33,296 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:33,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:34,048 INFO  L124   PetriNetUnfolderBase]: 1498/2274 cut-off events.
[2024-06-04 18:03:34,048 INFO  L125   PetriNetUnfolderBase]: For 17845/17847 co-relation queries the response was YES.
[2024-06-04 18:03:34,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10775 conditions, 2274 events. 1498/2274 cut-off events. For 17845/17847 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10409 event pairs, 440 based on Foata normal form. 4/2277 useless extension candidates. Maximal degree in co-relation 10737. Up to 2082 conditions per place. 
[2024-06-04 18:03:34,060 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 78 selfloop transitions, 29 changer transitions 0/110 dead transitions.
[2024-06-04 18:03:34,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 110 transitions, 1049 flow
[2024-06-04 18:03:34,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:03:34,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:03:34,061 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 18:03:34,061 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-04 18:03:34,061 INFO  L175             Difference]: Start difference. First operand has 80 places, 83 transitions, 715 flow. Second operand 7 states and 122 transitions.
[2024-06-04 18:03:34,062 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 110 transitions, 1049 flow
[2024-06-04 18:03:34,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 110 transitions, 998 flow, removed 12 selfloop flow, removed 3 redundant places.
[2024-06-04 18:03:34,078 INFO  L231             Difference]: Finished difference. Result has 84 places, 83 transitions, 730 flow
[2024-06-04 18:03:34,078 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=730, PETRI_PLACES=84, PETRI_TRANSITIONS=83}
[2024-06-04 18:03:34,079 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places.
[2024-06-04 18:03:34,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 730 flow
[2024-06-04 18:03:34,079 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 18:03:34,079 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:34,079 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:34,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-04 18:03:34,080 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-04 18:03:34,080 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:34,080 INFO  L85        PathProgramCache]: Analyzing trace with hash -1219545762, now seen corresponding path program 1 times
[2024-06-04 18:03:34,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:34,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874778078]
[2024-06-04 18:03:34,080 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:34,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:34,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:39,794 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:39,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:39,795 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874778078]
[2024-06-04 18:03:39,795 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874778078] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:39,795 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:39,795 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:03:39,795 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251227232]
[2024-06-04 18:03:39,795 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:39,796 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:03:39,796 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:39,796 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:03:39,796 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:03:39,923 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:39,923 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 730 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:39,923 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:39,923 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:39,923 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:40,768 INFO  L124   PetriNetUnfolderBase]: 1532/2328 cut-off events.
[2024-06-04 18:03:40,769 INFO  L125   PetriNetUnfolderBase]: For 20657/20659 co-relation queries the response was YES.
[2024-06-04 18:03:40,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11258 conditions, 2328 events. 1532/2328 cut-off events. For 20657/20659 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10777 event pairs, 428 based on Foata normal form. 10/2337 useless extension candidates. Maximal degree in co-relation 11218. Up to 2152 conditions per place. 
[2024-06-04 18:03:40,779 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 86 selfloop transitions, 22 changer transitions 0/111 dead transitions.
[2024-06-04 18:03:40,779 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 111 transitions, 1038 flow
[2024-06-04 18:03:40,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:03:40,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:03:40,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 18:03:40,790 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:03:40,790 INFO  L175             Difference]: Start difference. First operand has 84 places, 83 transitions, 730 flow. Second operand 7 states and 119 transitions.
[2024-06-04 18:03:40,790 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 111 transitions, 1038 flow
[2024-06-04 18:03:40,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 111 transitions, 959 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-06-04 18:03:40,804 INFO  L231             Difference]: Finished difference. Result has 85 places, 86 transitions, 735 flow
[2024-06-04 18:03:40,804 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=735, PETRI_PLACES=85, PETRI_TRANSITIONS=86}
[2024-06-04 18:03:40,805 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places.
[2024-06-04 18:03:40,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 86 transitions, 735 flow
[2024-06-04 18:03:40,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:40,805 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:40,805 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:40,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-04 18:03:40,806 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:40,806 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:40,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -1871196791, now seen corresponding path program 1 times
[2024-06-04 18:03:40,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:40,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659028553]
[2024-06-04 18:03:40,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:40,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:40,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:46,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:46,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:46,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659028553]
[2024-06-04 18:03:46,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659028553] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:46,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:46,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:03:46,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562480417]
[2024-06-04 18:03:46,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:46,632 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:03:46,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:46,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:03:46,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:03:46,796 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:46,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 86 transitions, 735 flow. Second operand  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 18:03:46,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:46,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:46,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:47,498 INFO  L124   PetriNetUnfolderBase]: 1512/2288 cut-off events.
[2024-06-04 18:03:47,499 INFO  L125   PetriNetUnfolderBase]: For 22651/22653 co-relation queries the response was YES.
[2024-06-04 18:03:47,504 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11404 conditions, 2288 events. 1512/2288 cut-off events. For 22651/22653 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10416 event pairs, 437 based on Foata normal form. 2/2289 useless extension candidates. Maximal degree in co-relation 11363. Up to 2121 conditions per place. 
[2024-06-04 18:03:47,510 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 78 selfloop transitions, 28 changer transitions 0/109 dead transitions.
[2024-06-04 18:03:47,510 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 109 transitions, 1009 flow
[2024-06-04 18:03:47,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:03:47,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:03:47,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-04 18:03:47,512 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-04 18:03:47,512 INFO  L175             Difference]: Start difference. First operand has 85 places, 86 transitions, 735 flow. Second operand 6 states and 108 transitions.
[2024-06-04 18:03:47,513 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 109 transitions, 1009 flow
[2024-06-04 18:03:47,528 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 109 transitions, 945 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 18:03:47,533 INFO  L231             Difference]: Finished difference. Result has 86 places, 86 transitions, 742 flow
[2024-06-04 18:03:47,533 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=86, PETRI_TRANSITIONS=86}
[2024-06-04 18:03:47,534 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places.
[2024-06-04 18:03:47,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 742 flow
[2024-06-04 18:03:47,534 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 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-04 18:03:47,534 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:47,534 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:47,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-04 18:03:47,535 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:47,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:47,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -1870929664, now seen corresponding path program 2 times
[2024-06-04 18:03:47,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:47,535 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651071152]
[2024-06-04 18:03:47,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:47,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:47,580 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:03:53,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:03:53,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:03:53,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651071152]
[2024-06-04 18:03:53,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651071152] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:03:53,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:03:53,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:03:53,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264959668]
[2024-06-04 18:03:53,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:03:53,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:03:53,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:03:53,484 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:03:53,484 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:03:53,636 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:03:53,637 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 742 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:53,637 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:03:53,637 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:03:53,637 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:03:54,452 INFO  L124   PetriNetUnfolderBase]: 1529/2314 cut-off events.
[2024-06-04 18:03:54,452 INFO  L125   PetriNetUnfolderBase]: For 25661/25661 co-relation queries the response was YES.
[2024-06-04 18:03:54,457 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11677 conditions, 2314 events. 1529/2314 cut-off events. For 25661/25661 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10494 event pairs, 464 based on Foata normal form. 4/2317 useless extension candidates. Maximal degree in co-relation 11635. Up to 2242 conditions per place. 
[2024-06-04 18:03:54,463 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 92 selfloop transitions, 14 changer transitions 0/109 dead transitions.
[2024-06-04 18:03:54,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 109 transitions, 1030 flow
[2024-06-04 18:03:54,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:03:54,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:03:54,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-04 18:03:54,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-04 18:03:54,465 INFO  L175             Difference]: Start difference. First operand has 86 places, 86 transitions, 742 flow. Second operand 7 states and 110 transitions.
[2024-06-04 18:03:54,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 109 transitions, 1030 flow
[2024-06-04 18:03:54,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-04 18:03:54,480 INFO  L231             Difference]: Finished difference. Result has 88 places, 88 transitions, 749 flow
[2024-06-04 18:03:54,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=88, PETRI_TRANSITIONS=88}
[2024-06-04 18:03:54,480 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places.
[2024-06-04 18:03:54,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 749 flow
[2024-06-04 18:03:54,480 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:03:54,481 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:03:54,481 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:03:54,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-04 18:03:54,481 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:03:54,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:03:54,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -16084288, now seen corresponding path program 3 times
[2024-06-04 18:03:54,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:03:54,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004418991]
[2024-06-04 18:03:54,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:03:54,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:03:54,514 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:00,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:00,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:00,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004418991]
[2024-06-04 18:04:00,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004418991] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:00,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:00,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:00,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872026547]
[2024-06-04 18:04:00,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:00,593 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:00,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:00,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:00,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:00,756 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:00,757 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 749 flow. Second operand  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:00,757 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:00,757 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:00,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:01,545 INFO  L124   PetriNetUnfolderBase]: 1521/2302 cut-off events.
[2024-06-04 18:04:01,545 INFO  L125   PetriNetUnfolderBase]: For 28063/28063 co-relation queries the response was YES.
[2024-06-04 18:04:01,550 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11782 conditions, 2302 events. 1521/2302 cut-off events. For 28063/28063 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10457 event pairs, 482 based on Foata normal form. 4/2305 useless extension candidates. Maximal degree in co-relation 11739. Up to 2221 conditions per place. 
[2024-06-04 18:04:01,557 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 90 selfloop transitions, 18 changer transitions 0/111 dead transitions.
[2024-06-04 18:04:01,557 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 111 transitions, 1047 flow
[2024-06-04 18:04:01,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:01,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:01,560 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-04 18:04:01,560 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-04 18:04:01,560 INFO  L175             Difference]: Start difference. First operand has 88 places, 88 transitions, 749 flow. Second operand 7 states and 111 transitions.
[2024-06-04 18:04:01,560 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 111 transitions, 1047 flow
[2024-06-04 18:04:01,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 111 transitions, 1002 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-04 18:04:01,578 INFO  L231             Difference]: Finished difference. Result has 90 places, 90 transitions, 780 flow
[2024-06-04 18:04:01,578 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=780, PETRI_PLACES=90, PETRI_TRANSITIONS=90}
[2024-06-04 18:04:01,579 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2024-06-04 18:04:01,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 90 transitions, 780 flow
[2024-06-04 18:04:01,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:01,579 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:01,579 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:01,579 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-04 18:04:01,580 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:01,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:01,580 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987259388, now seen corresponding path program 1 times
[2024-06-04 18:04:01,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:01,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922648051]
[2024-06-04 18:04:01,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:01,580 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:01,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:10,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:10,067 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:10,067 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922648051]
[2024-06-04 18:04:10,067 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922648051] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:10,067 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:10,067 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:04:10,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287997176]
[2024-06-04 18:04:10,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:10,068 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:04:10,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:10,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:04:10,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:04:10,166 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:10,167 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 780 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:10,168 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:10,168 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:10,168 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:10,894 INFO  L124   PetriNetUnfolderBase]: 1515/2294 cut-off events.
[2024-06-04 18:04:10,895 INFO  L125   PetriNetUnfolderBase]: For 30600/30600 co-relation queries the response was YES.
[2024-06-04 18:04:10,901 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11972 conditions, 2294 events. 1515/2294 cut-off events. For 30600/30600 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10351 event pairs, 481 based on Foata normal form. 2/2295 useless extension candidates. Maximal degree in co-relation 11928. Up to 2272 conditions per place. 
[2024-06-04 18:04:10,910 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 89 selfloop transitions, 10 changer transitions 0/102 dead transitions.
[2024-06-04 18:04:10,910 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 102 transitions, 1024 flow
[2024-06-04 18:04:10,911 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:04:10,911 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:04:10,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions.
[2024-06-04 18:04:10,911 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.395
[2024-06-04 18:04:10,911 INFO  L175             Difference]: Start difference. First operand has 90 places, 90 transitions, 780 flow. Second operand 5 states and 79 transitions.
[2024-06-04 18:04:10,911 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 102 transitions, 1024 flow
[2024-06-04 18:04:10,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 968 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-04 18:04:10,936 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 780 flow
[2024-06-04 18:04:10,937 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=780, PETRI_PLACES=90, PETRI_TRANSITIONS=93}
[2024-06-04 18:04:10,937 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places.
[2024-06-04 18:04:10,937 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 780 flow
[2024-06-04 18:04:10,937 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:10,937 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:10,938 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:10,938 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-04 18:04:10,938 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-04 18:04:10,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:10,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 730513050, now seen corresponding path program 1 times
[2024-06-04 18:04:10,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:10,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893807608]
[2024-06-04 18:04:10,939 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:10,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:10,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:16,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:16,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:16,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893807608]
[2024-06-04 18:04:16,975 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893807608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:16,975 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:16,975 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:16,975 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028526448]
[2024-06-04 18:04:16,975 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:16,975 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:16,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:16,977 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:16,977 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:17,156 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:17,156 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 780 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:17,157 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:17,157 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:17,157 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:18,071 INFO  L124   PetriNetUnfolderBase]: 1692/2594 cut-off events.
[2024-06-04 18:04:18,072 INFO  L125   PetriNetUnfolderBase]: For 38054/38056 co-relation queries the response was YES.
[2024-06-04 18:04:18,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13569 conditions, 2594 events. 1692/2594 cut-off events. For 38054/38056 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12408 event pairs, 293 based on Foata normal form. 18/2611 useless extension candidates. Maximal degree in co-relation 13524. Up to 1952 conditions per place. 
[2024-06-04 18:04:18,084 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 107 selfloop transitions, 29 changer transitions 0/139 dead transitions.
[2024-06-04 18:04:18,084 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 139 transitions, 1301 flow
[2024-06-04 18:04:18,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:04:18,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:04:18,090 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-04 18:04:18,091 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.446875
[2024-06-04 18:04:18,091 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 780 flow. Second operand 8 states and 143 transitions.
[2024-06-04 18:04:18,091 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 139 transitions, 1301 flow
[2024-06-04 18:04:18,112 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1267 flow, removed 9 selfloop flow, removed 3 redundant places.
[2024-06-04 18:04:18,113 INFO  L231             Difference]: Finished difference. Result has 96 places, 96 transitions, 866 flow
[2024-06-04 18:04:18,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=866, PETRI_PLACES=96, PETRI_TRANSITIONS=96}
[2024-06-04 18:04:18,114 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 55 predicate places.
[2024-06-04 18:04:18,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 866 flow
[2024-06-04 18:04:18,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:18,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:18,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:18,115 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-04 18:04:18,115 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-04 18:04:18,115 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:18,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 730515840, now seen corresponding path program 2 times
[2024-06-04 18:04:18,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:18,115 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996657189]
[2024-06-04 18:04:18,115 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:18,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:18,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:25,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:25,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:25,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996657189]
[2024-06-04 18:04:25,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996657189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:25,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:25,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:25,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068414569]
[2024-06-04 18:04:25,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:25,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:25,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:25,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:25,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:25,578 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:25,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 866 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:25,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:25,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:25,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:26,541 INFO  L124   PetriNetUnfolderBase]: 1697/2609 cut-off events.
[2024-06-04 18:04:26,541 INFO  L125   PetriNetUnfolderBase]: For 41545/41547 co-relation queries the response was YES.
[2024-06-04 18:04:26,547 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13725 conditions, 2609 events. 1697/2609 cut-off events. For 41545/41547 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12525 event pairs, 444 based on Foata normal form. 34/2642 useless extension candidates. Maximal degree in co-relation 13678. Up to 2150 conditions per place. 
[2024-06-04 18:04:26,553 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 103 selfloop transitions, 33 changer transitions 0/139 dead transitions.
[2024-06-04 18:04:26,553 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 139 transitions, 1284 flow
[2024-06-04 18:04:26,555 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:04:26,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:04:26,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions.
[2024-06-04 18:04:26,556 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4361111111111111
[2024-06-04 18:04:26,556 INFO  L175             Difference]: Start difference. First operand has 96 places, 96 transitions, 866 flow. Second operand 9 states and 157 transitions.
[2024-06-04 18:04:26,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 139 transitions, 1284 flow
[2024-06-04 18:04:26,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 139 transitions, 1238 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-04 18:04:26,589 INFO  L231             Difference]: Finished difference. Result has 101 places, 97 transitions, 921 flow
[2024-06-04 18:04:26,589 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=921, PETRI_PLACES=101, PETRI_TRANSITIONS=97}
[2024-06-04 18:04:26,589 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places.
[2024-06-04 18:04:26,590 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 97 transitions, 921 flow
[2024-06-04 18:04:26,590 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:26,590 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:26,590 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:26,590 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-04 18:04:26,590 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-04 18:04:26,591 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:26,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 848781460, now seen corresponding path program 1 times
[2024-06-04 18:04:26,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:26,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108088448]
[2024-06-04 18:04:26,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:26,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:26,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:32,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:32,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:32,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108088448]
[2024-06-04 18:04:32,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108088448] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:32,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:32,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:32,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435858570]
[2024-06-04 18:04:32,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:32,288 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:32,288 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:32,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:32,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:32,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:32,389 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 921 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:32,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:32,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:32,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:33,223 INFO  L124   PetriNetUnfolderBase]: 1714/2636 cut-off events.
[2024-06-04 18:04:33,223 INFO  L125   PetriNetUnfolderBase]: For 40089/40091 co-relation queries the response was YES.
[2024-06-04 18:04:33,230 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14138 conditions, 2636 events. 1714/2636 cut-off events. For 40089/40091 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12686 event pairs, 471 based on Foata normal form. 6/2641 useless extension candidates. Maximal degree in co-relation 14089. Up to 2478 conditions per place. 
[2024-06-04 18:04:33,238 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 102 selfloop transitions, 22 changer transitions 0/127 dead transitions.
[2024-06-04 18:04:33,239 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 127 transitions, 1273 flow
[2024-06-04 18:04:33,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:33,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:33,241 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-04 18:04:33,241 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-04 18:04:33,241 INFO  L175             Difference]: Start difference. First operand has 101 places, 97 transitions, 921 flow. Second operand 7 states and 121 transitions.
[2024-06-04 18:04:33,241 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 127 transitions, 1273 flow
[2024-06-04 18:04:33,268 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 127 transitions, 1210 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-04 18:04:33,271 INFO  L231             Difference]: Finished difference. Result has 101 places, 99 transitions, 943 flow
[2024-06-04 18:04:33,272 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=943, PETRI_PLACES=101, PETRI_TRANSITIONS=99}
[2024-06-04 18:04:33,272 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 60 predicate places.
[2024-06-04 18:04:33,272 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 943 flow
[2024-06-04 18:04:33,272 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:33,273 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:33,273 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:33,273 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-04 18:04:33,273 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:33,274 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:33,274 INFO  L85        PathProgramCache]: Analyzing trace with hash -369037474, now seen corresponding path program 2 times
[2024-06-04 18:04:33,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:33,274 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784399993]
[2024-06-04 18:04:33,274 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:33,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:33,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:38,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:38,315 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:38,315 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784399993]
[2024-06-04 18:04:38,315 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784399993] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:38,315 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:38,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:38,316 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809829700]
[2024-06-04 18:04:38,316 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:38,316 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:38,316 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:38,317 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:38,317 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:38,479 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:38,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 943 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:38,479 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:38,479 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:38,479 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:39,301 INFO  L124   PetriNetUnfolderBase]: 1748/2690 cut-off events.
[2024-06-04 18:04:39,301 INFO  L125   PetriNetUnfolderBase]: For 44086/44088 co-relation queries the response was YES.
[2024-06-04 18:04:39,308 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14551 conditions, 2690 events. 1748/2690 cut-off events. For 44086/44088 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13044 event pairs, 467 based on Foata normal form. 6/2695 useless extension candidates. Maximal degree in co-relation 14501. Up to 2445 conditions per place. 
[2024-06-04 18:04:39,315 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 100 selfloop transitions, 25 changer transitions 0/128 dead transitions.
[2024-06-04 18:04:39,316 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 128 transitions, 1299 flow
[2024-06-04 18:04:39,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:39,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:39,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions.
[2024-06-04 18:04:39,318 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41785714285714287
[2024-06-04 18:04:39,318 INFO  L175             Difference]: Start difference. First operand has 101 places, 99 transitions, 943 flow. Second operand 7 states and 117 transitions.
[2024-06-04 18:04:39,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 128 transitions, 1299 flow
[2024-06-04 18:04:39,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 128 transitions, 1232 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-04 18:04:39,351 INFO  L231             Difference]: Finished difference. Result has 104 places, 103 transitions, 994 flow
[2024-06-04 18:04:39,351 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=994, PETRI_PLACES=104, PETRI_TRANSITIONS=103}
[2024-06-04 18:04:39,352 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 63 predicate places.
[2024-06-04 18:04:39,352 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 103 transitions, 994 flow
[2024-06-04 18:04:39,352 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:39,352 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:39,352 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:39,352 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-04 18:04:39,352 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:39,353 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:39,353 INFO  L85        PathProgramCache]: Analyzing trace with hash 2130723488, now seen corresponding path program 3 times
[2024-06-04 18:04:39,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:39,353 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833027627]
[2024-06-04 18:04:39,353 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:39,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:39,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:45,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:45,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:45,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833027627]
[2024-06-04 18:04:45,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833027627] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:45,068 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:45,068 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:45,068 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570165369]
[2024-06-04 18:04:45,068 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:45,069 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:45,069 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:45,069 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:45,069 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:45,187 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:45,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 994 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:45,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:45,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:45,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:45,948 INFO  L124   PetriNetUnfolderBase]: 1765/2717 cut-off events.
[2024-06-04 18:04:45,948 INFO  L125   PetriNetUnfolderBase]: For 48545/48547 co-relation queries the response was YES.
[2024-06-04 18:04:45,960 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15026 conditions, 2717 events. 1765/2717 cut-off events. For 48545/48547 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13126 event pairs, 520 based on Foata normal form. 4/2720 useless extension candidates. Maximal degree in co-relation 14974. Up to 2621 conditions per place. 
[2024-06-04 18:04:45,969 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 109 selfloop transitions, 15 changer transitions 0/127 dead transitions.
[2024-06-04 18:04:45,969 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 127 transitions, 1334 flow
[2024-06-04 18:04:45,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:45,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:45,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-04 18:04:45,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3964285714285714
[2024-06-04 18:04:45,971 INFO  L175             Difference]: Start difference. First operand has 104 places, 103 transitions, 994 flow. Second operand 7 states and 111 transitions.
[2024-06-04 18:04:45,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 127 transitions, 1334 flow
[2024-06-04 18:04:46,008 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 127 transitions, 1268 flow, removed 15 selfloop flow, removed 4 redundant places.
[2024-06-04 18:04:46,016 INFO  L231             Difference]: Finished difference. Result has 107 places, 105 transitions, 1007 flow
[2024-06-04 18:04:46,017 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1007, PETRI_PLACES=107, PETRI_TRANSITIONS=105}
[2024-06-04 18:04:46,017 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 66 predicate places.
[2024-06-04 18:04:46,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 1007 flow
[2024-06-04 18:04:46,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:46,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:46,017 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:46,017 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-04 18:04:46,018 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-04 18:04:46,018 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:46,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 2122449278, now seen corresponding path program 4 times
[2024-06-04 18:04:46,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:46,018 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523240748]
[2024-06-04 18:04:46,018 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:46,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:46,053 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:51,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:51,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:51,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523240748]
[2024-06-04 18:04:51,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523240748] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:51,804 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:51,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:51,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823126721]
[2024-06-04 18:04:51,804 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:51,808 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:51,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:51,808 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:51,808 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:51,914 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:51,915 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 1007 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:51,915 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:51,915 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:51,915 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:52,829 INFO  L124   PetriNetUnfolderBase]: 1782/2744 cut-off events.
[2024-06-04 18:04:52,829 INFO  L125   PetriNetUnfolderBase]: For 52968/52970 co-relation queries the response was YES.
[2024-06-04 18:04:52,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15353 conditions, 2744 events. 1782/2744 cut-off events. For 52968/52970 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13362 event pairs, 471 based on Foata normal form. 4/2747 useless extension candidates. Maximal degree in co-relation 15300. Up to 2407 conditions per place. 
[2024-06-04 18:04:52,844 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 95 selfloop transitions, 38 changer transitions 0/136 dead transitions.
[2024-06-04 18:04:52,844 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 136 transitions, 1515 flow
[2024-06-04 18:04:52,846 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:52,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:52,846 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-04 18:04:52,846 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-04 18:04:52,847 INFO  L175             Difference]: Start difference. First operand has 107 places, 105 transitions, 1007 flow. Second operand 7 states and 120 transitions.
[2024-06-04 18:04:52,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 136 transitions, 1515 flow
[2024-06-04 18:04:52,889 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 136 transitions, 1454 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-04 18:04:52,891 INFO  L231             Difference]: Finished difference. Result has 109 places, 109 transitions, 1121 flow
[2024-06-04 18:04:52,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1121, PETRI_PLACES=109, PETRI_TRANSITIONS=109}
[2024-06-04 18:04:52,892 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 68 predicate places.
[2024-06-04 18:04:52,892 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 1121 flow
[2024-06-04 18:04:52,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:52,892 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:52,892 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:52,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-04 18:04:52,893 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-04 18:04:52,893 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:52,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 2122442768, now seen corresponding path program 5 times
[2024-06-04 18:04:52,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:52,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429234531]
[2024-06-04 18:04:52,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:52,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:52,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:04:58,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:04:58,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:04:58,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429234531]
[2024-06-04 18:04:58,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429234531] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:04:58,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:04:58,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:04:58,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164101705]
[2024-06-04 18:04:58,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:04:58,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:04:58,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:04:58,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:04:58,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:04:58,757 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:04:58,758 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 1121 flow. Second operand  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:58,758 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:04:58,758 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:04:58,758 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:04:59,625 INFO  L124   PetriNetUnfolderBase]: 1774/2732 cut-off events.
[2024-06-04 18:04:59,625 INFO  L125   PetriNetUnfolderBase]: For 56111/56113 co-relation queries the response was YES.
[2024-06-04 18:04:59,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15538 conditions, 2732 events. 1774/2732 cut-off events. For 56111/56113 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13256 event pairs, 483 based on Foata normal form. 4/2735 useless extension candidates. Maximal degree in co-relation 15484. Up to 2529 conditions per place. 
[2024-06-04 18:04:59,642 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 102 selfloop transitions, 32 changer transitions 0/137 dead transitions.
[2024-06-04 18:04:59,642 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 137 transitions, 1463 flow
[2024-06-04 18:04:59,643 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:04:59,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:04:59,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-04 18:04:59,648 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4357142857142857
[2024-06-04 18:04:59,648 INFO  L175             Difference]: Start difference. First operand has 109 places, 109 transitions, 1121 flow. Second operand 7 states and 122 transitions.
[2024-06-04 18:04:59,648 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 137 transitions, 1463 flow
[2024-06-04 18:04:59,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 137 transitions, 1363 flow, removed 31 selfloop flow, removed 4 redundant places.
[2024-06-04 18:04:59,705 INFO  L231             Difference]: Finished difference. Result has 112 places, 109 transitions, 1095 flow
[2024-06-04 18:04:59,705 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1095, PETRI_PLACES=112, PETRI_TRANSITIONS=109}
[2024-06-04 18:04:59,705 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 71 predicate places.
[2024-06-04 18:04:59,705 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 109 transitions, 1095 flow
[2024-06-04 18:04:59,705 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:04:59,706 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:04:59,706 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:04:59,706 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-04 18:04:59,706 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:04:59,706 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:04:59,706 INFO  L85        PathProgramCache]: Analyzing trace with hash 1454079852, now seen corresponding path program 1 times
[2024-06-04 18:04:59,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:04:59,707 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341495647]
[2024-06-04 18:04:59,707 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:04:59,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:04:59,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:08,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:08,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:08,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341495647]
[2024-06-04 18:05:08,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341495647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:08,838 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:08,838 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:08,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016107803]
[2024-06-04 18:05:08,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:08,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:08,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:08,839 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:08,839 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:08,934 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:05:08,935 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 109 transitions, 1095 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:08,935 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:08,935 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:05:08,935 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:09,762 INFO  L124   PetriNetUnfolderBase]: 1784/2767 cut-off events.
[2024-06-04 18:05:09,763 INFO  L125   PetriNetUnfolderBase]: For 59036/59036 co-relation queries the response was YES.
[2024-06-04 18:05:09,770 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 2767 events. 1784/2767 cut-off events. For 59036/59036 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13707 event pairs, 924 based on Foata normal form. 2/2768 useless extension candidates. Maximal degree in co-relation 15626. Up to 2694 conditions per place. 
[2024-06-04 18:05:09,777 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 108 selfloop transitions, 20 changer transitions 0/131 dead transitions.
[2024-06-04 18:05:09,777 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 131 transitions, 1514 flow
[2024-06-04 18:05:09,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:05:09,778 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:05:09,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions.
[2024-06-04 18:05:09,778 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37142857142857144
[2024-06-04 18:05:09,778 INFO  L175             Difference]: Start difference. First operand has 112 places, 109 transitions, 1095 flow. Second operand 7 states and 104 transitions.
[2024-06-04 18:05:09,778 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 131 transitions, 1514 flow
[2024-06-04 18:05:09,835 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 131 transitions, 1430 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-04 18:05:09,837 INFO  L231             Difference]: Finished difference. Result has 114 places, 117 transitions, 1144 flow
[2024-06-04 18:05:09,837 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1144, PETRI_PLACES=114, PETRI_TRANSITIONS=117}
[2024-06-04 18:05:09,837 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 73 predicate places.
[2024-06-04 18:05:09,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 117 transitions, 1144 flow
[2024-06-04 18:05:09,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:09,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:09,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:09,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-04 18:05:09,838 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:09,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:09,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957123926, now seen corresponding path program 2 times
[2024-06-04 18:05:09,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:09,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222501561]
[2024-06-04 18:05:09,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:09,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:09,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:18,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:18,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:18,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222501561]
[2024-06-04 18:05:18,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222501561] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:18,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:18,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:05:18,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987170758]
[2024-06-04 18:05:18,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:18,472 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:05:18,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:18,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:05:18,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:05:18,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:05:18,569 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 117 transitions, 1144 flow. Second operand  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:18,569 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:18,569 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:05:18,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:19,572 INFO  L124   PetriNetUnfolderBase]: 1778/2759 cut-off events.
[2024-06-04 18:05:19,572 INFO  L125   PetriNetUnfolderBase]: For 62367/62367 co-relation queries the response was YES.
[2024-06-04 18:05:19,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15846 conditions, 2759 events. 1778/2759 cut-off events. For 62367/62367 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13661 event pairs, 923 based on Foata normal form. 2/2760 useless extension candidates. Maximal degree in co-relation 15789. Up to 2697 conditions per place. 
[2024-06-04 18:05:19,591 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 109 selfloop transitions, 16 changer transitions 0/128 dead transitions.
[2024-06-04 18:05:19,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 128 transitions, 1424 flow
[2024-06-04 18:05:19,593 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-04 18:05:19,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-04 18:05:19,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions.
[2024-06-04 18:05:19,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415
[2024-06-04 18:05:19,593 INFO  L175             Difference]: Start difference. First operand has 114 places, 117 transitions, 1144 flow. Second operand 5 states and 83 transitions.
[2024-06-04 18:05:19,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 128 transitions, 1424 flow
[2024-06-04 18:05:19,641 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 128 transitions, 1381 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-04 18:05:19,644 INFO  L231             Difference]: Finished difference. Result has 117 places, 117 transitions, 1145 flow
[2024-06-04 18:05:19,644 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1101, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1145, PETRI_PLACES=117, PETRI_TRANSITIONS=117}
[2024-06-04 18:05:19,645 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 76 predicate places.
[2024-06-04 18:05:19,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 1145 flow
[2024-06-04 18:05:19,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:19,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:19,645 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:19,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-04 18:05:19,645 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:19,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:19,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 936730022, now seen corresponding path program 1 times
[2024-06-04 18:05:19,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:19,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785798266]
[2024-06-04 18:05:19,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:19,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:19,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:27,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:27,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:27,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785798266]
[2024-06-04 18:05:27,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785798266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:27,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:27,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:27,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835570551]
[2024-06-04 18:05:27,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:27,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:27,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:27,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:27,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:28,054 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:05:28,055 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 117 transitions, 1145 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:28,055 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:28,055 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:05:28,055 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:28,970 INFO  L124   PetriNetUnfolderBase]: 1827/2815 cut-off events.
[2024-06-04 18:05:28,970 INFO  L125   PetriNetUnfolderBase]: For 66886/66894 co-relation queries the response was YES.
[2024-06-04 18:05:28,979 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16420 conditions, 2815 events. 1827/2815 cut-off events. For 66886/66894 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13827 event pairs, 502 based on Foata normal form. 11/2825 useless extension candidates. Maximal degree in co-relation 16361. Up to 2638 conditions per place. 
[2024-06-04 18:05:28,987 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 133 selfloop transitions, 39 changer transitions 0/175 dead transitions.
[2024-06-04 18:05:28,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 175 transitions, 1994 flow
[2024-06-04 18:05:28,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:05:28,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:05:28,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions.
[2024-06-04 18:05:28,988 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.434375
[2024-06-04 18:05:28,988 INFO  L175             Difference]: Start difference. First operand has 117 places, 117 transitions, 1145 flow. Second operand 8 states and 139 transitions.
[2024-06-04 18:05:28,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 175 transitions, 1994 flow
[2024-06-04 18:05:29,040 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 175 transitions, 1958 flow, removed 0 selfloop flow, removed 4 redundant places.
[2024-06-04 18:05:29,042 INFO  L231             Difference]: Finished difference. Result has 125 places, 144 transitions, 1563 flow
[2024-06-04 18:05:29,042 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1563, PETRI_PLACES=125, PETRI_TRANSITIONS=144}
[2024-06-04 18:05:29,043 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 84 predicate places.
[2024-06-04 18:05:29,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 144 transitions, 1563 flow
[2024-06-04 18:05:29,043 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:29,043 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:29,043 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:29,043 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-04 18:05:29,043 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:29,044 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:29,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 301568966, now seen corresponding path program 2 times
[2024-06-04 18:05:29,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:29,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218302590]
[2024-06-04 18:05:29,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:29,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:29,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:38,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:38,328 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:38,328 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218302590]
[2024-06-04 18:05:38,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218302590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:38,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:38,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:38,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076752800]
[2024-06-04 18:05:38,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:38,329 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:38,329 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:38,330 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:38,330 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:38,440 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:05:38,440 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 144 transitions, 1563 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:38,440 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:38,440 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:05:38,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:39,639 INFO  L124   PetriNetUnfolderBase]: 2043/3138 cut-off events.
[2024-06-04 18:05:39,639 INFO  L125   PetriNetUnfolderBase]: For 80221/80225 co-relation queries the response was YES.
[2024-06-04 18:05:39,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20340 conditions, 3138 events. 2043/3138 cut-off events. For 80221/80225 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15657 event pairs, 695 based on Foata normal form. 7/3144 useless extension candidates. Maximal degree in co-relation 20276. Up to 2769 conditions per place. 
[2024-06-04 18:05:39,661 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 152 selfloop transitions, 74 changer transitions 0/229 dead transitions.
[2024-06-04 18:05:39,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 229 transitions, 3074 flow
[2024-06-04 18:05:39,662 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:05:39,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:05:39,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-04 18:05:39,663 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.440625
[2024-06-04 18:05:39,663 INFO  L175             Difference]: Start difference. First operand has 125 places, 144 transitions, 1563 flow. Second operand 8 states and 141 transitions.
[2024-06-04 18:05:39,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 229 transitions, 3074 flow
[2024-06-04 18:05:39,750 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 229 transitions, 2970 flow, removed 51 selfloop flow, removed 1 redundant places.
[2024-06-04 18:05:39,753 INFO  L231             Difference]: Finished difference. Result has 135 places, 192 transitions, 2434 flow
[2024-06-04 18:05:39,753 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=1511, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2434, PETRI_PLACES=135, PETRI_TRANSITIONS=192}
[2024-06-04 18:05:39,754 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 94 predicate places.
[2024-06-04 18:05:39,755 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 192 transitions, 2434 flow
[2024-06-04 18:05:39,755 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:39,755 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:39,755 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:39,755 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-04 18:05:39,755 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:39,755 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:39,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 450142255, now seen corresponding path program 1 times
[2024-06-04 18:05:39,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:39,756 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633865659]
[2024-06-04 18:05:39,756 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:39,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:39,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:47,696 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:47,696 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:47,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633865659]
[2024-06-04 18:05:47,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633865659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:47,697 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:47,697 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:05:47,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815281220]
[2024-06-04 18:05:47,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:47,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:05:47,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:47,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:05:47,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:05:47,891 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:05:47,891 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 192 transitions, 2434 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:47,891 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:47,891 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:05:47,891 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:49,175 INFO  L124   PetriNetUnfolderBase]: 2101/3236 cut-off events.
[2024-06-04 18:05:49,175 INFO  L125   PetriNetUnfolderBase]: For 92031/92037 co-relation queries the response was YES.
[2024-06-04 18:05:49,187 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21905 conditions, 3236 events. 2101/3236 cut-off events. For 92031/92037 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16355 event pairs, 683 based on Foata normal form. 18/3253 useless extension candidates. Maximal degree in co-relation 21835. Up to 2913 conditions per place. 
[2024-06-04 18:05:49,199 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 191 selfloop transitions, 47 changer transitions 0/241 dead transitions.
[2024-06-04 18:05:49,199 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 241 transitions, 3215 flow
[2024-06-04 18:05:49,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:05:49,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:05:49,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-04 18:05:49,201 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-04 18:05:49,202 INFO  L175             Difference]: Start difference. First operand has 135 places, 192 transitions, 2434 flow. Second operand 9 states and 151 transitions.
[2024-06-04 18:05:49,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 241 transitions, 3215 flow
[2024-06-04 18:05:49,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 241 transitions, 3135 flow, removed 33 selfloop flow, removed 2 redundant places.
[2024-06-04 18:05:49,314 INFO  L231             Difference]: Finished difference. Result has 144 places, 203 transitions, 2640 flow
[2024-06-04 18:05:49,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2640, PETRI_PLACES=144, PETRI_TRANSITIONS=203}
[2024-06-04 18:05:49,315 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 103 predicate places.
[2024-06-04 18:05:49,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 203 transitions, 2640 flow
[2024-06-04 18:05:49,316 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:49,316 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:49,316 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:49,316 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-04 18:05:49,316 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:49,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:49,316 INFO  L85        PathProgramCache]: Analyzing trace with hash 455706445, now seen corresponding path program 2 times
[2024-06-04 18:05:49,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:49,317 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741117943]
[2024-06-04 18:05:49,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:49,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:49,351 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:05:57,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:05:57,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:05:57,575 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741117943]
[2024-06-04 18:05:57,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741117943] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:05:57,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:05:57,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:05:57,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214693631]
[2024-06-04 18:05:57,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:05:57,575 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:05:57,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:05:57,576 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:05:57,576 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:05:57,681 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:05:57,682 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 203 transitions, 2640 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:57,682 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:05:57,683 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:05:57,683 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:05:58,847 INFO  L124   PetriNetUnfolderBase]: 2243/3469 cut-off events.
[2024-06-04 18:05:58,847 INFO  L125   PetriNetUnfolderBase]: For 101323/101333 co-relation queries the response was YES.
[2024-06-04 18:05:58,861 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23647 conditions, 3469 events. 2243/3469 cut-off events. For 101323/101333 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17934 event pairs, 694 based on Foata normal form. 22/3490 useless extension candidates. Maximal degree in co-relation 23573. Up to 2982 conditions per place. 
[2024-06-04 18:05:58,873 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 194 selfloop transitions, 64 changer transitions 0/261 dead transitions.
[2024-06-04 18:05:58,874 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 261 transitions, 3598 flow
[2024-06-04 18:05:58,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:05:58,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:05:58,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-04 18:05:58,876 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 18:05:58,876 INFO  L175             Difference]: Start difference. First operand has 144 places, 203 transitions, 2640 flow. Second operand 9 states and 150 transitions.
[2024-06-04 18:05:58,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 261 transitions, 3598 flow
[2024-06-04 18:05:59,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 261 transitions, 3563 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-04 18:05:59,005 INFO  L231             Difference]: Finished difference. Result has 154 places, 222 transitions, 3070 flow
[2024-06-04 18:05:59,005 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2605, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3070, PETRI_PLACES=154, PETRI_TRANSITIONS=222}
[2024-06-04 18:05:59,005 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 113 predicate places.
[2024-06-04 18:05:59,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 222 transitions, 3070 flow
[2024-06-04 18:05:59,006 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:05:59,006 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:05:59,006 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:05:59,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-04 18:05:59,006 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:05:59,007 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:05:59,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 339374396, now seen corresponding path program 3 times
[2024-06-04 18:05:59,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:05:59,007 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952479956]
[2024-06-04 18:05:59,007 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:05:59,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:05:59,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:07,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:07,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:07,763 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952479956]
[2024-06-04 18:06:07,763 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952479956] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:07,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:07,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:07,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027741967]
[2024-06-04 18:06:07,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:07,764 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:07,764 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:07,768 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:07,773 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:07,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:07,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 222 transitions, 3070 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:07,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:07,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:07,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:09,071 INFO  L124   PetriNetUnfolderBase]: 2286/3522 cut-off events.
[2024-06-04 18:06:09,072 INFO  L125   PetriNetUnfolderBase]: For 105404/105408 co-relation queries the response was YES.
[2024-06-04 18:06:09,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24895 conditions, 3522 events. 2286/3522 cut-off events. For 105404/105408 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18210 event pairs, 796 based on Foata normal form. 7/3528 useless extension candidates. Maximal degree in co-relation 24816. Up to 3423 conditions per place. 
[2024-06-04 18:06:09,101 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 222 selfloop transitions, 34 changer transitions 0/259 dead transitions.
[2024-06-04 18:06:09,101 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 259 transitions, 3946 flow
[2024-06-04 18:06:09,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:06:09,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:06:09,102 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-04 18:06:09,102 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-04 18:06:09,102 INFO  L175             Difference]: Start difference. First operand has 154 places, 222 transitions, 3070 flow. Second operand 9 states and 138 transitions.
[2024-06-04 18:06:09,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 259 transitions, 3946 flow
[2024-06-04 18:06:09,250 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 259 transitions, 3857 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-04 18:06:09,254 INFO  L231             Difference]: Finished difference. Result has 162 places, 237 transitions, 3329 flow
[2024-06-04 18:06:09,255 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=2981, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3329, PETRI_PLACES=162, PETRI_TRANSITIONS=237}
[2024-06-04 18:06:09,255 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 121 predicate places.
[2024-06-04 18:06:09,255 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 237 transitions, 3329 flow
[2024-06-04 18:06:09,255 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:09,255 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:09,255 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:09,256 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-04 18:06:09,256 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:09,256 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:09,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 339374737, now seen corresponding path program 1 times
[2024-06-04 18:06:09,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:09,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303888711]
[2024-06-04 18:06:09,256 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:09,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:09,280 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:17,844 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:17,845 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:17,845 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303888711]
[2024-06-04 18:06:17,845 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303888711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:17,846 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:17,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:17,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418526089]
[2024-06-04 18:06:17,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:17,846 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:17,846 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:17,847 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:17,847 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:17,999 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:17,999 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 237 transitions, 3329 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:17,999 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:17,999 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:17,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:19,156 INFO  L124   PetriNetUnfolderBase]: 2296/3536 cut-off events.
[2024-06-04 18:06:19,156 INFO  L125   PetriNetUnfolderBase]: For 109497/109501 co-relation queries the response was YES.
[2024-06-04 18:06:19,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24968 conditions, 3536 events. 2296/3536 cut-off events. For 109497/109501 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 18240 event pairs, 797 based on Foata normal form. 6/3541 useless extension candidates. Maximal degree in co-relation 24886. Up to 3444 conditions per place. 
[2024-06-04 18:06:19,185 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 234 selfloop transitions, 28 changer transitions 0/265 dead transitions.
[2024-06-04 18:06:19,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 265 transitions, 4061 flow
[2024-06-04 18:06:19,186 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:06:19,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:06:19,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions.
[2024-06-04 18:06:19,186 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4
[2024-06-04 18:06:19,186 INFO  L175             Difference]: Start difference. First operand has 162 places, 237 transitions, 3329 flow. Second operand 8 states and 128 transitions.
[2024-06-04 18:06:19,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 265 transitions, 4061 flow
[2024-06-04 18:06:19,332 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 265 transitions, 3927 flow, removed 45 selfloop flow, removed 4 redundant places.
[2024-06-04 18:06:19,336 INFO  L231             Difference]: Finished difference. Result has 166 places, 243 transitions, 3339 flow
[2024-06-04 18:06:19,336 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3195, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3339, PETRI_PLACES=166, PETRI_TRANSITIONS=243}
[2024-06-04 18:06:19,336 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 125 predicate places.
[2024-06-04 18:06:19,336 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 243 transitions, 3339 flow
[2024-06-04 18:06:19,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:19,337 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:19,337 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:19,337 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-04 18:06:19,337 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:19,337 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:19,337 INFO  L85        PathProgramCache]: Analyzing trace with hash 395118670, now seen corresponding path program 4 times
[2024-06-04 18:06:19,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:19,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485456222]
[2024-06-04 18:06:19,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:19,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:19,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:25,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:25,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:25,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485456222]
[2024-06-04 18:06:25,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485456222] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:25,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:25,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:06:25,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579656469]
[2024-06-04 18:06:25,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:25,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:06:25,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:25,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:06:25,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:06:26,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:26,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 243 transitions, 3339 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:26,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:26,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:26,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:27,226 INFO  L124   PetriNetUnfolderBase]: 2335/3593 cut-off events.
[2024-06-04 18:06:27,226 INFO  L125   PetriNetUnfolderBase]: For 117737/117743 co-relation queries the response was YES.
[2024-06-04 18:06:27,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25726 conditions, 3593 events. 2335/3593 cut-off events. For 117737/117743 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 18610 event pairs, 726 based on Foata normal form. 9/3601 useless extension candidates. Maximal degree in co-relation 25643. Up to 3097 conditions per place. 
[2024-06-04 18:06:27,251 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 161 selfloop transitions, 118 changer transitions 0/282 dead transitions.
[2024-06-04 18:06:27,252 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 282 transitions, 4357 flow
[2024-06-04 18:06:27,252 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:06:27,252 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:06:27,252 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 18:06:27,252 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-04 18:06:27,252 INFO  L175             Difference]: Start difference. First operand has 166 places, 243 transitions, 3339 flow. Second operand 7 states and 124 transitions.
[2024-06-04 18:06:27,252 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 282 transitions, 4357 flow
[2024-06-04 18:06:27,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 282 transitions, 4303 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-04 18:06:27,421 INFO  L231             Difference]: Finished difference. Result has 170 places, 256 transitions, 3829 flow
[2024-06-04 18:06:27,421 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3285, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3829, PETRI_PLACES=170, PETRI_TRANSITIONS=256}
[2024-06-04 18:06:27,422 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 129 predicate places.
[2024-06-04 18:06:27,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 256 transitions, 3829 flow
[2024-06-04 18:06:27,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:27,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:27,422 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:27,422 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-04 18:06:27,422 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-04 18:06:27,422 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:27,422 INFO  L85        PathProgramCache]: Analyzing trace with hash 537060063, now seen corresponding path program 3 times
[2024-06-04 18:06:27,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:27,422 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562435200]
[2024-06-04 18:06:27,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:27,423 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:27,486 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:33,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:33,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:33,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562435200]
[2024-06-04 18:06:33,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562435200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:33,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:33,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:06:33,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223809356]
[2024-06-04 18:06:33,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:33,682 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:06:33,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:33,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:06:33,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:06:33,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:33,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 256 transitions, 3829 flow. Second operand  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:33,801 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:33,801 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:33,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:35,043 INFO  L124   PetriNetUnfolderBase]: 2352/3627 cut-off events.
[2024-06-04 18:06:35,044 INFO  L125   PetriNetUnfolderBase]: For 128341/128347 co-relation queries the response was YES.
[2024-06-04 18:06:35,059 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27065 conditions, 3627 events. 2352/3627 cut-off events. For 128341/128347 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18910 event pairs, 707 based on Foata normal form. 8/3634 useless extension candidates. Maximal degree in co-relation 26979. Up to 3165 conditions per place. 
[2024-06-04 18:06:35,074 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 208 selfloop transitions, 80 changer transitions 0/291 dead transitions.
[2024-06-04 18:06:35,074 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 291 transitions, 4591 flow
[2024-06-04 18:06:35,075 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:06:35,075 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:06:35,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions.
[2024-06-04 18:06:35,076 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:06:35,076 INFO  L175             Difference]: Start difference. First operand has 170 places, 256 transitions, 3829 flow. Second operand 8 states and 136 transitions.
[2024-06-04 18:06:35,076 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 291 transitions, 4591 flow
[2024-06-04 18:06:35,261 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 291 transitions, 4505 flow, removed 36 selfloop flow, removed 2 redundant places.
[2024-06-04 18:06:35,269 INFO  L231             Difference]: Finished difference. Result has 176 places, 259 transitions, 3971 flow
[2024-06-04 18:06:35,269 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3743, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3971, PETRI_PLACES=176, PETRI_TRANSITIONS=259}
[2024-06-04 18:06:35,269 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 135 predicate places.
[2024-06-04 18:06:35,270 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 259 transitions, 3971 flow
[2024-06-04 18:06:35,270 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:35,270 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:35,270 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:35,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-04 18:06:35,270 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-04 18:06:35,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:35,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 542624253, now seen corresponding path program 4 times
[2024-06-04 18:06:35,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:35,271 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622051953]
[2024-06-04 18:06:35,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:35,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:35,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:42,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:42,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:42,538 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622051953]
[2024-06-04 18:06:42,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622051953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:42,539 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:42,539 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:06:42,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245190331]
[2024-06-04 18:06:42,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:42,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:06:42,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:42,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:06:42,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:06:42,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:42,689 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 259 transitions, 3971 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:42,689 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:42,689 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:42,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:44,008 INFO  L124   PetriNetUnfolderBase]: 2393/3695 cut-off events.
[2024-06-04 18:06:44,009 INFO  L125   PetriNetUnfolderBase]: For 136555/136565 co-relation queries the response was YES.
[2024-06-04 18:06:44,023 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27748 conditions, 3695 events. 2393/3695 cut-off events. For 136555/136565 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 19358 event pairs, 688 based on Foata normal form. 22/3716 useless extension candidates. Maximal degree in co-relation 27660. Up to 3034 conditions per place. 
[2024-06-04 18:06:44,035 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 220 selfloop transitions, 69 changer transitions 0/292 dead transitions.
[2024-06-04 18:06:44,035 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 292 transitions, 4719 flow
[2024-06-04 18:06:44,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:06:44,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:06:44,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions.
[2024-06-04 18:06:44,038 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4125
[2024-06-04 18:06:44,038 INFO  L175             Difference]: Start difference. First operand has 176 places, 259 transitions, 3971 flow. Second operand 8 states and 132 transitions.
[2024-06-04 18:06:44,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 292 transitions, 4719 flow
[2024-06-04 18:06:44,202 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 292 transitions, 4526 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-04 18:06:44,206 INFO  L231             Difference]: Finished difference. Result has 178 places, 260 transitions, 3962 flow
[2024-06-04 18:06:44,206 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3778, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3962, PETRI_PLACES=178, PETRI_TRANSITIONS=260}
[2024-06-04 18:06:44,207 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 137 predicate places.
[2024-06-04 18:06:44,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 260 transitions, 3962 flow
[2024-06-04 18:06:44,207 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:44,207 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:44,207 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:44,207 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-04 18:06:44,207 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:44,208 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:44,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -533914788, now seen corresponding path program 5 times
[2024-06-04 18:06:44,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:44,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876250205]
[2024-06-04 18:06:44,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:44,208 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:44,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:51,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:51,260 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:51,260 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876250205]
[2024-06-04 18:06:51,260 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876250205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:51,260 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:51,260 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:06:51,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310374701]
[2024-06-04 18:06:51,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:51,260 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:06:51,261 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:51,261 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:06:51,261 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:06:51,412 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:51,413 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 260 transitions, 3962 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:51,413 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:51,413 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:51,413 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:06:52,803 INFO  L124   PetriNetUnfolderBase]: 2449/3766 cut-off events.
[2024-06-04 18:06:52,803 INFO  L125   PetriNetUnfolderBase]: For 139722/139726 co-relation queries the response was YES.
[2024-06-04 18:06:52,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28665 conditions, 3766 events. 2449/3766 cut-off events. For 139722/139726 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19718 event pairs, 815 based on Foata normal form. 7/3772 useless extension candidates. Maximal degree in co-relation 28576. Up to 3634 conditions per place. 
[2024-06-04 18:06:52,830 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 244 selfloop transitions, 49 changer transitions 0/296 dead transitions.
[2024-06-04 18:06:52,830 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 296 transitions, 4985 flow
[2024-06-04 18:06:52,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:06:52,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:06:52,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions.
[2024-06-04 18:06:52,831 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.384375
[2024-06-04 18:06:52,831 INFO  L175             Difference]: Start difference. First operand has 178 places, 260 transitions, 3962 flow. Second operand 8 states and 123 transitions.
[2024-06-04 18:06:52,831 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 296 transitions, 4985 flow
[2024-06-04 18:06:53,017 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 296 transitions, 4813 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-04 18:06:53,021 INFO  L231             Difference]: Finished difference. Result has 181 places, 276 transitions, 4235 flow
[2024-06-04 18:06:53,021 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=3792, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4235, PETRI_PLACES=181, PETRI_TRANSITIONS=276}
[2024-06-04 18:06:53,022 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 140 predicate places.
[2024-06-04 18:06:53,022 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 276 transitions, 4235 flow
[2024-06-04 18:06:53,022 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:53,022 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:06:53,022 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:06:53,022 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-04 18:06:53,022 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:06:53,023 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:06:53,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -533914447, now seen corresponding path program 2 times
[2024-06-04 18:06:53,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:06:53,023 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68510298]
[2024-06-04 18:06:53,023 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:06:53,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:06:53,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:06:59,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:06:59,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:06:59,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68510298]
[2024-06-04 18:06:59,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68510298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:06:59,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:06:59,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:06:59,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173265108]
[2024-06-04 18:06:59,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:06:59,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:06:59,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:06:59,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:06:59,472 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:06:59,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:06:59,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 276 transitions, 4235 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:06:59,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:06:59,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:06:59,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:00,839 INFO  L124   PetriNetUnfolderBase]: 2459/3780 cut-off events.
[2024-06-04 18:07:00,839 INFO  L125   PetriNetUnfolderBase]: For 136230/136234 co-relation queries the response was YES.
[2024-06-04 18:07:00,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28521 conditions, 3780 events. 2459/3780 cut-off events. For 136230/136234 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19767 event pairs, 816 based on Foata normal form. 6/3785 useless extension candidates. Maximal degree in co-relation 28430. Up to 3681 conditions per place. 
[2024-06-04 18:07:00,887 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 261 selfloop transitions, 33 changer transitions 0/297 dead transitions.
[2024-06-04 18:07:00,887 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 297 transitions, 4991 flow
[2024-06-04 18:07:00,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:00,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:00,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-04 18:07:00,888 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-04 18:07:00,888 INFO  L175             Difference]: Start difference. First operand has 181 places, 276 transitions, 4235 flow. Second operand 7 states and 113 transitions.
[2024-06-04 18:07:00,888 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 297 transitions, 4991 flow
[2024-06-04 18:07:01,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 297 transitions, 4865 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-04 18:07:01,191 INFO  L231             Difference]: Finished difference. Result has 185 places, 279 transitions, 4227 flow
[2024-06-04 18:07:01,192 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4109, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4227, PETRI_PLACES=185, PETRI_TRANSITIONS=279}
[2024-06-04 18:07:01,192 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 144 predicate places.
[2024-06-04 18:07:01,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 279 transitions, 4227 flow
[2024-06-04 18:07:01,192 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:01,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:01,193 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:01,193 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-04 18:07:01,193 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:01,193 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:01,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 1722898143, now seen corresponding path program 5 times
[2024-06-04 18:07:01,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:01,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885092618]
[2024-06-04 18:07:01,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:01,194 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:01,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:07,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:07,463 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:07,463 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885092618]
[2024-06-04 18:07:07,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885092618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:07,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:07,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:07,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510253774]
[2024-06-04 18:07:07,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:07,464 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:07,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:07,464 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:07,464 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:07,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:07:07,602 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 279 transitions, 4227 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:07,602 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:07,602 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:07:07,602 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:08,858 INFO  L124   PetriNetUnfolderBase]: 2500/3864 cut-off events.
[2024-06-04 18:07:08,858 INFO  L125   PetriNetUnfolderBase]: For 149438/149448 co-relation queries the response was YES.
[2024-06-04 18:07:08,880 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28974 conditions, 3864 events. 2500/3864 cut-off events. For 149438/149448 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20497 event pairs, 691 based on Foata normal form. 20/3883 useless extension candidates. Maximal degree in co-relation 28882. Up to 3042 conditions per place. 
[2024-06-04 18:07:08,897 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 226 selfloop transitions, 83 changer transitions 0/312 dead transitions.
[2024-06-04 18:07:08,897 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 312 transitions, 5015 flow
[2024-06-04 18:07:08,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:08,899 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:08,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions.
[2024-06-04 18:07:08,904 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.415625
[2024-06-04 18:07:08,904 INFO  L175             Difference]: Start difference. First operand has 185 places, 279 transitions, 4227 flow. Second operand 8 states and 133 transitions.
[2024-06-04 18:07:08,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 312 transitions, 5015 flow
[2024-06-04 18:07:09,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 312 transitions, 4920 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-04 18:07:09,195 INFO  L231             Difference]: Finished difference. Result has 187 places, 280 transitions, 4346 flow
[2024-06-04 18:07:09,196 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4346, PETRI_PLACES=187, PETRI_TRANSITIONS=280}
[2024-06-04 18:07:09,196 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 146 predicate places.
[2024-06-04 18:07:09,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 280 transitions, 4346 flow
[2024-06-04 18:07:09,196 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:09,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:09,196 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:09,197 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-04 18:07:09,197 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:09,198 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:09,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 1627919647, now seen corresponding path program 6 times
[2024-06-04 18:07:09,198 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:09,198 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743812248]
[2024-06-04 18:07:09,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:09,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:09,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:15,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:15,255 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:15,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743812248]
[2024-06-04 18:07:15,255 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743812248] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:15,255 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:15,255 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:15,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614959904]
[2024-06-04 18:07:15,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:15,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:15,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:15,256 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:15,256 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:15,442 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:07:15,442 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 280 transitions, 4346 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:15,442 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:15,442 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:07:15,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:16,729 INFO  L124   PetriNetUnfolderBase]: 2516/3891 cut-off events.
[2024-06-04 18:07:16,729 INFO  L125   PetriNetUnfolderBase]: For 145149/145151 co-relation queries the response was YES.
[2024-06-04 18:07:16,744 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29179 conditions, 3891 events. 2516/3891 cut-off events. For 145149/145151 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20652 event pairs, 983 based on Foata normal form. 12/3902 useless extension candidates. Maximal degree in co-relation 29088. Up to 3696 conditions per place. 
[2024-06-04 18:07:16,756 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 289 selfloop transitions, 17 changer transitions 0/309 dead transitions.
[2024-06-04 18:07:16,757 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 309 transitions, 5102 flow
[2024-06-04 18:07:16,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:07:16,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:07:16,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-04 18:07:16,759 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39375
[2024-06-04 18:07:16,759 INFO  L175             Difference]: Start difference. First operand has 187 places, 280 transitions, 4346 flow. Second operand 8 states and 126 transitions.
[2024-06-04 18:07:16,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 309 transitions, 5102 flow
[2024-06-04 18:07:16,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 309 transitions, 4908 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-04 18:07:16,970 INFO  L231             Difference]: Finished difference. Result has 189 places, 281 transitions, 4232 flow
[2024-06-04 18:07:16,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4154, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4232, PETRI_PLACES=189, PETRI_TRANSITIONS=281}
[2024-06-04 18:07:16,972 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 148 predicate places.
[2024-06-04 18:07:16,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 281 transitions, 4232 flow
[2024-06-04 18:07:16,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:16,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:16,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:16,973 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-04 18:07:16,973 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:16,973 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:16,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 1504204515, now seen corresponding path program 3 times
[2024-06-04 18:07:16,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:16,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413040987]
[2024-06-04 18:07:16,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:16,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:17,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:23,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:23,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:23,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413040987]
[2024-06-04 18:07:23,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413040987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:23,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:23,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:23,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051690491]
[2024-06-04 18:07:23,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:23,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:23,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:23,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:23,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:23,448 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:07:23,448 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 281 transitions, 4232 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:23,448 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:23,449 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:07:23,449 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:24,553 INFO  L124   PetriNetUnfolderBase]: 2526/3904 cut-off events.
[2024-06-04 18:07:24,553 INFO  L125   PetriNetUnfolderBase]: For 137183/137183 co-relation queries the response was YES.
[2024-06-04 18:07:24,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28763 conditions, 3904 events. 2526/3904 cut-off events. For 137183/137183 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20715 event pairs, 1014 based on Foata normal form. 2/3905 useless extension candidates. Maximal degree in co-relation 28671. Up to 3846 conditions per place. 
[2024-06-04 18:07:24,588 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 276 selfloop transitions, 17 changer transitions 0/296 dead transitions.
[2024-06-04 18:07:24,588 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 296 transitions, 4904 flow
[2024-06-04 18:07:24,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:07:24,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:07:24,589 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions.
[2024-06-04 18:07:24,589 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37916666666666665
[2024-06-04 18:07:24,589 INFO  L175             Difference]: Start difference. First operand has 189 places, 281 transitions, 4232 flow. Second operand 6 states and 91 transitions.
[2024-06-04 18:07:24,589 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 296 transitions, 4904 flow
[2024-06-04 18:07:24,826 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 296 transitions, 4844 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-04 18:07:24,830 INFO  L231             Difference]: Finished difference. Result has 190 places, 287 transitions, 4282 flow
[2024-06-04 18:07:24,830 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4172, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4282, PETRI_PLACES=190, PETRI_TRANSITIONS=287}
[2024-06-04 18:07:24,831 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places.
[2024-06-04 18:07:24,831 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 287 transitions, 4282 flow
[2024-06-04 18:07:24,831 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:24,831 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:24,831 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:24,831 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-04 18:07:24,832 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:24,832 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:24,832 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599806982, now seen corresponding path program 6 times
[2024-06-04 18:07:24,832 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:24,832 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665657760]
[2024-06-04 18:07:24,832 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:24,832 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:24,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:31,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:31,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:31,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665657760]
[2024-06-04 18:07:31,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665657760] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:31,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:31,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:31,835 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441316296]
[2024-06-04 18:07:31,835 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:31,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:31,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:31,836 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:31,836 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:32,022 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:07:32,022 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 287 transitions, 4282 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:32,023 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:32,023 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:07:32,023 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:33,345 INFO  L124   PetriNetUnfolderBase]: 2569/3959 cut-off events.
[2024-06-04 18:07:33,345 INFO  L125   PetriNetUnfolderBase]: For 143417/143421 co-relation queries the response was YES.
[2024-06-04 18:07:33,361 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29518 conditions, 3959 events. 2569/3959 cut-off events. For 143417/143421 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20982 event pairs, 756 based on Foata normal form. 7/3965 useless extension candidates. Maximal degree in co-relation 29424. Up to 3621 conditions per place. 
[2024-06-04 18:07:33,374 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 244 selfloop transitions, 82 changer transitions 0/329 dead transitions.
[2024-06-04 18:07:33,374 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 329 transitions, 5395 flow
[2024-06-04 18:07:33,375 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:33,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:33,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-04 18:07:33,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-04 18:07:33,375 INFO  L175             Difference]: Start difference. First operand has 190 places, 287 transitions, 4282 flow. Second operand 7 states and 124 transitions.
[2024-06-04 18:07:33,375 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 329 transitions, 5395 flow
[2024-06-04 18:07:33,580 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 329 transitions, 5350 flow, removed 15 selfloop flow, removed 2 redundant places.
[2024-06-04 18:07:33,585 INFO  L231             Difference]: Finished difference. Result has 197 places, 300 transitions, 4780 flow
[2024-06-04 18:07:33,585 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4237, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4780, PETRI_PLACES=197, PETRI_TRANSITIONS=300}
[2024-06-04 18:07:33,585 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places.
[2024-06-04 18:07:33,585 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 300 transitions, 4780 flow
[2024-06-04 18:07:33,586 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:33,586 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:33,586 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:33,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-04 18:07:33,586 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:33,586 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:33,586 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599806641, now seen corresponding path program 4 times
[2024-06-04 18:07:33,587 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:33,587 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067408570]
[2024-06-04 18:07:33,587 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:33,587 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:33,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:40,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-04 18:07:40,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:40,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067408570]
[2024-06-04 18:07:40,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067408570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:40,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:40,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:07:40,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857615600]
[2024-06-04 18:07:40,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:40,120 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:07:40,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:40,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:07:40,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:07:40,242 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:07:40,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 300 transitions, 4780 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:40,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:40,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:07:40,242 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:41,377 INFO  L124   PetriNetUnfolderBase]: 2571/3960 cut-off events.
[2024-06-04 18:07:41,378 INFO  L125   PetriNetUnfolderBase]: For 152414/152418 co-relation queries the response was YES.
[2024-06-04 18:07:41,399 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30342 conditions, 3960 events. 2571/3960 cut-off events. For 152414/152418 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 20981 event pairs, 844 based on Foata normal form. 6/3965 useless extension candidates. Maximal degree in co-relation 30244. Up to 3858 conditions per place. 
[2024-06-04 18:07:41,416 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 276 selfloop transitions, 40 changer transitions 0/319 dead transitions.
[2024-06-04 18:07:41,416 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 319 transitions, 5593 flow
[2024-06-04 18:07:41,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:07:41,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:07:41,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-04 18:07:41,417 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:07:41,417 INFO  L175             Difference]: Start difference. First operand has 197 places, 300 transitions, 4780 flow. Second operand 6 states and 102 transitions.
[2024-06-04 18:07:41,417 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 319 transitions, 5593 flow
[2024-06-04 18:07:41,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 319 transitions, 5464 flow, removed 32 selfloop flow, removed 3 redundant places.
[2024-06-04 18:07:41,668 INFO  L231             Difference]: Finished difference. Result has 200 places, 303 transitions, 4796 flow
[2024-06-04 18:07:41,668 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4651, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4796, PETRI_PLACES=200, PETRI_TRANSITIONS=303}
[2024-06-04 18:07:41,668 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 159 predicate places.
[2024-06-04 18:07:41,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 303 transitions, 4796 flow
[2024-06-04 18:07:41,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:41,669 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:41,669 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:41,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-04 18:07:41,669 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:41,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:41,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -356598415, now seen corresponding path program 1 times
[2024-06-04 18:07:41,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:41,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568545446]
[2024-06-04 18:07:41,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:41,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:41,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:07:50,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:07:50,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:07:50,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568545446]
[2024-06-04 18:07:50,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568545446] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:07:50,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:07:50,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:07:50,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849406296]
[2024-06-04 18:07:50,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:07:50,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:07:50,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:07:50,674 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:07:50,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:07:50,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:07:50,766 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 303 transitions, 4796 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:50,766 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:07:50,767 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:07:50,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:07:52,215 INFO  L124   PetriNetUnfolderBase]: 2591/3995 cut-off events.
[2024-06-04 18:07:52,215 INFO  L125   PetriNetUnfolderBase]: For 161462/161462 co-relation queries the response was YES.
[2024-06-04 18:07:52,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30448 conditions, 3995 events. 2591/3995 cut-off events. For 161462/161462 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21219 event pairs, 1021 based on Foata normal form. 4/3998 useless extension candidates. Maximal degree in co-relation 30349. Up to 3867 conditions per place. 
[2024-06-04 18:07:52,269 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 292 selfloop transitions, 31 changer transitions 0/326 dead transitions.
[2024-06-04 18:07:52,270 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 326 transitions, 5658 flow
[2024-06-04 18:07:52,271 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:07:52,272 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:07:52,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-04 18:07:52,272 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4035714285714286
[2024-06-04 18:07:52,272 INFO  L175             Difference]: Start difference. First operand has 200 places, 303 transitions, 4796 flow. Second operand 7 states and 113 transitions.
[2024-06-04 18:07:52,272 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 326 transitions, 5658 flow
[2024-06-04 18:07:52,602 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 326 transitions, 5566 flow, removed 20 selfloop flow, removed 4 redundant places.
[2024-06-04 18:07:52,607 INFO  L231             Difference]: Finished difference. Result has 203 places, 309 transitions, 4849 flow
[2024-06-04 18:07:52,607 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4706, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4849, PETRI_PLACES=203, PETRI_TRANSITIONS=309}
[2024-06-04 18:07:52,607 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places.
[2024-06-04 18:07:52,608 INFO  L495      AbstractCegarLoop]: Abstraction has has 203 places, 309 transitions, 4849 flow
[2024-06-04 18:07:52,608 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:07:52,608 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:07:52,608 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:07:52,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-04 18:07:52,608 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:07:52,608 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:07:52,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 541300891, now seen corresponding path program 2 times
[2024-06-04 18:07:52,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:07:52,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784443965]
[2024-06-04 18:07:52,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:07:52,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:07:52,633 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:01,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:01,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:01,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784443965]
[2024-06-04 18:08:01,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784443965] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:01,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:01,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:01,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347210685]
[2024-06-04 18:08:01,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:01,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:01,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:01,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:01,681 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:01,744 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:08:01,744 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 309 transitions, 4849 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:01,744 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:01,744 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:08:01,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:03,010 INFO  L124   PetriNetUnfolderBase]: 2611/4023 cut-off events.
[2024-06-04 18:08:03,010 INFO  L125   PetriNetUnfolderBase]: For 162495/162495 co-relation queries the response was YES.
[2024-06-04 18:08:03,038 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30775 conditions, 4023 events. 2611/4023 cut-off events. For 162495/162495 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21384 event pairs, 1019 based on Foata normal form. 4/4026 useless extension candidates. Maximal degree in co-relation 30676. Up to 3907 conditions per place. 
[2024-06-04 18:08:03,056 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 297 selfloop transitions, 28 changer transitions 0/328 dead transitions.
[2024-06-04 18:08:03,056 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 328 transitions, 5685 flow
[2024-06-04 18:08:03,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:03,058 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:03,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-04 18:08:03,058 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42083333333333334
[2024-06-04 18:08:03,058 INFO  L175             Difference]: Start difference. First operand has 203 places, 309 transitions, 4849 flow. Second operand 6 states and 101 transitions.
[2024-06-04 18:08:03,058 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 328 transitions, 5685 flow
[2024-06-04 18:08:03,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 328 transitions, 5635 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-04 18:08:03,416 INFO  L231             Difference]: Finished difference. Result has 206 places, 312 transitions, 4902 flow
[2024-06-04 18:08:03,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4801, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4902, PETRI_PLACES=206, PETRI_TRANSITIONS=312}
[2024-06-04 18:08:03,417 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places.
[2024-06-04 18:08:03,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 312 transitions, 4902 flow
[2024-06-04 18:08:03,417 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:03,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:03,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:03,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-04 18:08:03,418 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:03,419 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:03,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 541306471, now seen corresponding path program 3 times
[2024-06-04 18:08:03,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:03,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971416159]
[2024-06-04 18:08:03,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:03,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:03,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:12,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:12,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:12,775 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971416159]
[2024-06-04 18:08:12,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971416159] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:12,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:12,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:12,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355596452]
[2024-06-04 18:08:12,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:12,776 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:12,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:12,776 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:12,776 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:12,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:08:12,901 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 312 transitions, 4902 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:12,901 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:12,901 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:08:12,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:14,216 INFO  L124   PetriNetUnfolderBase]: 2599/4007 cut-off events.
[2024-06-04 18:08:14,216 INFO  L125   PetriNetUnfolderBase]: For 165878/165878 co-relation queries the response was YES.
[2024-06-04 18:08:14,234 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30725 conditions, 4007 events. 2599/4007 cut-off events. For 165878/165878 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 21274 event pairs, 1015 based on Foata normal form. 4/4010 useless extension candidates. Maximal degree in co-relation 30624. Up to 3899 conditions per place. 
[2024-06-04 18:08:14,247 INFO  L140   encePairwiseOnDemand]: 31/40 looper letters, 297 selfloop transitions, 29 changer transitions 0/329 dead transitions.
[2024-06-04 18:08:14,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 329 transitions, 5626 flow
[2024-06-04 18:08:14,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:14,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:14,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions.
[2024-06-04 18:08:14,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.378125
[2024-06-04 18:08:14,250 INFO  L175             Difference]: Start difference. First operand has 206 places, 312 transitions, 4902 flow. Second operand 8 states and 121 transitions.
[2024-06-04 18:08:14,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 329 transitions, 5626 flow
[2024-06-04 18:08:14,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 329 transitions, 5538 flow, removed 18 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:14,553 INFO  L231             Difference]: Finished difference. Result has 210 places, 312 transitions, 4879 flow
[2024-06-04 18:08:14,553 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4814, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4879, PETRI_PLACES=210, PETRI_TRANSITIONS=312}
[2024-06-04 18:08:14,555 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 169 predicate places.
[2024-06-04 18:08:14,555 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 312 transitions, 4879 flow
[2024-06-04 18:08:14,555 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:14,555 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:14,556 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:14,556 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-04 18:08:14,556 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:14,556 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:14,556 INFO  L85        PathProgramCache]: Analyzing trace with hash -1599406803, now seen corresponding path program 1 times
[2024-06-04 18:08:14,556 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:14,556 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80411398]
[2024-06-04 18:08:14,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:14,557 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:14,587 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:23,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:23,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:23,523 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80411398]
[2024-06-04 18:08:23,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80411398] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:23,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:23,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:08:23,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375797761]
[2024-06-04 18:08:23,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:23,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:08:23,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:23,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:08:23,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:08:23,674 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:08:23,674 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 312 transitions, 4879 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:23,674 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:23,674 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:08:23,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:24,963 INFO  L124   PetriNetUnfolderBase]: 2594/4000 cut-off events.
[2024-06-04 18:08:24,963 INFO  L125   PetriNetUnfolderBase]: For 168988/168988 co-relation queries the response was YES.
[2024-06-04 18:08:24,980 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30690 conditions, 4000 events. 2594/4000 cut-off events. For 168988/168988 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21166 event pairs, 1014 based on Foata normal form. 2/4001 useless extension candidates. Maximal degree in co-relation 30588. Up to 3942 conditions per place. 
[2024-06-04 18:08:24,994 INFO  L140   encePairwiseOnDemand]: 33/40 looper letters, 305 selfloop transitions, 15 changer transitions 0/323 dead transitions.
[2024-06-04 18:08:24,995 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 323 transitions, 5579 flow
[2024-06-04 18:08:24,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:08:24,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:08:24,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions.
[2024-06-04 18:08:24,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-04 18:08:24,996 INFO  L175             Difference]: Start difference. First operand has 210 places, 312 transitions, 4879 flow. Second operand 6 states and 90 transitions.
[2024-06-04 18:08:24,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 323 transitions, 5579 flow
[2024-06-04 18:08:25,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 323 transitions, 5497 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-04 18:08:25,314 INFO  L231             Difference]: Finished difference. Result has 209 places, 314 transitions, 4868 flow
[2024-06-04 18:08:25,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4797, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4868, PETRI_PLACES=209, PETRI_TRANSITIONS=314}
[2024-06-04 18:08:25,315 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 168 predicate places.
[2024-06-04 18:08:25,315 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 314 transitions, 4868 flow
[2024-06-04 18:08:25,315 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:25,315 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:25,315 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:25,315 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-04 18:08:25,316 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:25,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:25,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -626536971, now seen corresponding path program 1 times
[2024-06-04 18:08:25,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:25,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793732228]
[2024-06-04 18:08:25,316 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:25,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:25,341 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:34,360 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:34,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:34,361 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793732228]
[2024-06-04 18:08:34,361 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793732228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:34,361 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:34,361 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:34,361 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077254227]
[2024-06-04 18:08:34,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:34,362 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:34,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:34,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:34,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:34,475 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:08:34,475 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 314 transitions, 4868 flow. Second operand  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:34,475 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:34,475 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:08:34,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:35,975 INFO  L124   PetriNetUnfolderBase]: 2748/4237 cut-off events.
[2024-06-04 18:08:35,975 INFO  L125   PetriNetUnfolderBase]: For 209892/209928 co-relation queries the response was YES.
[2024-06-04 18:08:36,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33254 conditions, 4237 events. 2748/4237 cut-off events. For 209892/209928 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 23037 event pairs, 661 based on Foata normal form. 20/4213 useless extension candidates. Maximal degree in co-relation 33151. Up to 2760 conditions per place. 
[2024-06-04 18:08:36,034 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 206 selfloop transitions, 142 changer transitions 0/386 dead transitions.
[2024-06-04 18:08:36,035 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 386 transitions, 6420 flow
[2024-06-04 18:08:36,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:36,036 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:36,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-04 18:08:36,036 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.490625
[2024-06-04 18:08:36,036 INFO  L175             Difference]: Start difference. First operand has 209 places, 314 transitions, 4868 flow. Second operand 8 states and 157 transitions.
[2024-06-04 18:08:36,036 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 386 transitions, 6420 flow
[2024-06-04 18:08:36,462 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 386 transitions, 6365 flow, removed 14 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:36,468 INFO  L231             Difference]: Finished difference. Result has 216 places, 344 transitions, 5724 flow
[2024-06-04 18:08:36,468 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=4813, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5724, PETRI_PLACES=216, PETRI_TRANSITIONS=344}
[2024-06-04 18:08:36,468 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 175 predicate places.
[2024-06-04 18:08:36,469 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 344 transitions, 5724 flow
[2024-06-04 18:08:36,469 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:36,469 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:36,469 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:36,469 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-04 18:08:36,471 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:36,472 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:36,472 INFO  L85        PathProgramCache]: Analyzing trace with hash 565333685, now seen corresponding path program 1 times
[2024-06-04 18:08:36,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:36,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288909727]
[2024-06-04 18:08:36,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:36,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:36,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:45,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-04 18:08:45,806 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:45,806 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288909727]
[2024-06-04 18:08:45,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288909727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:45,806 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:45,806 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:45,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670366230]
[2024-06-04 18:08:45,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:45,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:45,807 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:45,807 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:45,807 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:45,908 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:08:45,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 344 transitions, 5724 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:45,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:45,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:08:45,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:47,351 INFO  L124   PetriNetUnfolderBase]: 2882/4404 cut-off events.
[2024-06-04 18:08:47,351 INFO  L125   PetriNetUnfolderBase]: For 208781/208799 co-relation queries the response was YES.
[2024-06-04 18:08:47,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36350 conditions, 4404 events. 2882/4404 cut-off events. For 208781/208799 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 23483 event pairs, 814 based on Foata normal form. 22/4425 useless extension candidates. Maximal degree in co-relation 36243. Up to 3927 conditions per place. 
[2024-06-04 18:08:47,396 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 272 selfloop transitions, 115 changer transitions 0/390 dead transitions.
[2024-06-04 18:08:47,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 390 transitions, 7309 flow
[2024-06-04 18:08:47,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:08:47,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:08:47,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-04 18:08:47,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-04 18:08:47,411 INFO  L175             Difference]: Start difference. First operand has 216 places, 344 transitions, 5724 flow. Second operand 8 states and 140 transitions.
[2024-06-04 18:08:47,412 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 390 transitions, 7309 flow
[2024-06-04 18:08:47,865 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 390 transitions, 7228 flow, removed 27 selfloop flow, removed 2 redundant places.
[2024-06-04 18:08:47,884 INFO  L231             Difference]: Finished difference. Result has 223 places, 362 transitions, 6357 flow
[2024-06-04 18:08:47,884 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=5643, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6357, PETRI_PLACES=223, PETRI_TRANSITIONS=362}
[2024-06-04 18:08:47,885 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 182 predicate places.
[2024-06-04 18:08:47,885 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 362 transitions, 6357 flow
[2024-06-04 18:08:47,885 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:47,885 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:47,885 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:47,885 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-04 18:08:47,885 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:47,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:47,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 1970173771, now seen corresponding path program 2 times
[2024-06-04 18:08:47,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:47,887 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913739319]
[2024-06-04 18:08:47,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:47,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:47,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:08:57,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:08:57,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:08:57,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913739319]
[2024-06-04 18:08:57,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913739319] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:08:57,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:08:57,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:08:57,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465410862]
[2024-06-04 18:08:57,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:08:57,193 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:08:57,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:08:57,193 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:08:57,194 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:08:57,388 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:08:57,389 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 362 transitions, 6357 flow. Second operand  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:57,389 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:08:57,389 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:08:57,389 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:08:58,835 INFO  L124   PetriNetUnfolderBase]: 2866/4383 cut-off events.
[2024-06-04 18:08:58,835 INFO  L125   PetriNetUnfolderBase]: For 210678/210682 co-relation queries the response was YES.
[2024-06-04 18:08:58,856 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36266 conditions, 4383 events. 2866/4383 cut-off events. For 210678/210682 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23360 event pairs, 883 based on Foata normal form. 8/4390 useless extension candidates. Maximal degree in co-relation 36156. Up to 4284 conditions per place. 
[2024-06-04 18:08:58,872 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 343 selfloop transitions, 37 changer transitions 0/383 dead transitions.
[2024-06-04 18:08:58,872 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 383 transitions, 7197 flow
[2024-06-04 18:08:58,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:08:58,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:08:58,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions.
[2024-06-04 18:08:58,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38055555555555554
[2024-06-04 18:08:58,874 INFO  L175             Difference]: Start difference. First operand has 223 places, 362 transitions, 6357 flow. Second operand 9 states and 137 transitions.
[2024-06-04 18:08:58,874 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 383 transitions, 7197 flow
[2024-06-04 18:08:59,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 383 transitions, 6938 flow, removed 62 selfloop flow, removed 4 redundant places.
[2024-06-04 18:08:59,265 INFO  L231             Difference]: Finished difference. Result has 228 places, 362 transitions, 6183 flow
[2024-06-04 18:08:59,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6098, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6183, PETRI_PLACES=228, PETRI_TRANSITIONS=362}
[2024-06-04 18:08:59,266 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 187 predicate places.
[2024-06-04 18:08:59,266 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 362 transitions, 6183 flow
[2024-06-04 18:08:59,266 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:08:59,266 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:08:59,266 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:08:59,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-04 18:08:59,267 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:08:59,267 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:08:59,267 INFO  L85        PathProgramCache]: Analyzing trace with hash 758465363, now seen corresponding path program 2 times
[2024-06-04 18:08:59,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:08:59,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400798743]
[2024-06-04 18:08:59,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:08:59,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:08:59,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:09,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:09,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:09,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400798743]
[2024-06-04 18:09:09,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400798743] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:09,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:09,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:09,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427346985]
[2024-06-04 18:09:09,475 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:09,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:09,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:09,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:09,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:09,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:09:09,624 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 362 transitions, 6183 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:09,624 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:09,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:09:09,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:11,166 INFO  L124   PetriNetUnfolderBase]: 2975/4545 cut-off events.
[2024-06-04 18:09:11,167 INFO  L125   PetriNetUnfolderBase]: For 220889/220895 co-relation queries the response was YES.
[2024-06-04 18:09:11,195 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37212 conditions, 4545 events. 2975/4545 cut-off events. For 220889/220895 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 24366 event pairs, 806 based on Foata normal form. 9/4553 useless extension candidates. Maximal degree in co-relation 37101. Up to 3957 conditions per place. 
[2024-06-04 18:09:11,215 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 276 selfloop transitions, 140 changer transitions 0/419 dead transitions.
[2024-06-04 18:09:11,215 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 419 transitions, 7812 flow
[2024-06-04 18:09:11,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:09:11,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:09:11,217 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions.
[2024-06-04 18:09:11,217 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325
[2024-06-04 18:09:11,217 INFO  L175             Difference]: Start difference. First operand has 228 places, 362 transitions, 6183 flow. Second operand 10 states and 173 transitions.
[2024-06-04 18:09:11,217 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 419 transitions, 7812 flow
[2024-06-04 18:09:11,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 419 transitions, 7743 flow, removed 0 selfloop flow, removed 7 redundant places.
[2024-06-04 18:09:11,716 INFO  L231             Difference]: Finished difference. Result has 232 places, 381 transitions, 6725 flow
[2024-06-04 18:09:11,716 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6114, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6725, PETRI_PLACES=232, PETRI_TRANSITIONS=381}
[2024-06-04 18:09:11,716 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places.
[2024-06-04 18:09:11,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 381 transitions, 6725 flow
[2024-06-04 18:09:11,716 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:11,717 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:11,717 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:11,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-04 18:09:11,717 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:11,719 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:11,719 INFO  L85        PathProgramCache]: Analyzing trace with hash 758704683, now seen corresponding path program 1 times
[2024-06-04 18:09:11,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:11,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032749679]
[2024-06-04 18:09:11,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:11,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:11,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:21,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:21,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:21,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032749679]
[2024-06-04 18:09:21,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032749679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:21,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:21,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:21,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38306638]
[2024-06-04 18:09:21,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:21,425 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:21,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:21,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:21,426 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:21,527 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:09:21,528 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 381 transitions, 6725 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:21,528 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:21,528 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:09:21,528 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:23,482 INFO  L124   PetriNetUnfolderBase]: 3530/5312 cut-off events.
[2024-06-04 18:09:23,482 INFO  L125   PetriNetUnfolderBase]: For 286425/286443 co-relation queries the response was YES.
[2024-06-04 18:09:23,513 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45369 conditions, 5312 events. 3530/5312 cut-off events. For 286425/286443 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28514 event pairs, 716 based on Foata normal form. 26/5337 useless extension candidates. Maximal degree in co-relation 45256. Up to 3241 conditions per place. 
[2024-06-04 18:09:23,535 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 297 selfloop transitions, 189 changer transitions 0/489 dead transitions.
[2024-06-04 18:09:23,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 489 transitions, 9254 flow
[2024-06-04 18:09:23,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:09:23,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:09:23,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-04 18:09:23,537 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48055555555555557
[2024-06-04 18:09:23,537 INFO  L175             Difference]: Start difference. First operand has 232 places, 381 transitions, 6725 flow. Second operand 9 states and 173 transitions.
[2024-06-04 18:09:23,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 489 transitions, 9254 flow
[2024-06-04 18:09:24,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 489 transitions, 9080 flow, removed 38 selfloop flow, removed 5 redundant places.
[2024-06-04 18:09:24,154 INFO  L231             Difference]: Finished difference. Result has 240 places, 430 transitions, 7935 flow
[2024-06-04 18:09:24,154 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=6551, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7935, PETRI_PLACES=240, PETRI_TRANSITIONS=430}
[2024-06-04 18:09:24,155 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 199 predicate places.
[2024-06-04 18:09:24,155 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 430 transitions, 7935 flow
[2024-06-04 18:09:24,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:24,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:24,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:24,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-04 18:09:24,161 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:24,161 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:24,161 INFO  L85        PathProgramCache]: Analyzing trace with hash 1969113633, now seen corresponding path program 2 times
[2024-06-04 18:09:24,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:24,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170861169]
[2024-06-04 18:09:24,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:24,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:24,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:33,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:33,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:33,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170861169]
[2024-06-04 18:09:33,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170861169] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:33,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:33,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:33,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739669602]
[2024-06-04 18:09:33,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:33,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:33,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:33,855 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:33,855 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:34,003 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:09:34,003 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 430 transitions, 7935 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:34,003 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:34,003 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:09:34,003 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:36,080 INFO  L124   PetriNetUnfolderBase]: 3840/5742 cut-off events.
[2024-06-04 18:09:36,080 INFO  L125   PetriNetUnfolderBase]: For 340442/340446 co-relation queries the response was YES.
[2024-06-04 18:09:36,108 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52821 conditions, 5742 events. 3840/5742 cut-off events. For 340442/340446 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 30929 event pairs, 1023 based on Foata normal form. 10/5751 useless extension candidates. Maximal degree in co-relation 52702. Up to 5279 conditions per place. 
[2024-06-04 18:09:36,129 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 415 selfloop transitions, 69 changer transitions 0/487 dead transitions.
[2024-06-04 18:09:36,130 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 487 transitions, 9750 flow
[2024-06-04 18:09:36,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:09:36,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:09:36,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions.
[2024-06-04 18:09:36,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4022727272727273
[2024-06-04 18:09:36,131 INFO  L175             Difference]: Start difference. First operand has 240 places, 430 transitions, 7935 flow. Second operand 11 states and 177 transitions.
[2024-06-04 18:09:36,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 487 transitions, 9750 flow
[2024-06-04 18:09:36,830 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 487 transitions, 9492 flow, removed 51 selfloop flow, removed 3 redundant places.
[2024-06-04 18:09:36,837 INFO  L231             Difference]: Finished difference. Result has 250 places, 452 transitions, 8288 flow
[2024-06-04 18:09:36,837 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=7697, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8288, PETRI_PLACES=250, PETRI_TRANSITIONS=452}
[2024-06-04 18:09:36,838 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 209 predicate places.
[2024-06-04 18:09:36,838 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 452 transitions, 8288 flow
[2024-06-04 18:09:36,838 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:36,838 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:36,838 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:36,838 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-04 18:09:36,838 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:36,839 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:36,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 1930673013, now seen corresponding path program 3 times
[2024-06-04 18:09:36,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:36,839 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335172792]
[2024-06-04 18:09:36,839 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:36,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:36,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:46,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-04 18:09:46,371 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:46,371 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335172792]
[2024-06-04 18:09:46,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335172792] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:46,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:46,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:46,371 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057256321]
[2024-06-04 18:09:46,371 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:46,372 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:46,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:46,373 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:46,373 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:46,488 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:09:46,489 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 452 transitions, 8288 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:46,489 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:46,489 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:09:46,489 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:09:48,463 INFO  L124   PetriNetUnfolderBase]: 3816/5712 cut-off events.
[2024-06-04 18:09:48,464 INFO  L125   PetriNetUnfolderBase]: For 347741/347745 co-relation queries the response was YES.
[2024-06-04 18:09:48,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51640 conditions, 5712 events. 3816/5712 cut-off events. For 347741/347745 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 30789 event pairs, 1025 based on Foata normal form. 16/5727 useless extension candidates. Maximal degree in co-relation 51518. Up to 5274 conditions per place. 
[2024-06-04 18:09:48,525 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 414 selfloop transitions, 70 changer transitions 0/487 dead transitions.
[2024-06-04 18:09:48,525 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 487 transitions, 9730 flow
[2024-06-04 18:09:48,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:09:48,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:09:48,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions.
[2024-06-04 18:09:48,526 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4175
[2024-06-04 18:09:48,526 INFO  L175             Difference]: Start difference. First operand has 250 places, 452 transitions, 8288 flow. Second operand 10 states and 167 transitions.
[2024-06-04 18:09:48,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 487 transitions, 9730 flow
[2024-06-04 18:09:49,349 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 487 transitions, 9545 flow, removed 67 selfloop flow, removed 6 redundant places.
[2024-06-04 18:09:49,356 INFO  L231             Difference]: Finished difference. Result has 254 places, 454 transitions, 8309 flow
[2024-06-04 18:09:49,357 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8109, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8309, PETRI_PLACES=254, PETRI_TRANSITIONS=454}
[2024-06-04 18:09:49,357 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 213 predicate places.
[2024-06-04 18:09:49,357 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 454 transitions, 8309 flow
[2024-06-04 18:09:49,357 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:49,357 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:09:49,357 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:09:49,357 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-04 18:09:49,358 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:09:49,358 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:09:49,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 767036243, now seen corresponding path program 3 times
[2024-06-04 18:09:49,358 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:09:49,358 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108392062]
[2024-06-04 18:09:49,358 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:09:49,358 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:09:49,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:09:59,694 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:09:59,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:09:59,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108392062]
[2024-06-04 18:09:59,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108392062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:09:59,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:09:59,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:09:59,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006178384]
[2024-06-04 18:09:59,695 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:09:59,695 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:09:59,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:09:59,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:09:59,696 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:09:59,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:09:59,846 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 454 transitions, 8309 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:09:59,846 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:09:59,846 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:09:59,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:01,783 INFO  L124   PetriNetUnfolderBase]: 3795/5682 cut-off events.
[2024-06-04 18:10:01,783 INFO  L125   PetriNetUnfolderBase]: For 344242/344246 co-relation queries the response was YES.
[2024-06-04 18:10:01,824 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51183 conditions, 5682 events. 3795/5682 cut-off events. For 344242/344246 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 30557 event pairs, 1080 based on Foata normal form. 7/5688 useless extension candidates. Maximal degree in co-relation 51059. Up to 5569 conditions per place. 
[2024-06-04 18:10:01,852 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 433 selfloop transitions, 41 changer transitions 0/477 dead transitions.
[2024-06-04 18:10:01,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 477 transitions, 9349 flow
[2024-06-04 18:10:01,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:10:01,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:10:01,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions.
[2024-06-04 18:10:01,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-04 18:10:01,855 INFO  L175             Difference]: Start difference. First operand has 254 places, 454 transitions, 8309 flow. Second operand 10 states and 150 transitions.
[2024-06-04 18:10:01,855 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 477 transitions, 9349 flow
[2024-06-04 18:10:02,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 477 transitions, 9207 flow, removed 24 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:02,659 INFO  L231             Difference]: Finished difference. Result has 258 places, 454 transitions, 8257 flow
[2024-06-04 18:10:02,659 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8167, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8257, PETRI_PLACES=258, PETRI_TRANSITIONS=454}
[2024-06-04 18:10:02,660 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 217 predicate places.
[2024-06-04 18:10:02,660 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 454 transitions, 8257 flow
[2024-06-04 18:10:02,660 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:02,660 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:02,660 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:02,660 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-04 18:10:02,661 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:02,661 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:02,661 INFO  L85        PathProgramCache]: Analyzing trace with hash 619940895, now seen corresponding path program 4 times
[2024-06-04 18:10:02,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:02,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767678703]
[2024-06-04 18:10:02,661 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:02,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:02,698 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:10,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:10,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:10,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767678703]
[2024-06-04 18:10:10,907 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767678703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:10,907 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:10,907 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:10,907 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082648296]
[2024-06-04 18:10:10,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:10,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:10,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:10,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:10,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:11,081 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:10:11,082 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 454 transitions, 8257 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:11,082 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:11,082 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:10:11,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:13,014 INFO  L124   PetriNetUnfolderBase]: 3836/5743 cut-off events.
[2024-06-04 18:10:13,014 INFO  L125   PetriNetUnfolderBase]: For 357551/357557 co-relation queries the response was YES.
[2024-06-04 18:10:13,054 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51653 conditions, 5743 events. 3836/5743 cut-off events. For 357551/357557 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 31037 event pairs, 895 based on Foata normal form. 10/5752 useless extension candidates. Maximal degree in co-relation 51528. Up to 4859 conditions per place. 
[2024-06-04 18:10:13,084 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 279 selfloop transitions, 225 changer transitions 0/507 dead transitions.
[2024-06-04 18:10:13,085 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 507 transitions, 10053 flow
[2024-06-04 18:10:13,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:10:13,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:10:13,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions.
[2024-06-04 18:10:13,092 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4388888888888889
[2024-06-04 18:10:13,092 INFO  L175             Difference]: Start difference. First operand has 258 places, 454 transitions, 8257 flow. Second operand 9 states and 158 transitions.
[2024-06-04 18:10:13,092 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 507 transitions, 10053 flow
[2024-06-04 18:10:13,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 507 transitions, 9964 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-04 18:10:13,907 INFO  L231             Difference]: Finished difference. Result has 262 places, 470 transitions, 9023 flow
[2024-06-04 18:10:13,908 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8168, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9023, PETRI_PLACES=262, PETRI_TRANSITIONS=470}
[2024-06-04 18:10:13,908 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 221 predicate places.
[2024-06-04 18:10:13,908 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 470 transitions, 9023 flow
[2024-06-04 18:10:13,908 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:13,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:13,909 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:13,909 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-04 18:10:13,909 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:13,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:13,909 INFO  L85        PathProgramCache]: Analyzing trace with hash 620180215, now seen corresponding path program 4 times
[2024-06-04 18:10:13,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:13,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221324508]
[2024-06-04 18:10:13,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:13,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:13,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:20,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-04 18:10:20,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:20,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221324508]
[2024-06-04 18:10:20,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221324508] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:20,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:20,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:10:20,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099369730]
[2024-06-04 18:10:20,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:20,898 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:10:20,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:20,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:10:20,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:10:20,979 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:10:20,979 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 470 transitions, 9023 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:20,979 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:20,979 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:10:20,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:23,052 INFO  L124   PetriNetUnfolderBase]: 3998/5968 cut-off events.
[2024-06-04 18:10:23,052 INFO  L125   PetriNetUnfolderBase]: For 398678/398684 co-relation queries the response was YES.
[2024-06-04 18:10:23,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55373 conditions, 5968 events. 3998/5968 cut-off events. For 398678/398684 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 32271 event pairs, 780 based on Foata normal form. 16/5983 useless extension candidates. Maximal degree in co-relation 55246. Up to 3526 conditions per place. 
[2024-06-04 18:10:23,131 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 252 selfloop transitions, 269 changer transitions 0/524 dead transitions.
[2024-06-04 18:10:23,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 524 transitions, 10900 flow
[2024-06-04 18:10:23,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:23,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:23,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-04 18:10:23,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-04 18:10:23,133 INFO  L175             Difference]: Start difference. First operand has 262 places, 470 transitions, 9023 flow. Second operand 8 states and 152 transitions.
[2024-06-04 18:10:23,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 524 transitions, 10900 flow
[2024-06-04 18:10:24,040 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 524 transitions, 10560 flow, removed 54 selfloop flow, removed 5 redundant places.
[2024-06-04 18:10:24,048 INFO  L231             Difference]: Finished difference. Result has 266 places, 484 transitions, 9590 flow
[2024-06-04 18:10:24,048 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=8683, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9590, PETRI_PLACES=266, PETRI_TRANSITIONS=484}
[2024-06-04 18:10:24,049 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 225 predicate places.
[2024-06-04 18:10:24,049 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 484 transitions, 9590 flow
[2024-06-04 18:10:24,049 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:24,049 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:24,049 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:24,049 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-04 18:10:24,049 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:24,050 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:24,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 623754143, now seen corresponding path program 3 times
[2024-06-04 18:10:24,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:24,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340094396]
[2024-06-04 18:10:24,050 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:24,050 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:24,080 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:30,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:30,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:30,860 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340094396]
[2024-06-04 18:10:30,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340094396] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:30,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:30,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:10:30,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799393470]
[2024-06-04 18:10:30,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:30,861 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:10:30,861 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:30,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:10:30,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:10:31,005 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:10:31,006 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 484 transitions, 9590 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:31,006 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:31,006 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:10:31,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:32,860 INFO  L124   PetriNetUnfolderBase]: 4040/6025 cut-off events.
[2024-06-04 18:10:32,860 INFO  L125   PetriNetUnfolderBase]: For 416816/416838 co-relation queries the response was YES.
[2024-06-04 18:10:32,907 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58285 conditions, 6025 events. 4040/6025 cut-off events. For 416816/416838 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32689 event pairs, 969 based on Foata normal form. 32/6056 useless extension candidates. Maximal degree in co-relation 58155. Up to 5374 conditions per place. 
[2024-06-04 18:10:32,936 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 348 selfloop transitions, 183 changer transitions 0/534 dead transitions.
[2024-06-04 18:10:32,936 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 534 transitions, 11638 flow
[2024-06-04 18:10:32,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:10:32,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:10:32,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions.
[2024-06-04 18:10:32,938 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43214285714285716
[2024-06-04 18:10:32,938 INFO  L175             Difference]: Start difference. First operand has 266 places, 484 transitions, 9590 flow. Second operand 7 states and 121 transitions.
[2024-06-04 18:10:32,938 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 534 transitions, 11638 flow
[2024-06-04 18:10:33,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 534 transitions, 11205 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-04 18:10:33,979 INFO  L231             Difference]: Finished difference. Result has 270 places, 506 transitions, 10240 flow
[2024-06-04 18:10:33,979 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9174, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10240, PETRI_PLACES=270, PETRI_TRANSITIONS=506}
[2024-06-04 18:10:33,979 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 229 predicate places.
[2024-06-04 18:10:33,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 270 places, 506 transitions, 10240 flow
[2024-06-04 18:10:33,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:33,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:33,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:33,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-04 18:10:33,980 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:33,980 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:33,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -822250399, now seen corresponding path program 4 times
[2024-06-04 18:10:33,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:33,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594414026]
[2024-06-04 18:10:33,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:33,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:34,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:41,138 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:10:41,138 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:41,138 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594414026]
[2024-06-04 18:10:41,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594414026] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:41,139 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:41,139 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:10:41,139 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651077318]
[2024-06-04 18:10:41,139 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:41,139 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:10:41,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:41,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:10:41,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:10:41,207 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:10:41,207 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 506 transitions, 10240 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:41,207 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:41,207 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:10:41,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:43,253 INFO  L124   PetriNetUnfolderBase]: 4024/6002 cut-off events.
[2024-06-04 18:10:43,254 INFO  L125   PetriNetUnfolderBase]: For 407170/407174 co-relation queries the response was YES.
[2024-06-04 18:10:43,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56992 conditions, 6002 events. 4024/6002 cut-off events. For 407170/407174 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 32494 event pairs, 1119 based on Foata normal form. 8/6009 useless extension candidates. Maximal degree in co-relation 56860. Up to 5877 conditions per place. 
[2024-06-04 18:10:43,313 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 473 selfloop transitions, 49 changer transitions 0/525 dead transitions.
[2024-06-04 18:10:43,313 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 525 transitions, 11374 flow
[2024-06-04 18:10:43,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:10:43,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:10:43,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 122 transitions.
[2024-06-04 18:10:43,315 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38125
[2024-06-04 18:10:43,315 INFO  L175             Difference]: Start difference. First operand has 270 places, 506 transitions, 10240 flow. Second operand 8 states and 122 transitions.
[2024-06-04 18:10:43,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 525 transitions, 11374 flow
[2024-06-04 18:10:44,226 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 525 transitions, 10964 flow, removed 130 selfloop flow, removed 3 redundant places.
[2024-06-04 18:10:44,234 INFO  L231             Difference]: Finished difference. Result has 275 places, 506 transitions, 9948 flow
[2024-06-04 18:10:44,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9830, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=506, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=457, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=9948, PETRI_PLACES=275, PETRI_TRANSITIONS=506}
[2024-06-04 18:10:44,235 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 234 predicate places.
[2024-06-04 18:10:44,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 506 transitions, 9948 flow
[2024-06-04 18:10:44,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:44,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:44,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:44,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-04 18:10:44,236 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:44,238 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:44,238 INFO  L85        PathProgramCache]: Analyzing trace with hash -556344581, now seen corresponding path program 1 times
[2024-06-04 18:10:44,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:44,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896372736]
[2024-06-04 18:10:44,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:44,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:44,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:10:51,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-04 18:10:51,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:10:51,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896372736]
[2024-06-04 18:10:51,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896372736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:10:51,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:10:51,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:10:51,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998620048]
[2024-06-04 18:10:51,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:10:51,375 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:10:51,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:10:51,375 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:10:51,375 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:10:51,606 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:10:51,607 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 506 transitions, 9948 flow. Second operand  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:51,607 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:10:51,607 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:10:51,607 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:10:53,955 INFO  L124   PetriNetUnfolderBase]: 4012/5994 cut-off events.
[2024-06-04 18:10:53,956 INFO  L125   PetriNetUnfolderBase]: For 402056/402062 co-relation queries the response was YES.
[2024-06-04 18:10:53,991 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55862 conditions, 5994 events. 4012/5994 cut-off events. For 402056/402062 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 32492 event pairs, 955 based on Foata normal form. 12/6005 useless extension candidates. Maximal degree in co-relation 55729. Up to 5382 conditions per place. 
[2024-06-04 18:10:54,017 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 442 selfloop transitions, 100 changer transitions 0/545 dead transitions.
[2024-06-04 18:10:54,018 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 545 transitions, 11176 flow
[2024-06-04 18:10:54,019 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:10:54,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:10:54,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 18:10:54,035 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-04 18:10:54,035 INFO  L175             Difference]: Start difference. First operand has 275 places, 506 transitions, 9948 flow. Second operand 9 states and 149 transitions.
[2024-06-04 18:10:54,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 545 transitions, 11176 flow
[2024-06-04 18:10:54,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 545 transitions, 11085 flow, removed 2 selfloop flow, removed 8 redundant places.
[2024-06-04 18:10:54,788 INFO  L231             Difference]: Finished difference. Result has 275 places, 505 transitions, 10006 flow
[2024-06-04 18:10:54,804 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9801, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10006, PETRI_PLACES=275, PETRI_TRANSITIONS=505}
[2024-06-04 18:10:54,804 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 234 predicate places.
[2024-06-04 18:10:54,805 INFO  L495      AbstractCegarLoop]: Abstraction has has 275 places, 505 transitions, 10006 flow
[2024-06-04 18:10:54,805 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:10:54,805 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:10:54,805 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:10:54,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-04 18:10:54,805 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:10:54,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:10:54,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 628512085, now seen corresponding path program 5 times
[2024-06-04 18:10:54,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:10:54,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465215962]
[2024-06-04 18:10:54,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:10:54,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:10:54,835 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:02,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:02,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:02,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465215962]
[2024-06-04 18:11:02,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465215962] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:02,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:02,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:02,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29777459]
[2024-06-04 18:11:02,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:02,430 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:02,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:02,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:02,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:02,618 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:11:02,618 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 505 transitions, 10006 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:02,619 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:02,619 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:11:02,619 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:04,678 INFO  L124   PetriNetUnfolderBase]: 4316/6403 cut-off events.
[2024-06-04 18:11:04,678 INFO  L125   PetriNetUnfolderBase]: For 449853/449857 co-relation queries the response was YES.
[2024-06-04 18:11:04,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60847 conditions, 6403 events. 4316/6403 cut-off events. For 449853/449857 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34813 event pairs, 1098 based on Foata normal form. 16/6418 useless extension candidates. Maximal degree in co-relation 60715. Up to 5664 conditions per place. 
[2024-06-04 18:11:04,757 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 460 selfloop transitions, 93 changer transitions 0/556 dead transitions.
[2024-06-04 18:11:04,757 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 556 transitions, 11987 flow
[2024-06-04 18:11:04,758 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:04,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:04,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-04 18:11:04,758 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-04 18:11:04,759 INFO  L175             Difference]: Start difference. First operand has 275 places, 505 transitions, 10006 flow. Second operand 9 states and 151 transitions.
[2024-06-04 18:11:04,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 556 transitions, 11987 flow
[2024-06-04 18:11:05,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 556 transitions, 11754 flow, removed 18 selfloop flow, removed 7 redundant places.
[2024-06-04 18:11:05,623 INFO  L231             Difference]: Finished difference. Result has 279 places, 522 transitions, 10425 flow
[2024-06-04 18:11:05,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=9773, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=416, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10425, PETRI_PLACES=279, PETRI_TRANSITIONS=522}
[2024-06-04 18:11:05,625 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 238 predicate places.
[2024-06-04 18:11:05,625 INFO  L495      AbstractCegarLoop]: Abstraction has has 279 places, 522 transitions, 10425 flow
[2024-06-04 18:11:05,625 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:05,625 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:05,626 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:05,626 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-04 18:11:05,626 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-04 18:11:05,626 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:05,626 INFO  L85        PathProgramCache]: Analyzing trace with hash 628511775, now seen corresponding path program 5 times
[2024-06-04 18:11:05,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:05,626 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794420573]
[2024-06-04 18:11:05,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:05,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:05,659 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:13,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:13,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:13,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794420573]
[2024-06-04 18:11:13,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794420573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:13,269 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:13,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:13,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316369936]
[2024-06-04 18:11:13,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:13,270 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:13,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:13,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:13,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:13,433 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:11:13,434 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 522 transitions, 10425 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:13,434 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:13,434 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:11:13,434 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:15,647 INFO  L124   PetriNetUnfolderBase]: 4279/6355 cut-off events.
[2024-06-04 18:11:15,647 INFO  L125   PetriNetUnfolderBase]: For 448021/448025 co-relation queries the response was YES.
[2024-06-04 18:11:15,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60694 conditions, 6355 events. 4279/6355 cut-off events. For 448021/448025 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 34586 event pairs, 1062 based on Foata normal form. 19/6373 useless extension candidates. Maximal degree in co-relation 60559. Up to 5830 conditions per place. 
[2024-06-04 18:11:15,712 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 468 selfloop transitions, 97 changer transitions 0/568 dead transitions.
[2024-06-04 18:11:15,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 568 transitions, 12339 flow
[2024-06-04 18:11:15,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:11:15,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:11:15,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 18:11:15,713 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-04 18:11:15,713 INFO  L175             Difference]: Start difference. First operand has 279 places, 522 transitions, 10425 flow. Second operand 9 states and 149 transitions.
[2024-06-04 18:11:15,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 568 transitions, 12339 flow
[2024-06-04 18:11:16,724 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 568 transitions, 12114 flow, removed 89 selfloop flow, removed 4 redundant places.
[2024-06-04 18:11:16,732 INFO  L231             Difference]: Finished difference. Result has 286 places, 537 transitions, 10828 flow
[2024-06-04 18:11:16,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10252, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10828, PETRI_PLACES=286, PETRI_TRANSITIONS=537}
[2024-06-04 18:11:16,733 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 245 predicate places.
[2024-06-04 18:11:16,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 537 transitions, 10828 flow
[2024-06-04 18:11:16,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:16,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:16,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:16,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-04 18:11:16,734 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-04 18:11:16,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:16,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 628522315, now seen corresponding path program 6 times
[2024-06-04 18:11:16,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:16,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177126461]
[2024-06-04 18:11:16,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:16,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:16,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:23,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:23,581 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:23,581 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177126461]
[2024-06-04 18:11:23,581 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177126461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:23,581 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:23,581 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:11:23,581 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821202981]
[2024-06-04 18:11:23,581 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:23,582 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:11:23,582 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:23,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:11:23,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:11:23,776 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:11:23,776 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 537 transitions, 10828 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:23,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:23,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:11:23,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:25,969 INFO  L124   PetriNetUnfolderBase]: 4297/6381 cut-off events.
[2024-06-04 18:11:25,970 INFO  L125   PetriNetUnfolderBase]: For 443730/443734 co-relation queries the response was YES.
[2024-06-04 18:11:26,018 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61366 conditions, 6381 events. 4297/6381 cut-off events. For 443730/443734 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 34675 event pairs, 1056 based on Foata normal form. 10/6390 useless extension candidates. Maximal degree in co-relation 61227. Up to 5666 conditions per place. 
[2024-06-04 18:11:26,048 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 463 selfloop transitions, 107 changer transitions 0/573 dead transitions.
[2024-06-04 18:11:26,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 573 transitions, 12508 flow
[2024-06-04 18:11:26,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:11:26,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:11:26,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions.
[2024-06-04 18:11:26,053 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4025
[2024-06-04 18:11:26,053 INFO  L175             Difference]: Start difference. First operand has 286 places, 537 transitions, 10828 flow. Second operand 10 states and 161 transitions.
[2024-06-04 18:11:26,053 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 573 transitions, 12508 flow
[2024-06-04 18:11:27,126 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 573 transitions, 12335 flow, removed 60 selfloop flow, removed 5 redundant places.
[2024-06-04 18:11:27,135 INFO  L231             Difference]: Finished difference. Result has 292 places, 541 transitions, 11005 flow
[2024-06-04 18:11:27,135 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10661, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=11005, PETRI_PLACES=292, PETRI_TRANSITIONS=541}
[2024-06-04 18:11:27,135 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places.
[2024-06-04 18:11:27,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 292 places, 541 transitions, 11005 flow
[2024-06-04 18:11:27,136 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:27,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:27,136 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:27,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-04 18:11:27,136 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-04 18:11:27,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:27,136 INFO  L85        PathProgramCache]: Analyzing trace with hash -496800901, now seen corresponding path program 5 times
[2024-06-04 18:11:27,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:27,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382439229]
[2024-06-04 18:11:27,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:27,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:27,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:33,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:33,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:33,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382439229]
[2024-06-04 18:11:33,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382439229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:33,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:33,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:33,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787999323]
[2024-06-04 18:11:33,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:33,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:33,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:33,693 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:33,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:33,770 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:11:33,770 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 541 transitions, 11005 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:33,770 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:33,771 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:11:33,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:35,772 INFO  L124   PetriNetUnfolderBase]: 4298/6391 cut-off events.
[2024-06-04 18:11:35,780 INFO  L125   PetriNetUnfolderBase]: For 442361/442361 co-relation queries the response was YES.
[2024-06-04 18:11:35,831 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61801 conditions, 6391 events. 4298/6391 cut-off events. For 442361/442361 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 34834 event pairs, 1367 based on Foata normal form. 5/6395 useless extension candidates. Maximal degree in co-relation 61660. Up to 6254 conditions per place. 
[2024-06-04 18:11:35,861 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 515 selfloop transitions, 50 changer transitions 0/568 dead transitions.
[2024-06-04 18:11:35,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 568 transitions, 12519 flow
[2024-06-04 18:11:35,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:35,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:35,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions.
[2024-06-04 18:11:35,863 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39285714285714285
[2024-06-04 18:11:35,864 INFO  L175             Difference]: Start difference. First operand has 292 places, 541 transitions, 11005 flow. Second operand 7 states and 110 transitions.
[2024-06-04 18:11:35,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 568 transitions, 12519 flow
[2024-06-04 18:11:36,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 568 transitions, 12307 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-04 18:11:36,870 INFO  L231             Difference]: Finished difference. Result has 291 places, 546 transitions, 11052 flow
[2024-06-04 18:11:36,870 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10795, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11052, PETRI_PLACES=291, PETRI_TRANSITIONS=546}
[2024-06-04 18:11:36,871 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-04 18:11:36,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 546 transitions, 11052 flow
[2024-06-04 18:11:36,871 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:36,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:36,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:36,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-04 18:11:36,872 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-04 18:11:36,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:36,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 875789045, now seen corresponding path program 6 times
[2024-06-04 18:11:36,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:36,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135368641]
[2024-06-04 18:11:36,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:36,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:36,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:43,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:43,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:43,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135368641]
[2024-06-04 18:11:43,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135368641] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:43,280 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:43,280 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:43,280 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042025385]
[2024-06-04 18:11:43,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:43,281 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:43,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:43,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:43,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:43,374 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:11:43,374 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 546 transitions, 11052 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:43,374 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:43,374 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:11:43,374 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:45,526 INFO  L124   PetriNetUnfolderBase]: 4292/6384 cut-off events.
[2024-06-04 18:11:45,526 INFO  L125   PetriNetUnfolderBase]: For 433914/433914 co-relation queries the response was YES.
[2024-06-04 18:11:45,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61036 conditions, 6384 events. 4292/6384 cut-off events. For 433914/433914 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 34767 event pairs, 1380 based on Foata normal form. 2/6385 useless extension candidates. Maximal degree in co-relation 60895. Up to 6304 conditions per place. 
[2024-06-04 18:11:45,591 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 534 selfloop transitions, 22 changer transitions 0/559 dead transitions.
[2024-06-04 18:11:45,591 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 559 transitions, 12221 flow
[2024-06-04 18:11:45,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:11:45,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:11:45,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions.
[2024-06-04 18:11:45,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.37142857142857144
[2024-06-04 18:11:45,593 INFO  L175             Difference]: Start difference. First operand has 291 places, 546 transitions, 11052 flow. Second operand 7 states and 104 transitions.
[2024-06-04 18:11:45,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 559 transitions, 12221 flow
[2024-06-04 18:11:46,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 559 transitions, 11665 flow, removed 88 selfloop flow, removed 7 redundant places.
[2024-06-04 18:11:46,488 INFO  L231             Difference]: Finished difference. Result has 291 places, 546 transitions, 10548 flow
[2024-06-04 18:11:46,488 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10496, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10548, PETRI_PLACES=291, PETRI_TRANSITIONS=546}
[2024-06-04 18:11:46,490 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 250 predicate places.
[2024-06-04 18:11:46,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 546 transitions, 10548 flow
[2024-06-04 18:11:46,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:46,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:46,490 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:46,490 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-04 18:11:46,490 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-04 18:11:46,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:46,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 1951310017, now seen corresponding path program 7 times
[2024-06-04 18:11:46,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:46,491 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014420598]
[2024-06-04 18:11:46,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:46,491 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:46,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:11:53,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:11:53,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:11:53,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014420598]
[2024-06-04 18:11:53,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014420598] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:11:53,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:11:53,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:11:53,186 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742169732]
[2024-06-04 18:11:53,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:11:53,186 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:11:53,186 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:11:53,186 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:11:53,186 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:11:53,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:11:53,273 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 546 transitions, 10548 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:53,273 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:11:53,273 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:11:53,273 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:11:55,315 INFO  L124   PetriNetUnfolderBase]: 4286/6376 cut-off events.
[2024-06-04 18:11:55,315 INFO  L125   PetriNetUnfolderBase]: For 435489/435489 co-relation queries the response was YES.
[2024-06-04 18:11:55,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60507 conditions, 6376 events. 4286/6376 cut-off events. For 435489/435489 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 34713 event pairs, 1380 based on Foata normal form. 2/6377 useless extension candidates. Maximal degree in co-relation 60367. Up to 6272 conditions per place. 
[2024-06-04 18:11:55,386 INFO  L140   encePairwiseOnDemand]: 30/40 looper letters, 530 selfloop transitions, 31 changer transitions 0/564 dead transitions.
[2024-06-04 18:11:55,387 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 564 transitions, 11787 flow
[2024-06-04 18:11:55,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:11:55,388 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:11:55,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-04 18:11:55,389 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-04 18:11:55,389 INFO  L175             Difference]: Start difference. First operand has 291 places, 546 transitions, 10548 flow. Second operand 6 states and 97 transitions.
[2024-06-04 18:11:55,389 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 564 transitions, 11787 flow
[2024-06-04 18:11:56,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 564 transitions, 11647 flow, removed 48 selfloop flow, removed 5 redundant places.
[2024-06-04 18:11:56,234 INFO  L231             Difference]: Finished difference. Result has 292 places, 546 transitions, 10491 flow
[2024-06-04 18:11:56,234 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10408, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10491, PETRI_PLACES=292, PETRI_TRANSITIONS=546}
[2024-06-04 18:11:56,234 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places.
[2024-06-04 18:11:56,234 INFO  L495      AbstractCegarLoop]: Abstraction has has 292 places, 546 transitions, 10491 flow
[2024-06-04 18:11:56,235 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:11:56,235 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:11:56,235 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:11:56,235 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-04 18:11:56,235 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-04 18:11:56,235 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:11:56,235 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945596097, now seen corresponding path program 8 times
[2024-06-04 18:11:56,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:11:56,236 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954852109]
[2024-06-04 18:11:56,236 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:11:56,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:11:56,264 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:03,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:03,134 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:03,134 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954852109]
[2024-06-04 18:12:03,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954852109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:03,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:03,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-04 18:12:03,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524247968]
[2024-06-04 18:12:03,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:03,135 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-04 18:12:03,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:03,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-04 18:12:03,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-04 18:12:03,207 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:12:03,208 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 546 transitions, 10491 flow. Second operand  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:03,208 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:03,208 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:12:03,208 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:05,187 INFO  L124   PetriNetUnfolderBase]: 4270/6347 cut-off events.
[2024-06-04 18:12:05,188 INFO  L125   PetriNetUnfolderBase]: For 444837/444857 co-relation queries the response was YES.
[2024-06-04 18:12:05,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60268 conditions, 6347 events. 4270/6347 cut-off events. For 444837/444857 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 34508 event pairs, 1039 based on Foata normal form. 24/6370 useless extension candidates. Maximal degree in co-relation 60128. Up to 5975 conditions per place. 
[2024-06-04 18:12:05,267 INFO  L140   encePairwiseOnDemand]: 29/40 looper letters, 482 selfloop transitions, 92 changer transitions 0/577 dead transitions.
[2024-06-04 18:12:05,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 577 transitions, 11848 flow
[2024-06-04 18:12:05,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:12:05,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:12:05,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions.
[2024-06-04 18:12:05,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.425
[2024-06-04 18:12:05,269 INFO  L175             Difference]: Start difference. First operand has 292 places, 546 transitions, 10491 flow. Second operand 7 states and 119 transitions.
[2024-06-04 18:12:05,269 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 577 transitions, 11848 flow
[2024-06-04 18:12:06,444 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 577 transitions, 11742 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-04 18:12:06,452 INFO  L231             Difference]: Finished difference. Result has 294 places, 546 transitions, 10609 flow
[2024-06-04 18:12:06,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10385, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10609, PETRI_PLACES=294, PETRI_TRANSITIONS=546}
[2024-06-04 18:12:06,453 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 253 predicate places.
[2024-06-04 18:12:06,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 294 places, 546 transitions, 10609 flow
[2024-06-04 18:12:06,453 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:06,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:06,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:06,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-04 18:12:06,454 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-04 18:12:06,454 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:06,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957567119, now seen corresponding path program 7 times
[2024-06-04 18:12:06,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:06,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170868350]
[2024-06-04 18:12:06,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:06,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:06,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:13,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:13,367 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:13,367 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170868350]
[2024-06-04 18:12:13,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170868350] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:13,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:13,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:13,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300684698]
[2024-06-04 18:12:13,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:13,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:13,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:13,368 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:13,368 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:13,531 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:12:13,531 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 546 transitions, 10609 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:13,531 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:13,531 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:12:13,531 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:15,694 INFO  L124   PetriNetUnfolderBase]: 4377/6503 cut-off events.
[2024-06-04 18:12:15,694 INFO  L125   PetriNetUnfolderBase]: For 478952/478952 co-relation queries the response was YES.
[2024-06-04 18:12:15,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62664 conditions, 6503 events. 4377/6503 cut-off events. For 478952/478952 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 35518 event pairs, 1397 based on Foata normal form. 6/6508 useless extension candidates. Maximal degree in co-relation 62523. Up to 6283 conditions per place. 
[2024-06-04 18:12:15,769 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 532 selfloop transitions, 45 changer transitions 0/580 dead transitions.
[2024-06-04 18:12:15,769 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 580 transitions, 12205 flow
[2024-06-04 18:12:15,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:12:15,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:12:15,770 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions.
[2024-06-04 18:12:15,772 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38333333333333336
[2024-06-04 18:12:15,772 INFO  L175             Difference]: Start difference. First operand has 294 places, 546 transitions, 10609 flow. Second operand 9 states and 138 transitions.
[2024-06-04 18:12:15,773 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 580 transitions, 12205 flow
[2024-06-04 18:12:16,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 580 transitions, 11955 flow, removed 6 selfloop flow, removed 7 redundant places.
[2024-06-04 18:12:16,746 INFO  L231             Difference]: Finished difference. Result has 298 places, 559 transitions, 10731 flow
[2024-06-04 18:12:16,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10361, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10731, PETRI_PLACES=298, PETRI_TRANSITIONS=559}
[2024-06-04 18:12:16,747 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 257 predicate places.
[2024-06-04 18:12:16,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 298 places, 559 transitions, 10731 flow
[2024-06-04 18:12:16,747 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:16,747 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:16,747 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:16,748 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2024-06-04 18:12:16,748 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-04 18:12:16,748 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:16,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945602669, now seen corresponding path program 8 times
[2024-06-04 18:12:16,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:16,748 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437795618]
[2024-06-04 18:12:16,748 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:16,748 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:16,778 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:23,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-04 18:12:23,936 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:23,936 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437795618]
[2024-06-04 18:12:23,936 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437795618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:23,936 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:23,936 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:23,936 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445583226]
[2024-06-04 18:12:23,936 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:23,937 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:23,937 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:23,937 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:23,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:24,097 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:12:24,097 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 559 transitions, 10731 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:24,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:24,097 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:12:24,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:26,574 INFO  L124   PetriNetUnfolderBase]: 4783/7054 cut-off events.
[2024-06-04 18:12:26,575 INFO  L125   PetriNetUnfolderBase]: For 564217/564241 co-relation queries the response was YES.
[2024-06-04 18:12:26,618 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 71273 conditions, 7054 events. 4783/7054 cut-off events. For 564217/564241 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38531 event pairs, 887 based on Foata normal form. 28/7081 useless extension candidates. Maximal degree in co-relation 71130. Up to 5792 conditions per place. 
[2024-06-04 18:12:26,649 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 468 selfloop transitions, 145 changer transitions 0/616 dead transitions.
[2024-06-04 18:12:26,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 616 transitions, 12958 flow
[2024-06-04 18:12:26,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:26,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:26,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:12:26,650 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44375
[2024-06-04 18:12:26,650 INFO  L175             Difference]: Start difference. First operand has 298 places, 559 transitions, 10731 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:12:26,650 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 616 transitions, 12958 flow
[2024-06-04 18:12:27,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 616 transitions, 12819 flow, removed 61 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:27,877 INFO  L231             Difference]: Finished difference. Result has 305 places, 581 transitions, 11554 flow
[2024-06-04 18:12:27,878 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=10592, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11554, PETRI_PLACES=305, PETRI_TRANSITIONS=581}
[2024-06-04 18:12:27,878 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 264 predicate places.
[2024-06-04 18:12:27,878 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 581 transitions, 11554 flow
[2024-06-04 18:12:27,878 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:27,878 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:27,878 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:27,879 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2024-06-04 18:12:27,879 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-04 18:12:27,879 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:27,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -1490500327, now seen corresponding path program 9 times
[2024-06-04 18:12:27,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:27,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322553994]
[2024-06-04 18:12:27,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:27,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:27,911 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:34,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:34,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:34,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322553994]
[2024-06-04 18:12:34,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322553994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:34,754 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:34,754 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:34,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749037660]
[2024-06-04 18:12:34,754 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:34,754 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:34,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:34,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:34,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:34,920 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:12:34,920 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 581 transitions, 11554 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:34,920 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:34,920 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:12:34,920 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:37,357 INFO  L124   PetriNetUnfolderBase]: 4763/7032 cut-off events.
[2024-06-04 18:12:37,358 INFO  L125   PetriNetUnfolderBase]: For 579349/579353 co-relation queries the response was YES.
[2024-06-04 18:12:37,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72296 conditions, 7032 events. 4763/7032 cut-off events. For 579349/579353 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38528 event pairs, 918 based on Foata normal form. 16/7047 useless extension candidates. Maximal degree in co-relation 72149. Up to 5790 conditions per place. 
[2024-06-04 18:12:37,441 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 444 selfloop transitions, 177 changer transitions 0/624 dead transitions.
[2024-06-04 18:12:37,441 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 624 transitions, 13426 flow
[2024-06-04 18:12:37,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:12:37,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:12:37,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-04 18:12:37,442 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46875
[2024-06-04 18:12:37,442 INFO  L175             Difference]: Start difference. First operand has 305 places, 581 transitions, 11554 flow. Second operand 8 states and 150 transitions.
[2024-06-04 18:12:37,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 624 transitions, 13426 flow
[2024-06-04 18:12:38,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 624 transitions, 13224 flow, removed 84 selfloop flow, removed 3 redundant places.
[2024-06-04 18:12:38,933 INFO  L231             Difference]: Finished difference. Result has 312 places, 585 transitions, 12051 flow
[2024-06-04 18:12:38,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11368, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12051, PETRI_PLACES=312, PETRI_TRANSITIONS=585}
[2024-06-04 18:12:38,933 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 271 predicate places.
[2024-06-04 18:12:38,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 585 transitions, 12051 flow
[2024-06-04 18:12:38,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:38,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:38,934 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:38,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2024-06-04 18:12:38,934 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-04 18:12:38,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:38,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945961091, now seen corresponding path program 1 times
[2024-06-04 18:12:38,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:38,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700835423]
[2024-06-04 18:12:38,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:38,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:38,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:45,578 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:45,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:45,579 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700835423]
[2024-06-04 18:12:45,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700835423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:45,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:45,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:45,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689505553]
[2024-06-04 18:12:45,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:45,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:45,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:45,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:45,579 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:45,729 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:12:45,729 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 585 transitions, 12051 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:45,730 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:45,730 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:12:45,730 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:12:48,282 INFO  L124   PetriNetUnfolderBase]: 4760/7034 cut-off events.
[2024-06-04 18:12:48,283 INFO  L125   PetriNetUnfolderBase]: For 580669/580669 co-relation queries the response was YES.
[2024-06-04 18:12:48,327 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 73447 conditions, 7034 events. 4760/7034 cut-off events. For 580669/580669 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38578 event pairs, 1496 based on Foata normal form. 1/7034 useless extension candidates. Maximal degree in co-relation 73296. Up to 6961 conditions per place. 
[2024-06-04 18:12:48,359 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 572 selfloop transitions, 19 changer transitions 0/594 dead transitions.
[2024-06-04 18:12:48,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 594 transitions, 13267 flow
[2024-06-04 18:12:48,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:12:48,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:12:48,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions.
[2024-06-04 18:12:48,360 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-04 18:12:48,360 INFO  L175             Difference]: Start difference. First operand has 312 places, 585 transitions, 12051 flow. Second operand 6 states and 90 transitions.
[2024-06-04 18:12:48,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 594 transitions, 13267 flow
[2024-06-04 18:12:49,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 594 transitions, 13000 flow, removed 60 selfloop flow, removed 4 redundant places.
[2024-06-04 18:12:49,732 INFO  L231             Difference]: Finished difference. Result has 314 places, 585 transitions, 11832 flow
[2024-06-04 18:12:49,733 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11784, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11832, PETRI_PLACES=314, PETRI_TRANSITIONS=585}
[2024-06-04 18:12:49,733 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 273 predicate places.
[2024-06-04 18:12:49,733 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 585 transitions, 11832 flow
[2024-06-04 18:12:49,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:49,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:12:49,734 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:12:49,734 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69
[2024-06-04 18:12:49,734 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-04 18:12:49,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:12:49,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 1945592129, now seen corresponding path program 6 times
[2024-06-04 18:12:49,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:12:49,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450246044]
[2024-06-04 18:12:49,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:12:49,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:12:49,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:12:57,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:12:57,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:12:57,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450246044]
[2024-06-04 18:12:57,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450246044] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:12:57,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:12:57,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:12:57,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301634957]
[2024-06-04 18:12:57,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:12:57,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:12:57,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:12:57,902 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:12:57,902 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:12:58,005 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:12:58,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 585 transitions, 11832 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:12:58,005 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:12:58,005 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:12:58,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:00,626 INFO  L124   PetriNetUnfolderBase]: 4743/7005 cut-off events.
[2024-06-04 18:13:00,627 INFO  L125   PetriNetUnfolderBase]: For 587588/587592 co-relation queries the response was YES.
[2024-06-04 18:13:00,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72008 conditions, 7005 events. 4743/7005 cut-off events. For 587588/587592 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 38410 event pairs, 1119 based on Foata normal form. 7/7011 useless extension candidates. Maximal degree in co-relation 71856. Up to 6496 conditions per place. 
[2024-06-04 18:13:00,705 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 496 selfloop transitions, 122 changer transitions 0/621 dead transitions.
[2024-06-04 18:13:00,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 621 transitions, 13270 flow
[2024-06-04 18:13:00,707 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-04 18:13:00,707 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-04 18:13:00,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-04 18:13:00,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44375
[2024-06-04 18:13:00,707 INFO  L175             Difference]: Start difference. First operand has 314 places, 585 transitions, 11832 flow. Second operand 8 states and 142 transitions.
[2024-06-04 18:13:00,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 621 transitions, 13270 flow
[2024-06-04 18:13:01,924 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 621 transitions, 13200 flow, removed 8 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:01,933 INFO  L231             Difference]: Finished difference. Result has 317 places, 585 transitions, 12040 flow
[2024-06-04 18:13:01,933 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11762, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=12040, PETRI_PLACES=317, PETRI_TRANSITIONS=585}
[2024-06-04 18:13:01,934 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places.
[2024-06-04 18:13:01,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 585 transitions, 12040 flow
[2024-06-04 18:13:01,934 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:01,934 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:01,934 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:01,934 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70
[2024-06-04 18:13:01,934 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-04 18:13:01,935 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:01,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 1827490463, now seen corresponding path program 1 times
[2024-06-04 18:13:01,935 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:01,935 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120606681]
[2024-06-04 18:13:01,935 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:01,935 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:01,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:10,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:10,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:10,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120606681]
[2024-06-04 18:13:10,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120606681] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:10,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:10,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:10,727 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202421593]
[2024-06-04 18:13:10,727 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:10,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:10,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:10,727 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:10,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:10,823 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:13:10,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 585 transitions, 12040 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:10,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:10,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:13:10,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:13,204 INFO  L124   PetriNetUnfolderBase]: 4751/7023 cut-off events.
[2024-06-04 18:13:13,205 INFO  L125   PetriNetUnfolderBase]: For 593962/593962 co-relation queries the response was YES.
[2024-06-04 18:13:13,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72706 conditions, 7023 events. 4751/7023 cut-off events. For 593962/593962 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 38453 event pairs, 1444 based on Foata normal form. 2/7024 useless extension candidates. Maximal degree in co-relation 72553. Up to 6895 conditions per place. 
[2024-06-04 18:13:13,289 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 577 selfloop transitions, 27 changer transitions 0/607 dead transitions.
[2024-06-04 18:13:13,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 607 transitions, 13514 flow
[2024-06-04 18:13:13,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:13:13,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:13:13,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-04 18:13:13,291 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3892857142857143
[2024-06-04 18:13:13,291 INFO  L175             Difference]: Start difference. First operand has 317 places, 585 transitions, 12040 flow. Second operand 7 states and 109 transitions.
[2024-06-04 18:13:13,291 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 607 transitions, 13514 flow
[2024-06-04 18:13:14,444 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 607 transitions, 13282 flow, removed 10 selfloop flow, removed 6 redundant places.
[2024-06-04 18:13:14,453 INFO  L231             Difference]: Finished difference. Result has 318 places, 589 transitions, 11951 flow
[2024-06-04 18:13:14,453 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11808, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11951, PETRI_PLACES=318, PETRI_TRANSITIONS=589}
[2024-06-04 18:13:14,453 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 277 predicate places.
[2024-06-04 18:13:14,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 318 places, 589 transitions, 11951 flow
[2024-06-04 18:13:14,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:14,454 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:14,454 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:14,454 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71
[2024-06-04 18:13:14,454 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-04 18:13:14,454 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:14,454 INFO  L85        PathProgramCache]: Analyzing trace with hash 1940459977, now seen corresponding path program 2 times
[2024-06-04 18:13:14,455 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:14,455 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588471704]
[2024-06-04 18:13:14,455 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:14,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:14,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:23,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-04 18:13:23,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:23,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588471704]
[2024-06-04 18:13:23,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588471704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:23,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:23,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-04 18:13:23,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913782891]
[2024-06-04 18:13:23,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:23,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-04 18:13:23,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:23,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-04 18:13:23,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-04 18:13:23,160 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:13:23,160 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 589 transitions, 11951 flow. Second operand  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:23,160 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:23,161 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:13:23,161 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:25,530 INFO  L124   PetriNetUnfolderBase]: 4759/7034 cut-off events.
[2024-06-04 18:13:25,531 INFO  L125   PetriNetUnfolderBase]: For 607392/607392 co-relation queries the response was YES.
[2024-06-04 18:13:25,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72793 conditions, 7034 events. 4759/7034 cut-off events. For 607392/607392 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 38652 event pairs, 1489 based on Foata normal form. 2/7035 useless extension candidates. Maximal degree in co-relation 72639. Up to 6938 conditions per place. 
[2024-06-04 18:13:25,623 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 576 selfloop transitions, 25 changer transitions 0/604 dead transitions.
[2024-06-04 18:13:25,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 604 transitions, 13245 flow
[2024-06-04 18:13:25,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-04 18:13:25,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-04 18:13:25,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions.
[2024-06-04 18:13:25,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375
[2024-06-04 18:13:25,625 INFO  L175             Difference]: Start difference. First operand has 318 places, 589 transitions, 11951 flow. Second operand 7 states and 105 transitions.
[2024-06-04 18:13:25,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 604 transitions, 13245 flow
[2024-06-04 18:13:27,159 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 604 transitions, 13137 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-04 18:13:27,168 INFO  L231             Difference]: Finished difference. Result has 322 places, 591 transitions, 11946 flow
[2024-06-04 18:13:27,169 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11867, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11946, PETRI_PLACES=322, PETRI_TRANSITIONS=591}
[2024-06-04 18:13:27,169 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 281 predicate places.
[2024-06-04 18:13:27,169 INFO  L495      AbstractCegarLoop]: Abstraction has has 322 places, 591 transitions, 11946 flow
[2024-06-04 18:13:27,169 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:27,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:27,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:27,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72
[2024-06-04 18:13:27,170 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-04 18:13:27,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:27,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1951317953, now seen corresponding path program 3 times
[2024-06-04 18:13:27,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:27,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138332516]
[2024-06-04 18:13:27,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:27,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:27,198 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:35,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:35,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:35,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138332516]
[2024-06-04 18:13:35,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138332516] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:35,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:35,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:13:35,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735104105]
[2024-06-04 18:13:35,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:35,487 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:13:35,487 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:35,487 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:13:35,487 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:13:35,587 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:13:35,587 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 591 transitions, 11946 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:35,587 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:35,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:13:35,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:38,406 INFO  L124   PetriNetUnfolderBase]: 4754/7027 cut-off events.
[2024-06-04 18:13:38,407 INFO  L125   PetriNetUnfolderBase]: For 619327/619327 co-relation queries the response was YES.
[2024-06-04 18:13:38,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72798 conditions, 7027 events. 4754/7027 cut-off events. For 619327/619327 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 38541 event pairs, 1449 based on Foata normal form. 2/7028 useless extension candidates. Maximal degree in co-relation 72642. Up to 6921 conditions per place. 
[2024-06-04 18:13:38,486 INFO  L140   encePairwiseOnDemand]: 32/40 looper letters, 581 selfloop transitions, 22 changer transitions 0/606 dead transitions.
[2024-06-04 18:13:38,487 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 606 transitions, 13214 flow
[2024-06-04 18:13:38,487 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-04 18:13:38,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-04 18:13:38,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-04 18:13:38,491 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4041666666666667
[2024-06-04 18:13:38,491 INFO  L175             Difference]: Start difference. First operand has 322 places, 591 transitions, 11946 flow. Second operand 6 states and 97 transitions.
[2024-06-04 18:13:38,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 606 transitions, 13214 flow
[2024-06-04 18:13:39,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 606 transitions, 13145 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:40,008 INFO  L231             Difference]: Finished difference. Result has 323 places, 591 transitions, 11929 flow
[2024-06-04 18:13:40,008 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11877, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11929, PETRI_PLACES=323, PETRI_TRANSITIONS=591}
[2024-06-04 18:13:40,009 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 282 predicate places.
[2024-06-04 18:13:40,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 323 places, 591 transitions, 11929 flow
[2024-06-04 18:13:40,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:13:40,009 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:40,009 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:40,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73
[2024-06-04 18:13:40,009 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-04 18:13:40,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:40,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039687003, now seen corresponding path program 1 times
[2024-06-04 18:13:40,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:40,010 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067935378]
[2024-06-04 18:13:40,010 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:40,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:40,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:13:48,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:13:48,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:13:48,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067935378]
[2024-06-04 18:13:48,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067935378] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:13:48,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:13:48,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:13:48,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928921510]
[2024-06-04 18:13:48,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:13:48,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:13:48,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:13:48,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:13:48,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:13:48,987 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:13:48,987 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 591 transitions, 11929 flow. Second operand  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-04 18:13:48,987 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:13:48,987 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:13:48,987 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:13:52,629 INFO  L124   PetriNetUnfolderBase]: 5473/8111 cut-off events.
[2024-06-04 18:13:52,630 INFO  L125   PetriNetUnfolderBase]: For 834096/834113 co-relation queries the response was YES.
[2024-06-04 18:13:52,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85329 conditions, 8111 events. 5473/8111 cut-off events. For 834096/834113 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 45477 event pairs, 834 based on Foata normal form. 26/8136 useless extension candidates. Maximal degree in co-relation 85172. Up to 5987 conditions per place. 
[2024-06-04 18:13:52,722 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 553 selfloop transitions, 242 changer transitions 0/798 dead transitions.
[2024-06-04 18:13:52,722 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 798 transitions, 17404 flow
[2024-06-04 18:13:52,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:13:52,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:13:52,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-04 18:13:52,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4925
[2024-06-04 18:13:52,733 INFO  L175             Difference]: Start difference. First operand has 323 places, 591 transitions, 11929 flow. Second operand 10 states and 197 transitions.
[2024-06-04 18:13:52,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 798 transitions, 17404 flow
[2024-06-04 18:13:54,228 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 798 transitions, 17353 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-04 18:13:54,240 INFO  L231             Difference]: Finished difference. Result has 333 places, 719 transitions, 15479 flow
[2024-06-04 18:13:54,240 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=11878, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15479, PETRI_PLACES=333, PETRI_TRANSITIONS=719}
[2024-06-04 18:13:54,240 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places.
[2024-06-04 18:13:54,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 333 places, 719 transitions, 15479 flow
[2024-06-04 18:13:54,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-04 18:13:54,241 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:13:54,241 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:13:54,241 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74
[2024-06-04 18:13:54,241 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-04 18:13:54,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:13:54,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 2013205829, now seen corresponding path program 2 times
[2024-06-04 18:13:54,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:13:54,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981917782]
[2024-06-04 18:13:54,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:13:54,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:13:54,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:05,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:05,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:05,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981917782]
[2024-06-04 18:14:05,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981917782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:05,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:05,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:05,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914111613]
[2024-06-04 18:14:05,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:05,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:05,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:05,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:05,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:05,440 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40
[2024-06-04 18:14:05,440 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 719 transitions, 15479 flow. Second operand  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-04 18:14:05,440 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:05,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40
[2024-06-04 18:14:05,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:09,307 INFO  L124   PetriNetUnfolderBase]: 6319/9534 cut-off events.
[2024-06-04 18:14:09,307 INFO  L125   PetriNetUnfolderBase]: For 1286120/1286221 co-relation queries the response was YES.
[2024-06-04 18:14:09,400 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107213 conditions, 9534 events. 6319/9534 cut-off events. For 1286120/1286221 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 56763 event pairs, 1236 based on Foata normal form. 103/9536 useless extension candidates. Maximal degree in co-relation 107050. Up to 4588 conditions per place. 
[2024-06-04 18:14:09,453 INFO  L140   encePairwiseOnDemand]: 28/40 looper letters, 306 selfloop transitions, 397 changer transitions 30/816 dead transitions.
[2024-06-04 18:14:09,454 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 816 transitions, 18420 flow
[2024-06-04 18:14:09,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:09,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:09,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions.
[2024-06-04 18:14:09,455 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5166666666666667
[2024-06-04 18:14:09,455 INFO  L175             Difference]: Start difference. First operand has 333 places, 719 transitions, 15479 flow. Second operand 9 states and 186 transitions.
[2024-06-04 18:14:09,455 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 816 transitions, 18420 flow
[2024-06-04 18:14:11,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 816 transitions, 18149 flow, removed 133 selfloop flow, removed 2 redundant places.
[2024-06-04 18:14:12,008 INFO  L231             Difference]: Finished difference. Result has 341 places, 717 transitions, 15939 flow
[2024-06-04 18:14:12,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15294, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=390, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=15939, PETRI_PLACES=341, PETRI_TRANSITIONS=717}
[2024-06-04 18:14:12,009 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 300 predicate places.
[2024-06-04 18:14:12,009 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 717 transitions, 15939 flow
[2024-06-04 18:14:12,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-04 18:14:12,009 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:12,010 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:12,010 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75
[2024-06-04 18:14:12,010 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-04 18:14:12,010 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:12,010 INFO  L85        PathProgramCache]: Analyzing trace with hash 2052191429, now seen corresponding path program 3 times
[2024-06-04 18:14:12,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:12,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89674236]
[2024-06-04 18:14:12,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:12,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:12,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:21,748 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:21,748 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:21,748 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89674236]
[2024-06-04 18:14:21,748 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89674236] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:21,748 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:21,748 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:14:21,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797355284]
[2024-06-04 18:14:21,748 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:21,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:14:21,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:21,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:14:21,749 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:14:21,887 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:14:21,888 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 717 transitions, 15939 flow. Second operand  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-04 18:14:21,888 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:21,888 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:14:21,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:25,727 INFO  L124   PetriNetUnfolderBase]: 6397/9568 cut-off events.
[2024-06-04 18:14:25,727 INFO  L125   PetriNetUnfolderBase]: For 1158985/1159020 co-relation queries the response was YES.
[2024-06-04 18:14:25,828 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107259 conditions, 9568 events. 6397/9568 cut-off events. For 1158985/1159020 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 55813 event pairs, 1348 based on Foata normal form. 52/9619 useless extension candidates. Maximal degree in co-relation 107093. Up to 8288 conditions per place. 
[2024-06-04 18:14:25,883 INFO  L140   encePairwiseOnDemand]: 24/40 looper letters, 548 selfloop transitions, 256 changer transitions 0/807 dead transitions.
[2024-06-04 18:14:25,883 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 807 transitions, 19300 flow
[2024-06-04 18:14:25,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:14:25,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:14:25,884 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-04 18:14:25,884 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46
[2024-06-04 18:14:25,884 INFO  L175             Difference]: Start difference. First operand has 341 places, 717 transitions, 15939 flow. Second operand 10 states and 184 transitions.
[2024-06-04 18:14:25,884 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 807 transitions, 19300 flow
[2024-06-04 18:14:29,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 807 transitions, 18713 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:29,050 INFO  L231             Difference]: Finished difference. Result has 349 places, 746 transitions, 16666 flow
[2024-06-04 18:14:29,051 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=15376, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=227, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16666, PETRI_PLACES=349, PETRI_TRANSITIONS=746}
[2024-06-04 18:14:29,051 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 308 predicate places.
[2024-06-04 18:14:29,051 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 746 transitions, 16666 flow
[2024-06-04 18:14:29,051 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-04 18:14:29,052 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:29,052 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:29,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76
[2024-06-04 18:14:29,052 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-04 18:14:29,052 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:29,052 INFO  L85        PathProgramCache]: Analyzing trace with hash -1744443353, now seen corresponding path program 1 times
[2024-06-04 18:14:29,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:29,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608746112]
[2024-06-04 18:14:29,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:29,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:29,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:38,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:38,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:38,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608746112]
[2024-06-04 18:14:38,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608746112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:38,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:38,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:14:38,268 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341041616]
[2024-06-04 18:14:38,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:38,269 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:14:38,269 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:38,269 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:14:38,269 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:14:38,377 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:14:38,378 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 746 transitions, 16666 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:38,378 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:38,378 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:14:38,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:42,294 INFO  L124   PetriNetUnfolderBase]: 6407/9583 cut-off events.
[2024-06-04 18:14:42,294 INFO  L125   PetriNetUnfolderBase]: For 1139810/1139832 co-relation queries the response was YES.
[2024-06-04 18:14:42,366 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109834 conditions, 9583 events. 6407/9583 cut-off events. For 1139810/1139832 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 55761 event pairs, 1744 based on Foata normal form. 24/9606 useless extension candidates. Maximal degree in co-relation 109663. Up to 9207 conditions per place. 
[2024-06-04 18:14:42,412 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 666 selfloop transitions, 115 changer transitions 0/784 dead transitions.
[2024-06-04 18:14:42,412 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 784 transitions, 18885 flow
[2024-06-04 18:14:42,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:14:42,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:14:42,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions.
[2024-06-04 18:14:42,414 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41388888888888886
[2024-06-04 18:14:42,414 INFO  L175             Difference]: Start difference. First operand has 349 places, 746 transitions, 16666 flow. Second operand 9 states and 149 transitions.
[2024-06-04 18:14:42,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 784 transitions, 18885 flow
[2024-06-04 18:14:44,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 784 transitions, 18428 flow, removed 35 selfloop flow, removed 5 redundant places.
[2024-06-04 18:14:44,871 INFO  L231             Difference]: Finished difference. Result has 354 places, 752 transitions, 16674 flow
[2024-06-04 18:14:44,872 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16217, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16674, PETRI_PLACES=354, PETRI_TRANSITIONS=752}
[2024-06-04 18:14:44,875 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 313 predicate places.
[2024-06-04 18:14:44,875 INFO  L495      AbstractCegarLoop]: Abstraction has has 354 places, 752 transitions, 16674 flow
[2024-06-04 18:14:44,875 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:14:44,875 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:14:44,875 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:14:44,876 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77
[2024-06-04 18:14:44,876 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-04 18:14:44,876 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:14:44,876 INFO  L85        PathProgramCache]: Analyzing trace with hash 1339942757, now seen corresponding path program 4 times
[2024-06-04 18:14:44,876 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:14:44,877 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787127228]
[2024-06-04 18:14:44,877 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:14:44,877 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:14:44,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:14:55,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:14:55,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:14:55,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787127228]
[2024-06-04 18:14:55,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787127228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:14:55,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:14:55,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-04 18:14:55,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141101760]
[2024-06-04 18:14:55,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:14:55,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-04 18:14:55,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:14:55,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-04 18:14:55,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-04 18:14:55,986 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:14:55,986 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 752 transitions, 16674 flow. Second operand  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-04 18:14:55,986 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:14:55,986 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:14:55,986 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:14:59,872 INFO  L124   PetriNetUnfolderBase]: 6465/9677 cut-off events.
[2024-06-04 18:14:59,872 INFO  L125   PetriNetUnfolderBase]: For 1186878/1186900 co-relation queries the response was YES.
[2024-06-04 18:14:59,979 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110016 conditions, 9677 events. 6465/9677 cut-off events. For 1186878/1186900 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56513 event pairs, 1746 based on Foata normal form. 36/9712 useless extension candidates. Maximal degree in co-relation 109843. Up to 9148 conditions per place. 
[2024-06-04 18:15:00,034 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 673 selfloop transitions, 142 changer transitions 0/818 dead transitions.
[2024-06-04 18:15:00,034 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 818 transitions, 19402 flow
[2024-06-04 18:15:00,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-04 18:15:00,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-04 18:15:00,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions.
[2024-06-04 18:15:00,035 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41363636363636364
[2024-06-04 18:15:00,042 INFO  L175             Difference]: Start difference. First operand has 354 places, 752 transitions, 16674 flow. Second operand 11 states and 182 transitions.
[2024-06-04 18:15:00,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 818 transitions, 19402 flow
[2024-06-04 18:15:03,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 818 transitions, 19191 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:03,078 INFO  L231             Difference]: Finished difference. Result has 361 places, 773 transitions, 17326 flow
[2024-06-04 18:15:03,078 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=16463, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17326, PETRI_PLACES=361, PETRI_TRANSITIONS=773}
[2024-06-04 18:15:03,078 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 320 predicate places.
[2024-06-04 18:15:03,078 INFO  L495      AbstractCegarLoop]: Abstraction has has 361 places, 773 transitions, 17326 flow
[2024-06-04 18:15:03,079 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-04 18:15:03,079 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:03,079 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:03,079 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78
[2024-06-04 18:15:03,079 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-04 18:15:03,079 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:03,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526260427, now seen corresponding path program 2 times
[2024-06-04 18:15:03,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:03,080 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773165288]
[2024-06-04 18:15:03,080 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:03,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:03,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:12,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:12,897 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:12,897 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773165288]
[2024-06-04 18:15:12,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773165288] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:12,898 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:12,898 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:12,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499217395]
[2024-06-04 18:15:12,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:12,899 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:12,899 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:12,899 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:12,899 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:13,027 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:15:13,027 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 773 transitions, 17326 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:13,027 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:13,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:15:13,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:16,949 INFO  L124   PetriNetUnfolderBase]: 6469/9686 cut-off events.
[2024-06-04 18:15:16,949 INFO  L125   PetriNetUnfolderBase]: For 1190566/1190592 co-relation queries the response was YES.
[2024-06-04 18:15:17,027 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 110896 conditions, 9686 events. 6469/9686 cut-off events. For 1190566/1190592 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 56483 event pairs, 1778 based on Foata normal form. 28/9713 useless extension candidates. Maximal degree in co-relation 110720. Up to 9190 conditions per place. 
[2024-06-04 18:15:17,075 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 664 selfloop transitions, 142 changer transitions 0/809 dead transitions.
[2024-06-04 18:15:17,075 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 809 transitions, 19467 flow
[2024-06-04 18:15:17,077 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:17,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:17,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions.
[2024-06-04 18:15:17,077 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41944444444444445
[2024-06-04 18:15:17,077 INFO  L175             Difference]: Start difference. First operand has 361 places, 773 transitions, 17326 flow. Second operand 9 states and 151 transitions.
[2024-06-04 18:15:17,077 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 809 transitions, 19467 flow
[2024-06-04 18:15:19,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 809 transitions, 19165 flow, removed 34 selfloop flow, removed 6 redundant places.
[2024-06-04 18:15:19,824 INFO  L231             Difference]: Finished difference. Result has 364 places, 778 transitions, 17426 flow
[2024-06-04 18:15:19,825 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17034, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17426, PETRI_PLACES=364, PETRI_TRANSITIONS=778}
[2024-06-04 18:15:19,825 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 323 predicate places.
[2024-06-04 18:15:19,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 364 places, 778 transitions, 17426 flow
[2024-06-04 18:15:19,825 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:19,825 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:19,825 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:19,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79
[2024-06-04 18:15:19,826 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-04 18:15:19,826 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:19,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 345476380, now seen corresponding path program 1 times
[2024-06-04 18:15:19,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:19,826 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484669872]
[2024-06-04 18:15:19,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:19,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:19,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:30,218 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:30,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:30,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484669872]
[2024-06-04 18:15:30,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484669872] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:30,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:30,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:30,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090563686]
[2024-06-04 18:15:30,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:30,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:30,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:30,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:30,219 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:30,335 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:15:30,335 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 778 transitions, 17426 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:30,335 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:30,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:15:30,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:34,387 INFO  L124   PetriNetUnfolderBase]: 6693/9997 cut-off events.
[2024-06-04 18:15:34,387 INFO  L125   PetriNetUnfolderBase]: For 1294117/1294162 co-relation queries the response was YES.
[2024-06-04 18:15:34,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 115299 conditions, 9997 events. 6693/9997 cut-off events. For 1294117/1294162 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 58214 event pairs, 1534 based on Foata normal form. 52/10048 useless extension candidates. Maximal degree in co-relation 115122. Up to 6422 conditions per place. 
[2024-06-04 18:15:34,517 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 513 selfloop transitions, 358 changer transitions 0/874 dead transitions.
[2024-06-04 18:15:34,517 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 874 transitions, 21126 flow
[2024-06-04 18:15:34,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:34,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:34,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-04 18:15:34,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-04 18:15:34,518 INFO  L175             Difference]: Start difference. First operand has 364 places, 778 transitions, 17426 flow. Second operand 9 states and 171 transitions.
[2024-06-04 18:15:34,518 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 874 transitions, 21126 flow
[2024-06-04 18:15:37,385 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 874 transitions, 20751 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-04 18:15:37,399 INFO  L231             Difference]: Finished difference. Result has 367 places, 798 transitions, 18335 flow
[2024-06-04 18:15:37,400 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17051, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=338, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18335, PETRI_PLACES=367, PETRI_TRANSITIONS=798}
[2024-06-04 18:15:37,400 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 326 predicate places.
[2024-06-04 18:15:37,400 INFO  L495      AbstractCegarLoop]: Abstraction has has 367 places, 798 transitions, 18335 flow
[2024-06-04 18:15:37,400 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:37,400 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:37,401 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:37,401 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80
[2024-06-04 18:15:37,401 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-04 18:15:37,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:37,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 1576650403, now seen corresponding path program 3 times
[2024-06-04 18:15:37,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:37,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719888859]
[2024-06-04 18:15:37,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:37,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:37,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:15:47,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:15:47,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:15:47,246 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719888859]
[2024-06-04 18:15:47,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719888859] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:15:47,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:15:47,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:15:47,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97073905]
[2024-06-04 18:15:47,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:15:47,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:15:47,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:15:47,246 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:15:47,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:15:47,364 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:15:47,365 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 798 transitions, 18335 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:47,365 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:15:47,365 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:15:47,365 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:15:51,400 INFO  L124   PetriNetUnfolderBase]: 6703/10011 cut-off events.
[2024-06-04 18:15:51,401 INFO  L125   PetriNetUnfolderBase]: For 1314876/1314918 co-relation queries the response was YES.
[2024-06-04 18:15:51,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118115 conditions, 10011 events. 6703/10011 cut-off events. For 1314876/1314918 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 58502 event pairs, 1802 based on Foata normal form. 44/10054 useless extension candidates. Maximal degree in co-relation 117936. Up to 9512 conditions per place. 
[2024-06-04 18:15:51,530 INFO  L140   encePairwiseOnDemand]: 27/40 looper letters, 690 selfloop transitions, 139 changer transitions 0/832 dead transitions.
[2024-06-04 18:15:51,530 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 832 transitions, 20553 flow
[2024-06-04 18:15:51,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-04 18:15:51,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-04 18:15:51,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions.
[2024-06-04 18:15:51,532 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-04 18:15:51,532 INFO  L175             Difference]: Start difference. First operand has 367 places, 798 transitions, 18335 flow. Second operand 9 states and 150 transitions.
[2024-06-04 18:15:51,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 832 transitions, 20553 flow
[2024-06-04 18:15:54,695 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 832 transitions, 19944 flow, removed 84 selfloop flow, removed 4 redundant places.
[2024-06-04 18:15:54,709 INFO  L231             Difference]: Finished difference. Result has 372 places, 803 transitions, 18144 flow
[2024-06-04 18:15:54,709 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17727, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18144, PETRI_PLACES=372, PETRI_TRANSITIONS=803}
[2024-06-04 18:15:54,710 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 331 predicate places.
[2024-06-04 18:15:54,710 INFO  L495      AbstractCegarLoop]: Abstraction has has 372 places, 803 transitions, 18144 flow
[2024-06-04 18:15:54,710 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:15:54,710 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:15:54,710 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:15:54,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81
[2024-06-04 18:15:54,710 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-04 18:15:54,711 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:15:54,711 INFO  L85        PathProgramCache]: Analyzing trace with hash 912778076, now seen corresponding path program 2 times
[2024-06-04 18:15:54,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:15:54,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589646267]
[2024-06-04 18:15:54,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:15:54,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:15:54,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-04 18:16:04,534 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-04 18:16:04,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-04 18:16:04,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589646267]
[2024-06-04 18:16:04,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589646267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-04 18:16:04,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-04 18:16:04,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-04 18:16:04,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530352316]
[2024-06-04 18:16:04,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-04 18:16:04,536 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-04 18:16:04,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-04 18:16:04,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-04 18:16:04,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-04 18:16:04,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40
[2024-06-04 18:16:04,653 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 803 transitions, 18144 flow. Second operand  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:04,653 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-04 18:16:04,653 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40
[2024-06-04 18:16:04,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-04 18:16:08,765 INFO  L124   PetriNetUnfolderBase]: 6771/10111 cut-off events.
[2024-06-04 18:16:08,765 INFO  L125   PetriNetUnfolderBase]: For 1370801/1370805 co-relation queries the response was YES.
[2024-06-04 18:16:08,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117728 conditions, 10111 events. 6771/10111 cut-off events. For 1370801/1370805 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 59148 event pairs, 1938 based on Foata normal form. 16/10126 useless extension candidates. Maximal degree in co-relation 117548. Up to 9622 conditions per place. 
[2024-06-04 18:16:08,902 INFO  L140   encePairwiseOnDemand]: 26/40 looper letters, 755 selfloop transitions, 93 changer transitions 0/851 dead transitions.
[2024-06-04 18:16:08,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 851 transitions, 20477 flow
[2024-06-04 18:16:08,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-04 18:16:08,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-04 18:16:08,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions.
[2024-06-04 18:16:08,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41
[2024-06-04 18:16:08,903 INFO  L175             Difference]: Start difference. First operand has 372 places, 803 transitions, 18144 flow. Second operand 10 states and 164 transitions.
[2024-06-04 18:16:08,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 851 transitions, 20477 flow
[2024-06-04 18:16:12,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 851 transitions, 20142 flow, removed 26 selfloop flow, removed 8 redundant places.
[2024-06-04 18:16:12,206 INFO  L231             Difference]: Finished difference. Result has 374 places, 812 transitions, 18268 flow
[2024-06-04 18:16:12,207 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=17809, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18268, PETRI_PLACES=374, PETRI_TRANSITIONS=812}
[2024-06-04 18:16:12,207 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 333 predicate places.
[2024-06-04 18:16:12,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 374 places, 812 transitions, 18268 flow
[2024-06-04 18:16:12,207 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-04 18:16:12,207 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-04 18:16:12,208 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-04 18:16:12,208 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82
[2024-06-04 18:16:12,208 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-04 18:16:12,208 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-04 18:16:12,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -278356624, now seen corresponding path program 3 times
[2024-06-04 18:16:12,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-04 18:16:12,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756864583]
[2024-06-04 18:16:12,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-04 18:16:12,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-04 18:16:12,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15