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


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m
[2024-06-14 14:51:24,681 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 14:51:24,774 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 14:51:24,780 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 14:51:24,780 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 14:51:24,806 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 14:51:24,807 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 14:51:24,807 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 14:51:24,807 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 14:51:24,810 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 14:51:24,811 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 14:51:24,811 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 14:51:24,811 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 14:51:24,812 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 14:51:24,812 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 14:51:24,813 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 14:51:24,813 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 14:51:24,813 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 14:51:24,813 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 14:51:24,813 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 14:51:24,814 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 14:51:24,814 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 14:51:24,814 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 14:51:24,814 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 14:51:24,815 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 14:51:24,815 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 14:51:24,815 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 14:51:24,815 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 14:51:24,816 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 14:51:24,816 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 14:51:24,817 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 14:51:24,817 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 14:51:24,817 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:51:24,817 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 14:51:24,818 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 14:51:24,818 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 14:51:24,818 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 14:51:24,818 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 14:51:24,818 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 14:51:24,819 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 14:51:24,819 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 14:51:24,819 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 14:51:24,819 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 14:51:24,819 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-14 14:51:25,046 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 14:51:25,067 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 14:51:25,069 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 14:51:25,070 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 14:51:25,071 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 14:51:25,072 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/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml
[2024-06-14 14:51:25,216 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 14:51:25,216 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 14:51:25,217 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-06-14 14:51:26,275 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 14:51:26,480 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 14:51:26,481 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-06-14 14:51:26,495 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26dbe127a/79dbdb56aa0b410d97af6f28a597e06f/FLAG388674e3c
[2024-06-14 14:51:26,505 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26dbe127a/79dbdb56aa0b410d97af6f28a597e06f
[2024-06-14 14:51:26,506 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 14:51:26,507 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 14:51:26,509 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 14:51:26,509 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 14:51:26,514 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 14:51:26,514 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:51:25" (1/2) ...
[2024-06-14 14:51:26,515 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6585bb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:51:26, skipping insertion in model container
[2024-06-14 14:51:26,515 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:51:25" (1/2) ...
[2024-06-14 14:51:26,517 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60b8219c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 02:51:26, skipping insertion in model container
[2024-06-14 14:51:26,517 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:51:26" (2/2) ...
[2024-06-14 14:51:26,517 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6585bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:26, skipping insertion in model container
[2024-06-14 14:51:26,518 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 02:51:26" (2/2) ...
[2024-06-14 14:51:26,518 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 14:51:26,589 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 14:51:26,591 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] (((((((((((((((((((! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))
[2024-06-14 14:51:26,591 INFO  L97    edCorrectnessWitness]: Location invariant before [L843-L843] (((((((((((((((((((! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))
[2024-06-14 14:51:26,592 INFO  L97    edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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 )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 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 )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$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 )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (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 )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$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 )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$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 )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))
[2024-06-14 14:51:26,592 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 14:51:26,592 INFO  L106   edCorrectnessWitness]: ghost_update [L839-L839] multithreaded = 1;
[2024-06-14 14:51:26,653 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 14:51:26,974 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:51:26,984 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 14:51:27,321 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 14:51:27,356 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 14:51:27,356 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27 WrapperNode
[2024-06-14 14:51:27,356 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 14:51:27,358 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 14:51:27,358 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 14:51:27,358 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 14:51:27,363 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,394 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,625 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-14 14:51:27,626 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 14:51:27,627 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 14:51:27,627 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 14:51:27,627 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 14:51:27,647 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,647 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,672 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,728 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-14 14:51:27,729 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,729 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,772 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,774 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,794 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,800 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,887 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 14:51:27,888 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 14:51:27,888 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 14:51:27,888 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 14:51:27,889 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (1/1) ...
[2024-06-14 14:51:27,894 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 14:51:27,900 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 14:51:27,942 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-14 14:51:27,980 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-14 14:51:27,998 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 14:51:27,998 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 14:51:27,998 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 14:51:27,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 14:51:27,999 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 14:51:27,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 14:51:27,999 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 14:51:27,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 14:51:27,999 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 14:51:27,999 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 14:51:27,999 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 14:51:28,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 14:51:28,001 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 14:51:28,122 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 14:51:28,123 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 14:51:29,413 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 14:51:29,414 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 14:51:29,717 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 14:51:29,718 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 14:51:29,718 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:51:29 BoogieIcfgContainer
[2024-06-14 14:51:29,718 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 14:51:29,720 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 14:51:29,721 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 14:51:29,723 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 14:51:29,723 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 02:51:25" (1/4) ...
[2024-06-14 14:51:29,724 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee58f07 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 02:51:29, skipping insertion in model container
[2024-06-14 14:51:29,724 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 02:51:26" (2/4) ...
[2024-06-14 14:51:29,725 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee58f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:51:29, skipping insertion in model container
[2024-06-14 14:51:29,725 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 02:51:27" (3/4) ...
[2024-06-14 14:51:29,725 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee58f07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 02:51:29, skipping insertion in model container
[2024-06-14 14:51:29,725 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 02:51:29" (4/4) ...
[2024-06-14 14:51:29,726 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-06-14 14:51:29,739 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 14:51:29,739 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 14:51:29,739 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 14:51:29,879 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 14:51:29,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 14:51:29,954 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-14 14:51:29,954 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:51:29,956 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49 conditions, 39 events. 0/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 14:51:29,957 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-14 14:51:29,959 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-14 14:51:29,970 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 14:51:29,976 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;@3c7e64af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 14:51:29,976 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 14:51:29,983 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 14:51:29,984 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-14 14:51:29,984 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 14:51:29,984 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:29,985 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:29,985 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:29,989 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:29,989 INFO  L85        PathProgramCache]: Analyzing trace with hash -1315925462, now seen corresponding path program 1 times
[2024-06-14 14:51:29,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:29,996 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161046799]
[2024-06-14 14:51:29,996 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:29,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:30,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:36,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:36,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:36,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161046799]
[2024-06-14 14:51:36,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161046799] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:36,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:36,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 14:51:36,554 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49147892]
[2024-06-14 14:51:36,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:36,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 14:51:36,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:36,584 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 14:51:36,584 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 14:51:36,655 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 14:51:36,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:36,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:36,657 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 14:51:36,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:37,610 INFO  L124   PetriNetUnfolderBase]: 1359/2100 cut-off events.
[2024-06-14 14:51:37,610 INFO  L125   PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES.
[2024-06-14 14:51:37,615 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4216 conditions, 2100 events. 1359/2100 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 10067 event pairs, 941 based on Foata normal form. 1/2058 useless extension candidates. Maximal degree in co-relation 4201. Up to 2029 conditions per place. 
[2024-06-14 14:51:37,623 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 34 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-14 14:51:37,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 177 flow
[2024-06-14 14:51:37,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 14:51:37,627 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 14:51:37,631 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions.
[2024-06-14 14:51:37,632 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5873015873015873
[2024-06-14 14:51:37,634 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 74 transitions.
[2024-06-14 14:51:37,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 177 flow
[2024-06-14 14:51:37,636 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 14:51:37,637 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-14 14:51:37,639 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2024-06-14 14:51:37,641 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-14 14:51:37,641 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-14 14:51:37,641 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:37,641 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:37,642 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:37,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 14:51:37,642 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:37,642 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:37,643 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883946295, now seen corresponding path program 1 times
[2024-06-14 14:51:37,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:37,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501120059]
[2024-06-14 14:51:37,643 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:37,643 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:37,747 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:42,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-14 14:51:42,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:42,486 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501120059]
[2024-06-14 14:51:42,486 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501120059] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:42,486 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:42,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 14:51:42,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988868852]
[2024-06-14 14:51:42,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:42,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 14:51:42,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:42,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 14:51:42,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-14 14:51:42,662 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42
[2024-06-14 14:51:42,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:42,663 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:42,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42
[2024-06-14 14:51:42,663 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:43,716 INFO  L124   PetriNetUnfolderBase]: 1353/2091 cut-off events.
[2024-06-14 14:51:43,716 INFO  L125   PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES.
[2024-06-14 14:51:43,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2091 events. 1353/2091 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9990 event pairs, 795 based on Foata normal form. 3/2084 useless extension candidates. Maximal degree in co-relation 4734. Up to 2005 conditions per place. 
[2024-06-14 14:51:43,727 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 41 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-14 14:51:43,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 244 flow
[2024-06-14 14:51:43,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 14:51:43,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 14:51:43,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions.
[2024-06-14 14:51:43,729 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5654761904761905
[2024-06-14 14:51:43,730 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 95 transitions.
[2024-06-14 14:51:43,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 244 flow
[2024-06-14 14:51:43,731 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 14:51:43,731 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-14 14:51:43,732 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-14 14:51:43,732 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-14 14:51:43,732 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-14 14:51:43,733 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:43,733 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:43,733 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:43,733 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 14:51:43,733 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-14 14:51:43,734 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:43,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 2003849064, now seen corresponding path program 1 times
[2024-06-14 14:51:43,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:43,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959863345]
[2024-06-14 14:51:43,734 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:43,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:43,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:48,913 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:48,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:48,914 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959863345]
[2024-06-14 14:51:48,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959863345] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:48,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:48,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:51:48,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752413177]
[2024-06-14 14:51:48,915 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:48,915 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:51:48,915 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:48,915 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:51:48,916 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:51:49,003 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:51:49,004 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:49,004 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:49,004 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:51:49,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:50,080 INFO  L124   PetriNetUnfolderBase]: 1641/2511 cut-off events.
[2024-06-14 14:51:50,081 INFO  L125   PetriNetUnfolderBase]: For 1285/1285 co-relation queries the response was YES.
[2024-06-14 14:51:50,084 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6296 conditions, 2511 events. 1641/2511 cut-off events. For 1285/1285 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11943 event pairs, 746 based on Foata normal form. 3/2502 useless extension candidates. Maximal degree in co-relation 6279. Up to 2393 conditions per place. 
[2024-06-14 14:51:50,092 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 56 selfloop transitions, 13 changer transitions 0/73 dead transitions.
[2024-06-14 14:51:50,092 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 378 flow
[2024-06-14 14:51:50,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:51:50,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:51:50,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions.
[2024-06-14 14:51:50,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2024-06-14 14:51:50,094 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 6 states and 132 transitions.
[2024-06-14 14:51:50,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 378 flow
[2024-06-14 14:51:50,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 358 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-06-14 14:51:50,097 INFO  L231             Difference]: Finished difference. Result has 51 places, 45 transitions, 196 flow
[2024-06-14 14:51:50,097 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=51, PETRI_TRANSITIONS=45}
[2024-06-14 14:51:50,098 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-14 14:51:50,098 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 196 flow
[2024-06-14 14:51:50,098 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:50,098 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:50,099 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:50,099 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 14:51:50,099 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:50,099 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:50,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 1989780140, now seen corresponding path program 1 times
[2024-06-14 14:51:50,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:50,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502684723]
[2024-06-14 14:51:50,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:50,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:50,155 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:51:55,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:51:55,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:51:55,678 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502684723]
[2024-06-14 14:51:55,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502684723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:51:55,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:51:55,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:51:55,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977510547]
[2024-06-14 14:51:55,679 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:51:55,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:51:55,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:51:55,681 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:51:55,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:51:55,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-14 14:51:55,845 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 196 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:55,845 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:51:55,845 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-14 14:51:55,845 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:51:57,070 INFO  L124   PetriNetUnfolderBase]: 1632/2496 cut-off events.
[2024-06-14 14:51:57,071 INFO  L125   PetriNetUnfolderBase]: For 2539/2539 co-relation queries the response was YES.
[2024-06-14 14:51:57,074 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6975 conditions, 2496 events. 1632/2496 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 11804 event pairs, 582 based on Foata normal form. 6/2490 useless extension candidates. Maximal degree in co-relation 6956. Up to 2348 conditions per place. 
[2024-06-14 14:51:57,083 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 60 selfloop transitions, 15 changer transitions 0/79 dead transitions.
[2024-06-14 14:51:57,083 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 79 transitions, 438 flow
[2024-06-14 14:51:57,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:51:57,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:51:57,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions.
[2024-06-14 14:51:57,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5034013605442177
[2024-06-14 14:51:57,087 INFO  L175             Difference]: Start difference. First operand has 51 places, 45 transitions, 196 flow. Second operand 7 states and 148 transitions.
[2024-06-14 14:51:57,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 79 transitions, 438 flow
[2024-06-14 14:51:57,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 410 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 14:51:57,092 INFO  L231             Difference]: Finished difference. Result has 54 places, 46 transitions, 217 flow
[2024-06-14 14:51:57,092 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=46}
[2024-06-14 14:51:57,094 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places.
[2024-06-14 14:51:57,094 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 217 flow
[2024-06-14 14:51:57,094 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:51:57,094 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:51:57,094 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:51:57,094 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 14:51:57,095 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:51:57,095 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:51:57,095 INFO  L85        PathProgramCache]: Analyzing trace with hash 1263716854, now seen corresponding path program 1 times
[2024-06-14 14:51:57,095 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:51:57,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700400385]
[2024-06-14 14:51:57,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:51:57,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:51:57,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:09,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:09,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:09,184 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700400385]
[2024-06-14 14:52:09,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700400385] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:09,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:09,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:52:09,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732113460]
[2024-06-14 14:52:09,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:09,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:52:09,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:09,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:52:09,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:52:09,288 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:52:09,290 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 217 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:09,290 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:09,290 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:52:09,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:10,449 INFO  L124   PetriNetUnfolderBase]: 1627/2501 cut-off events.
[2024-06-14 14:52:10,449 INFO  L125   PetriNetUnfolderBase]: For 3802/3802 co-relation queries the response was YES.
[2024-06-14 14:52:10,454 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7410 conditions, 2501 events. 1627/2501 cut-off events. For 3802/3802 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11854 event pairs, 689 based on Foata normal form. 2/2503 useless extension candidates. Maximal degree in co-relation 7390. Up to 2407 conditions per place. 
[2024-06-14 14:52:10,461 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 48 selfloop transitions, 8 changer transitions 0/60 dead transitions.
[2024-06-14 14:52:10,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 60 transitions, 373 flow
[2024-06-14 14:52:10,462 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:52:10,462 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:52:10,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-06-14 14:52:10,463 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-14 14:52:10,464 INFO  L175             Difference]: Start difference. First operand has 54 places, 46 transitions, 217 flow. Second operand 5 states and 92 transitions.
[2024-06-14 14:52:10,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 60 transitions, 373 flow
[2024-06-14 14:52:10,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 334 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-06-14 14:52:10,471 INFO  L231             Difference]: Finished difference. Result has 54 places, 49 transitions, 224 flow
[2024-06-14 14:52:10,472 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=49}
[2024-06-14 14:52:10,474 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places.
[2024-06-14 14:52:10,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 224 flow
[2024-06-14 14:52:10,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:10,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:10,480 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:10,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 14:52:10,481 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:10,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:10,481 INFO  L85        PathProgramCache]: Analyzing trace with hash 557161464, now seen corresponding path program 1 times
[2024-06-14 14:52:10,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:10,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660031617]
[2024-06-14 14:52:10,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:10,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:10,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:23,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:23,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:23,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660031617]
[2024-06-14 14:52:23,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660031617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:23,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:23,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:52:23,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838509352]
[2024-06-14 14:52:23,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:23,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:52:23,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:23,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:52:23,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:52:23,487 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:52:23,487 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 224 flow. Second operand  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:23,487 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:23,487 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:52:23,487 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:24,737 INFO  L124   PetriNetUnfolderBase]: 1883/2795 cut-off events.
[2024-06-14 14:52:24,738 INFO  L125   PetriNetUnfolderBase]: For 6041/6041 co-relation queries the response was YES.
[2024-06-14 14:52:24,743 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 2795 events. 1883/2795 cut-off events. For 6041/6041 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12579 event pairs, 763 based on Foata normal form. 6/2801 useless extension candidates. Maximal degree in co-relation 8883. Up to 2725 conditions per place. 
[2024-06-14 14:52:24,755 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 59 selfloop transitions, 17 changer transitions 0/79 dead transitions.
[2024-06-14 14:52:24,756 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 79 transitions, 496 flow
[2024-06-14 14:52:24,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:24,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:24,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 14:52:24,757 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-14 14:52:24,757 INFO  L175             Difference]: Start difference. First operand has 54 places, 49 transitions, 224 flow. Second operand 6 states and 111 transitions.
[2024-06-14 14:52:24,757 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 79 transitions, 496 flow
[2024-06-14 14:52:24,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 79 transitions, 474 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-14 14:52:24,762 INFO  L231             Difference]: Finished difference. Result has 59 places, 60 transitions, 327 flow
[2024-06-14 14:52:24,762 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=327, PETRI_PLACES=59, PETRI_TRANSITIONS=60}
[2024-06-14 14:52:24,762 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-14 14:52:24,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 327 flow
[2024-06-14 14:52:24,763 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:24,763 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:24,763 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:24,763 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 14:52:24,763 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:24,764 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:24,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -1044008201, now seen corresponding path program 1 times
[2024-06-14 14:52:24,764 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:24,764 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350710929]
[2024-06-14 14:52:24,764 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:24,764 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:24,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:33,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-14 14:52:33,673 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:33,673 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350710929]
[2024-06-14 14:52:33,673 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350710929] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:33,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:33,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:52:33,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246767878]
[2024-06-14 14:52:33,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:33,674 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:52:33,674 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:33,674 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:52:33,674 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:52:33,801 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:52:33,802 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 327 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:33,802 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:33,802 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:52:33,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:34,915 INFO  L124   PetriNetUnfolderBase]: 1698/2615 cut-off events.
[2024-06-14 14:52:34,916 INFO  L125   PetriNetUnfolderBase]: For 8055/8073 co-relation queries the response was YES.
[2024-06-14 14:52:34,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9210 conditions, 2615 events. 1698/2615 cut-off events. For 8055/8073 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12503 event pairs, 669 based on Foata normal form. 6/2607 useless extension candidates. Maximal degree in co-relation 9185. Up to 2456 conditions per place. 
[2024-06-14 14:52:34,969 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 63 selfloop transitions, 16 changer transitions 0/86 dead transitions.
[2024-06-14 14:52:34,970 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 607 flow
[2024-06-14 14:52:34,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:34,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:34,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-14 14:52:34,971 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45634920634920634
[2024-06-14 14:52:34,971 INFO  L175             Difference]: Start difference. First operand has 59 places, 60 transitions, 327 flow. Second operand 6 states and 115 transitions.
[2024-06-14 14:52:34,971 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 607 flow
[2024-06-14 14:52:34,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 591 flow, removed 7 selfloop flow, removed 1 redundant places.
[2024-06-14 14:52:34,978 INFO  L231             Difference]: Finished difference. Result has 64 places, 66 transitions, 405 flow
[2024-06-14 14:52:34,978 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=405, PETRI_PLACES=64, PETRI_TRANSITIONS=66}
[2024-06-14 14:52:34,979 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 21 predicate places.
[2024-06-14 14:52:34,979 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 405 flow
[2024-06-14 14:52:34,980 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:34,980 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:34,980 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:34,980 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 14:52:34,980 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:34,980 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:34,980 INFO  L85        PathProgramCache]: Analyzing trace with hash 130675729, now seen corresponding path program 2 times
[2024-06-14 14:52:34,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:34,981 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566349057]
[2024-06-14 14:52:34,981 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:34,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:35,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:44,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:44,485 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:44,485 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566349057]
[2024-06-14 14:52:44,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566349057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:44,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:44,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:52:44,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281413625]
[2024-06-14 14:52:44,485 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:44,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:52:44,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:44,486 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:52:44,486 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:52:44,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:52:44,594 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 405 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:44,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:44,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:52:44,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:45,659 INFO  L124   PetriNetUnfolderBase]: 1693/2607 cut-off events.
[2024-06-14 14:52:45,659 INFO  L125   PetriNetUnfolderBase]: For 10161/10175 co-relation queries the response was YES.
[2024-06-14 14:52:45,665 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9745 conditions, 2607 events. 1693/2607 cut-off events. For 10161/10175 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12404 event pairs, 665 based on Foata normal form. 2/2595 useless extension candidates. Maximal degree in co-relation 9717. Up to 2475 conditions per place. 
[2024-06-14 14:52:45,674 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 63 selfloop transitions, 11 changer transitions 0/81 dead transitions.
[2024-06-14 14:52:45,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 81 transitions, 591 flow
[2024-06-14 14:52:45,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:52:45,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:52:45,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-14 14:52:45,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:52:45,678 INFO  L175             Difference]: Start difference. First operand has 64 places, 66 transitions, 405 flow. Second operand 6 states and 108 transitions.
[2024-06-14 14:52:45,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 81 transitions, 591 flow
[2024-06-14 14:52:45,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 549 flow, removed 17 selfloop flow, removed 2 redundant places.
[2024-06-14 14:52:45,687 INFO  L231             Difference]: Finished difference. Result has 68 places, 66 transitions, 393 flow
[2024-06-14 14:52:45,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=393, PETRI_PLACES=68, PETRI_TRANSITIONS=66}
[2024-06-14 14:52:45,689 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-14 14:52:45,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 393 flow
[2024-06-14 14:52:45,689 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:45,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:45,690 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:45,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 14:52:45,690 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:45,690 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:45,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 1824663275, now seen corresponding path program 1 times
[2024-06-14 14:52:45,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:45,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817597713]
[2024-06-14 14:52:45,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:45,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:45,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:52:56,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:52:56,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:52:56,672 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817597713]
[2024-06-14 14:52:56,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817597713] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:52:56,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:52:56,677 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:52:56,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530043842]
[2024-06-14 14:52:56,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:52:56,678 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:52:56,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:52:56,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:52:56,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:52:56,776 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:52:56,776 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 393 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:56,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:52:56,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:52:56,777 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:52:58,110 INFO  L124   PetriNetUnfolderBase]: 1706/2625 cut-off events.
[2024-06-14 14:52:58,111 INFO  L125   PetriNetUnfolderBase]: For 11692/11706 co-relation queries the response was YES.
[2024-06-14 14:52:58,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9939 conditions, 2625 events. 1706/2625 cut-off events. For 11692/11706 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12478 event pairs, 647 based on Foata normal form. 2/2612 useless extension candidates. Maximal degree in co-relation 9909. Up to 2473 conditions per place. 
[2024-06-14 14:52:58,121 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 73 selfloop transitions, 14 changer transitions 0/94 dead transitions.
[2024-06-14 14:52:58,121 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 659 flow
[2024-06-14 14:52:58,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:52:58,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:52:58,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-14 14:52:58,126 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-14 14:52:58,126 INFO  L175             Difference]: Start difference. First operand has 68 places, 66 transitions, 393 flow. Second operand 7 states and 130 transitions.
[2024-06-14 14:52:58,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 659 flow
[2024-06-14 14:52:58,133 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 625 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-14 14:52:58,135 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 429 flow
[2024-06-14 14:52:58,135 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-14 14:52:58,136 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places.
[2024-06-14 14:52:58,136 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 429 flow
[2024-06-14 14:52:58,136 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:52:58,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:52:58,136 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:52:58,137 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 14:52:58,137 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:52:58,137 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:52:58,137 INFO  L85        PathProgramCache]: Analyzing trace with hash 1824783431, now seen corresponding path program 1 times
[2024-06-14 14:52:58,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:52:58,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574165279]
[2024-06-14 14:52:58,138 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:52:58,138 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:52:58,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:08,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:08,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:08,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574165279]
[2024-06-14 14:53:08,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574165279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:08,790 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:08,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:08,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760221384]
[2024-06-14 14:53:08,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:08,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:08,791 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:08,791 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:08,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:08,950 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:53:08,951 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 429 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:08,951 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:08,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:53:08,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:10,299 INFO  L124   PetriNetUnfolderBase]: 1984/2941 cut-off events.
[2024-06-14 14:53:10,300 INFO  L125   PetriNetUnfolderBase]: For 16941/16941 co-relation queries the response was YES.
[2024-06-14 14:53:10,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11927 conditions, 2941 events. 1984/2941 cut-off events. For 16941/16941 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13293 event pairs, 682 based on Foata normal form. 6/2947 useless extension candidates. Maximal degree in co-relation 11897. Up to 2747 conditions per place. 
[2024-06-14 14:53:10,331 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 87 selfloop transitions, 28 changer transitions 0/118 dead transitions.
[2024-06-14 14:53:10,332 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 118 transitions, 937 flow
[2024-06-14 14:53:10,332 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:10,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:10,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 14:53:10,333 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-14 14:53:10,333 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 429 flow. Second operand 7 states and 137 transitions.
[2024-06-14 14:53:10,333 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 118 transitions, 937 flow
[2024-06-14 14:53:10,340 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 118 transitions, 891 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 14:53:10,341 INFO  L231             Difference]: Finished difference. Result has 74 places, 86 transitions, 604 flow
[2024-06-14 14:53:10,342 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=604, PETRI_PLACES=74, PETRI_TRANSITIONS=86}
[2024-06-14 14:53:10,342 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 31 predicate places.
[2024-06-14 14:53:10,342 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 86 transitions, 604 flow
[2024-06-14 14:53:10,342 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:10,342 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:10,343 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:10,343 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 14:53:10,343 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:10,343 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:10,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -1445364259, now seen corresponding path program 2 times
[2024-06-14 14:53:10,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:10,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297991596]
[2024-06-14 14:53:10,344 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:10,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:10,381 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:20,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:20,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:20,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297991596]
[2024-06-14 14:53:20,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297991596] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:20,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:20,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:20,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984032811]
[2024-06-14 14:53:20,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:20,524 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:20,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:20,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:20,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:20,806 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:20,807 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 86 transitions, 604 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:20,807 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:20,807 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:20,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:22,458 INFO  L124   PetriNetUnfolderBase]: 1831/2791 cut-off events.
[2024-06-14 14:53:22,458 INFO  L125   PetriNetUnfolderBase]: For 19489/19521 co-relation queries the response was YES.
[2024-06-14 14:53:22,467 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12434 conditions, 2791 events. 1831/2791 cut-off events. For 19489/19521 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 13144 event pairs, 623 based on Foata normal form. 6/2772 useless extension candidates. Maximal degree in co-relation 12400. Up to 2576 conditions per place. 
[2024-06-14 14:53:22,480 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 78 selfloop transitions, 26 changer transitions 0/116 dead transitions.
[2024-06-14 14:53:22,480 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 116 transitions, 988 flow
[2024-06-14 14:53:22,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:22,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:22,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-14 14:53:22,482 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 14:53:22,482 INFO  L175             Difference]: Start difference. First operand has 74 places, 86 transitions, 604 flow. Second operand 7 states and 133 transitions.
[2024-06-14 14:53:22,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 116 transitions, 988 flow
[2024-06-14 14:53:22,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 116 transitions, 952 flow, removed 17 selfloop flow, removed 1 redundant places.
[2024-06-14 14:53:22,505 INFO  L231             Difference]: Finished difference. Result has 80 places, 92 transitions, 710 flow
[2024-06-14 14:53:22,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=710, PETRI_PLACES=80, PETRI_TRANSITIONS=92}
[2024-06-14 14:53:22,505 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 37 predicate places.
[2024-06-14 14:53:22,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 92 transitions, 710 flow
[2024-06-14 14:53:22,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:22,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:22,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:22,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 14:53:22,506 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-14 14:53:22,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:22,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1398084339, now seen corresponding path program 2 times
[2024-06-14 14:53:22,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:22,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593330087]
[2024-06-14 14:53:22,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:22,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:22,569 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:31,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:31,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:31,584 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593330087]
[2024-06-14 14:53:31,584 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593330087] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:31,584 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:31,584 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:31,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853083784]
[2024-06-14 14:53:31,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:31,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:31,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:31,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:31,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:31,747 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:53:31,747 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 92 transitions, 710 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:31,747 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:31,748 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:53:31,748 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:33,240 INFO  L124   PetriNetUnfolderBase]: 2031/3007 cut-off events.
[2024-06-14 14:53:33,240 INFO  L125   PetriNetUnfolderBase]: For 26534/26534 co-relation queries the response was YES.
[2024-06-14 14:53:33,248 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14278 conditions, 3007 events. 2031/3007 cut-off events. For 26534/26534 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13571 event pairs, 702 based on Foata normal form. 6/3013 useless extension candidates. Maximal degree in co-relation 14241. Up to 2931 conditions per place. 
[2024-06-14 14:53:33,260 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 96 selfloop transitions, 21 changer transitions 0/120 dead transitions.
[2024-06-14 14:53:33,260 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 120 transitions, 1094 flow
[2024-06-14 14:53:33,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:33,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:33,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-14 14:53:33,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:53:33,262 INFO  L175             Difference]: Start difference. First operand has 80 places, 92 transitions, 710 flow. Second operand 7 states and 126 transitions.
[2024-06-14 14:53:33,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 120 transitions, 1094 flow
[2024-06-14 14:53:33,282 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 120 transitions, 1042 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-06-14 14:53:33,284 INFO  L231             Difference]: Finished difference. Result has 85 places, 98 transitions, 775 flow
[2024-06-14 14:53:33,285 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=775, PETRI_PLACES=85, PETRI_TRANSITIONS=98}
[2024-06-14 14:53:33,285 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-14 14:53:33,285 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 775 flow
[2024-06-14 14:53:33,286 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:33,286 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:33,286 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:33,286 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 14:53:33,286 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:33,286 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:33,287 INFO  L85        PathProgramCache]: Analyzing trace with hash 2001914951, now seen corresponding path program 3 times
[2024-06-14 14:53:33,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:33,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677840644]
[2024-06-14 14:53:33,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:33,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:33,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:42,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:42,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:42,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677840644]
[2024-06-14 14:53:42,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677840644] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:42,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:42,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:42,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841400662]
[2024-06-14 14:53:42,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:42,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:42,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:42,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:42,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:42,192 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:53:42,193 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 775 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:42,193 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:42,193 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:53:42,193 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:43,583 INFO  L124   PetriNetUnfolderBase]: 2035/3013 cut-off events.
[2024-06-14 14:53:43,583 INFO  L125   PetriNetUnfolderBase]: For 29761/29761 co-relation queries the response was YES.
[2024-06-14 14:53:43,590 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14738 conditions, 3013 events. 2035/3013 cut-off events. For 29761/29761 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13651 event pairs, 702 based on Foata normal form. 6/3019 useless extension candidates. Maximal degree in co-relation 14698. Up to 2877 conditions per place. 
[2024-06-14 14:53:43,599 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 99 selfloop transitions, 27 changer transitions 0/129 dead transitions.
[2024-06-14 14:53:43,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 129 transitions, 1238 flow
[2024-06-14 14:53:43,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:43,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:43,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-14 14:53:43,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4387755102040816
[2024-06-14 14:53:43,601 INFO  L175             Difference]: Start difference. First operand has 85 places, 98 transitions, 775 flow. Second operand 7 states and 129 transitions.
[2024-06-14 14:53:43,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 129 transitions, 1238 flow
[2024-06-14 14:53:43,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 1183 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 14:53:43,618 INFO  L231             Difference]: Finished difference. Result has 89 places, 105 transitions, 882 flow
[2024-06-14 14:53:43,618 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=882, PETRI_PLACES=89, PETRI_TRANSITIONS=105}
[2024-06-14 14:53:43,618 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 46 predicate places.
[2024-06-14 14:53:43,619 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 105 transitions, 882 flow
[2024-06-14 14:53:43,619 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:43,619 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:43,619 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:43,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 14:53:43,619 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:43,620 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:43,620 INFO  L85        PathProgramCache]: Analyzing trace with hash -1438935169, now seen corresponding path program 3 times
[2024-06-14 14:53:43,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:43,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11867367]
[2024-06-14 14:53:43,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:43,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:43,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:53:53,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:53:53,435 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:53:53,435 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11867367]
[2024-06-14 14:53:53,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11867367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:53:53,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:53:53,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 14:53:53,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372102345]
[2024-06-14 14:53:53,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:53:53,435 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 14:53:53,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:53:53,436 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 14:53:53,436 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 14:53:53,647 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:53:53,648 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 105 transitions, 882 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:53,648 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:53:53,648 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:53:53,648 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:53:54,837 INFO  L124   PetriNetUnfolderBase]: 1860/2835 cut-off events.
[2024-06-14 14:53:54,837 INFO  L125   PetriNetUnfolderBase]: For 30160/30180 co-relation queries the response was YES.
[2024-06-14 14:53:54,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14108 conditions, 2835 events. 1860/2835 cut-off events. For 30160/30180 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13371 event pairs, 613 based on Foata normal form. 2/2815 useless extension candidates. Maximal degree in co-relation 14067. Up to 2672 conditions per place. 
[2024-06-14 14:53:54,854 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 95 selfloop transitions, 14 changer transitions 0/124 dead transitions.
[2024-06-14 14:53:54,854 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 124 transitions, 1148 flow
[2024-06-14 14:53:54,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:53:54,855 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:53:54,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-14 14:53:54,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-14 14:53:54,855 INFO  L175             Difference]: Start difference. First operand has 89 places, 105 transitions, 882 flow. Second operand 7 states and 124 transitions.
[2024-06-14 14:53:54,856 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 124 transitions, 1148 flow
[2024-06-14 14:53:54,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 124 transitions, 1077 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-06-14 14:53:54,876 INFO  L231             Difference]: Finished difference. Result has 93 places, 105 transitions, 847 flow
[2024-06-14 14:53:54,876 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=93, PETRI_TRANSITIONS=105}
[2024-06-14 14:53:54,877 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 50 predicate places.
[2024-06-14 14:53:54,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 105 transitions, 847 flow
[2024-06-14 14:53:54,877 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:53:54,877 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:53:54,877 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:53:54,877 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 14:53:54,877 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:53:54,878 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:53:54,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -1438688905, now seen corresponding path program 1 times
[2024-06-14 14:53:54,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:53:54,878 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568622802]
[2024-06-14 14:53:54,878 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:53:54,878 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:53:54,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:08,683 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:08,683 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:08,683 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568622802]
[2024-06-14 14:54:08,684 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568622802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:08,684 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:08,684 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:08,684 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067335058]
[2024-06-14 14:54:08,684 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:08,684 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:08,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:08,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:08,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:08,901 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:54:08,902 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 105 transitions, 847 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:08,902 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:08,902 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:54:08,902 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:10,420 INFO  L124   PetriNetUnfolderBase]: 2033/3011 cut-off events.
[2024-06-14 14:54:10,421 INFO  L125   PetriNetUnfolderBase]: For 36830/36830 co-relation queries the response was YES.
[2024-06-14 14:54:10,430 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15416 conditions, 3011 events. 2033/3011 cut-off events. For 36830/36830 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13600 event pairs, 679 based on Foata normal form. 6/3017 useless extension candidates. Maximal degree in co-relation 15373. Up to 2915 conditions per place. 
[2024-06-14 14:54:10,441 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 102 selfloop transitions, 25 changer transitions 0/130 dead transitions.
[2024-06-14 14:54:10,442 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 130 transitions, 1251 flow
[2024-06-14 14:54:10,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:54:10,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:54:10,456 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 14:54:10,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-14 14:54:10,466 INFO  L175             Difference]: Start difference. First operand has 93 places, 105 transitions, 847 flow. Second operand 7 states and 127 transitions.
[2024-06-14 14:54:10,466 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 130 transitions, 1251 flow
[2024-06-14 14:54:10,489 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 130 transitions, 1207 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-14 14:54:10,491 INFO  L231             Difference]: Finished difference. Result has 94 places, 108 transitions, 907 flow
[2024-06-14 14:54:10,491 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=907, PETRI_PLACES=94, PETRI_TRANSITIONS=108}
[2024-06-14 14:54:10,492 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-14 14:54:10,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 907 flow
[2024-06-14 14:54:10,492 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:10,492 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:10,492 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:10,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 14:54:10,493 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:10,493 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:10,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 811864944, now seen corresponding path program 1 times
[2024-06-14 14:54:10,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:10,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501808057]
[2024-06-14 14:54:10,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:10,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:10,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:24,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-14 14:54:24,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:24,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501808057]
[2024-06-14 14:54:24,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501808057] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:24,470 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:24,470 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 14:54:24,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195126592]
[2024-06-14 14:54:24,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:24,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 14:54:24,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:24,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 14:54:24,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 14:54:24,562 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:54:24,563 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 907 flow. Second operand  has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:24,563 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:24,563 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:54:24,563 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:26,343 INFO  L124   PetriNetUnfolderBase]: 1904/2881 cut-off events.
[2024-06-14 14:54:26,344 INFO  L125   PetriNetUnfolderBase]: For 40030/40030 co-relation queries the response was YES.
[2024-06-14 14:54:26,356 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15333 conditions, 2881 events. 1904/2881 cut-off events. For 40030/40030 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13420 event pairs, 703 based on Foata normal form. 1/2882 useless extension candidates. Maximal degree in co-relation 15289. Up to 2769 conditions per place. 
[2024-06-14 14:54:26,369 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 95 selfloop transitions, 8 changer transitions 0/116 dead transitions.
[2024-06-14 14:54:26,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 1133 flow
[2024-06-14 14:54:26,370 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 14:54:26,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 14:54:26,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions.
[2024-06-14 14:54:26,371 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-14 14:54:26,371 INFO  L175             Difference]: Start difference. First operand has 94 places, 108 transitions, 907 flow. Second operand 5 states and 88 transitions.
[2024-06-14 14:54:26,371 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 1133 flow
[2024-06-14 14:54:26,400 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 116 transitions, 1045 flow, removed 21 selfloop flow, removed 5 redundant places.
[2024-06-14 14:54:26,403 INFO  L231             Difference]: Finished difference. Result has 94 places, 108 transitions, 841 flow
[2024-06-14 14:54:26,403 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=841, PETRI_PLACES=94, PETRI_TRANSITIONS=108}
[2024-06-14 14:54:26,403 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-14 14:54:26,404 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 841 flow
[2024-06-14 14:54:26,404 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:26,404 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:26,404 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:26,404 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 14:54:26,405 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:26,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:26,405 INFO  L85        PathProgramCache]: Analyzing trace with hash 729898036, now seen corresponding path program 1 times
[2024-06-14 14:54:26,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:26,405 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457338083]
[2024-06-14 14:54:26,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:26,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:26,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:37,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:37,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:37,730 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457338083]
[2024-06-14 14:54:37,730 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457338083] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:37,730 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:37,730 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:37,730 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407367340]
[2024-06-14 14:54:37,730 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:37,730 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:37,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:37,731 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:37,731 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:37,962 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:54:37,962 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 841 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:37,962 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:37,962 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:54:37,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:39,336 INFO  L124   PetriNetUnfolderBase]: 1904/2893 cut-off events.
[2024-06-14 14:54:39,336 INFO  L125   PetriNetUnfolderBase]: For 43494/43508 co-relation queries the response was YES.
[2024-06-14 14:54:39,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15483 conditions, 2893 events. 1904/2893 cut-off events. For 43494/43508 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13583 event pairs, 619 based on Foata normal form. 6/2888 useless extension candidates. Maximal degree in co-relation 15438. Up to 2675 conditions per place. 
[2024-06-14 14:54:39,355 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 113 selfloop transitions, 23 changer transitions 0/152 dead transitions.
[2024-06-14 14:54:39,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 152 transitions, 1367 flow
[2024-06-14 14:54:39,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:54:39,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:54:39,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-14 14:54:39,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 14:54:39,359 INFO  L175             Difference]: Start difference. First operand has 94 places, 108 transitions, 841 flow. Second operand 9 states and 168 transitions.
[2024-06-14 14:54:39,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 152 transitions, 1367 flow
[2024-06-14 14:54:39,379 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 152 transitions, 1345 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 14:54:39,381 INFO  L231             Difference]: Finished difference. Result has 99 places, 114 transitions, 975 flow
[2024-06-14 14:54:39,381 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=975, PETRI_PLACES=99, PETRI_TRANSITIONS=114}
[2024-06-14 14:54:39,381 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 56 predicate places.
[2024-06-14 14:54:39,381 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 114 transitions, 975 flow
[2024-06-14 14:54:39,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:39,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:39,382 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:39,382 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 14:54:39,382 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:39,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:39,383 INFO  L85        PathProgramCache]: Analyzing trace with hash 729988401, now seen corresponding path program 1 times
[2024-06-14 14:54:39,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:39,383 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191791046]
[2024-06-14 14:54:39,383 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:39,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:39,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:54:49,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:54:49,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:54:49,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191791046]
[2024-06-14 14:54:49,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191791046] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:54:49,195 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:54:49,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:54:49,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608101641]
[2024-06-14 14:54:49,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:54:49,195 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:54:49,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:54:49,196 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:54:49,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:54:49,390 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:54:49,391 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 114 transitions, 975 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:49,391 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:54:49,391 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:54:49,391 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:54:50,870 INFO  L124   PetriNetUnfolderBase]: 2117/3131 cut-off events.
[2024-06-14 14:54:50,870 INFO  L125   PetriNetUnfolderBase]: For 51364/51364 co-relation queries the response was YES.
[2024-06-14 14:54:50,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17421 conditions, 3131 events. 2117/3131 cut-off events. For 51364/51364 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14169 event pairs, 670 based on Foata normal form. 6/3137 useless extension candidates. Maximal degree in co-relation 17376. Up to 3019 conditions per place. 
[2024-06-14 14:54:50,890 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 129 selfloop transitions, 27 changer transitions 0/159 dead transitions.
[2024-06-14 14:54:50,890 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 159 transitions, 1599 flow
[2024-06-14 14:54:50,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:54:50,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:54:50,893 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 14:54:50,893 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44642857142857145
[2024-06-14 14:54:50,893 INFO  L175             Difference]: Start difference. First operand has 99 places, 114 transitions, 975 flow. Second operand 8 states and 150 transitions.
[2024-06-14 14:54:50,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 159 transitions, 1599 flow
[2024-06-14 14:54:50,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 159 transitions, 1525 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-06-14 14:54:50,924 INFO  L231             Difference]: Finished difference. Result has 104 places, 125 transitions, 1115 flow
[2024-06-14 14:54:50,924 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1115, PETRI_PLACES=104, PETRI_TRANSITIONS=125}
[2024-06-14 14:54:50,925 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places.
[2024-06-14 14:54:50,925 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 125 transitions, 1115 flow
[2024-06-14 14:54:50,925 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:54:50,925 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:54:50,925 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:54:50,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 14:54:50,925 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:54:50,926 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:54:50,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 729988246, now seen corresponding path program 2 times
[2024-06-14 14:54:50,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:54:50,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613123487]
[2024-06-14 14:54:50,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:54:50,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:54:50,982 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:02,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:02,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:02,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613123487]
[2024-06-14 14:55:02,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613123487] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:02,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:02,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:55:02,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117867646]
[2024-06-14 14:55:02,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:02,895 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:55:02,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:02,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:55:02,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:55:03,094 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:03,094 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 125 transitions, 1115 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:03,095 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:03,095 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:03,095 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:04,499 INFO  L124   PetriNetUnfolderBase]: 1985/2997 cut-off events.
[2024-06-14 14:55:04,500 INFO  L125   PetriNetUnfolderBase]: For 57349/57363 co-relation queries the response was YES.
[2024-06-14 14:55:04,511 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17634 conditions, 2997 events. 1985/2997 cut-off events. For 57349/57363 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14039 event pairs, 619 based on Foata normal form. 6/2992 useless extension candidates. Maximal degree in co-relation 17585. Up to 2793 conditions per place. 
[2024-06-14 14:55:04,522 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 118 selfloop transitions, 17 changer transitions 0/154 dead transitions.
[2024-06-14 14:55:04,522 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 154 transitions, 1459 flow
[2024-06-14 14:55:04,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:55:04,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:55:04,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-14 14:55:04,526 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-14 14:55:04,526 INFO  L175             Difference]: Start difference. First operand has 104 places, 125 transitions, 1115 flow. Second operand 8 states and 146 transitions.
[2024-06-14 14:55:04,526 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 154 transitions, 1459 flow
[2024-06-14 14:55:04,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 154 transitions, 1317 flow, removed 48 selfloop flow, removed 4 redundant places.
[2024-06-14 14:55:04,562 INFO  L231             Difference]: Finished difference. Result has 108 places, 125 transitions, 1015 flow
[2024-06-14 14:55:04,562 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1015, PETRI_PLACES=108, PETRI_TRANSITIONS=125}
[2024-06-14 14:55:04,562 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 65 predicate places.
[2024-06-14 14:55:04,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 125 transitions, 1015 flow
[2024-06-14 14:55:04,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:04,563 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:04,563 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:04,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 14:55:04,563 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:04,563 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:04,564 INFO  L85        PathProgramCache]: Analyzing trace with hash 733713051, now seen corresponding path program 2 times
[2024-06-14 14:55:04,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:04,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493286356]
[2024-06-14 14:55:04,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:04,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:04,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:14,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:14,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:14,302 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493286356]
[2024-06-14 14:55:14,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493286356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:14,302 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:14,302 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:55:14,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915293829]
[2024-06-14 14:55:14,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:14,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:55:14,307 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:14,307 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:55:14,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:55:14,472 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:55:14,473 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 125 transitions, 1015 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:14,473 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:14,473 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:55:14,473 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:16,257 INFO  L124   PetriNetUnfolderBase]: 2244/3313 cut-off events.
[2024-06-14 14:55:16,258 INFO  L125   PetriNetUnfolderBase]: For 66463/66465 co-relation queries the response was YES.
[2024-06-14 14:55:16,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19602 conditions, 3313 events. 2244/3313 cut-off events. For 66463/66465 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15156 event pairs, 653 based on Foata normal form. 8/3321 useless extension candidates. Maximal degree in co-relation 19552. Up to 2827 conditions per place. 
[2024-06-14 14:55:16,289 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 113 selfloop transitions, 62 changer transitions 0/178 dead transitions.
[2024-06-14 14:55:16,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 178 transitions, 1931 flow
[2024-06-14 14:55:16,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:55:16,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:55:16,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 14:55:16,293 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4732142857142857
[2024-06-14 14:55:16,294 INFO  L175             Difference]: Start difference. First operand has 108 places, 125 transitions, 1015 flow. Second operand 8 states and 159 transitions.
[2024-06-14 14:55:16,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 178 transitions, 1931 flow
[2024-06-14 14:55:16,351 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 178 transitions, 1889 flow, removed 2 selfloop flow, removed 7 redundant places.
[2024-06-14 14:55:16,365 INFO  L231             Difference]: Finished difference. Result has 111 places, 140 transitions, 1356 flow
[2024-06-14 14:55:16,365 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1356, PETRI_PLACES=111, PETRI_TRANSITIONS=140}
[2024-06-14 14:55:16,366 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-14 14:55:16,366 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 140 transitions, 1356 flow
[2024-06-14 14:55:16,366 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:16,366 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:16,367 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:16,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 14:55:16,367 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-14 14:55:16,369 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:16,369 INFO  L85        PathProgramCache]: Analyzing trace with hash 733707471, now seen corresponding path program 3 times
[2024-06-14 14:55:16,369 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:16,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709642818]
[2024-06-14 14:55:16,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:16,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:16,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:26,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:26,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:26,828 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709642818]
[2024-06-14 14:55:26,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709642818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:26,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:26,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:55:26,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936249829]
[2024-06-14 14:55:26,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:26,829 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:55:26,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:26,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:55:26,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:55:27,101 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:55:27,101 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 140 transitions, 1356 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:27,101 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:27,101 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:55:27,102 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:28,731 INFO  L124   PetriNetUnfolderBase]: 2232/3297 cut-off events.
[2024-06-14 14:55:28,731 INFO  L125   PetriNetUnfolderBase]: For 75121/75123 co-relation queries the response was YES.
[2024-06-14 14:55:28,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20813 conditions, 3297 events. 2232/3297 cut-off events. For 75121/75123 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15060 event pairs, 657 based on Foata normal form. 8/3305 useless extension candidates. Maximal degree in co-relation 20760. Up to 2821 conditions per place. 
[2024-06-14 14:55:28,754 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 117 selfloop transitions, 57 changer transitions 0/177 dead transitions.
[2024-06-14 14:55:28,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 177 transitions, 2052 flow
[2024-06-14 14:55:28,754 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:55:28,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:55:28,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions.
[2024-06-14 14:55:28,755 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47023809523809523
[2024-06-14 14:55:28,755 INFO  L175             Difference]: Start difference. First operand has 111 places, 140 transitions, 1356 flow. Second operand 8 states and 158 transitions.
[2024-06-14 14:55:28,755 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 177 transitions, 2052 flow
[2024-06-14 14:55:28,816 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 177 transitions, 1923 flow, removed 58 selfloop flow, removed 2 redundant places.
[2024-06-14 14:55:28,819 INFO  L231             Difference]: Finished difference. Result has 117 places, 140 transitions, 1355 flow
[2024-06-14 14:55:28,819 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1355, PETRI_PLACES=117, PETRI_TRANSITIONS=140}
[2024-06-14 14:55:28,819 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places.
[2024-06-14 14:55:28,819 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 140 transitions, 1355 flow
[2024-06-14 14:55:28,820 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:28,820 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:28,820 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:28,820 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 14:55:28,820 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:28,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:28,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 733707316, now seen corresponding path program 3 times
[2024-06-14 14:55:28,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:28,821 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925024357]
[2024-06-14 14:55:28,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:28,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:28,870 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:40,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:40,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:40,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925024357]
[2024-06-14 14:55:40,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925024357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:40,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:40,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:55:40,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504699849]
[2024-06-14 14:55:40,334 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:40,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:55:40,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:40,334 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:55:40,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:55:40,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:40,475 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 140 transitions, 1355 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:40,475 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:40,475 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:40,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:41,995 INFO  L124   PetriNetUnfolderBase]: 2113/3182 cut-off events.
[2024-06-14 14:55:41,996 INFO  L125   PetriNetUnfolderBase]: For 75481/75501 co-relation queries the response was YES.
[2024-06-14 14:55:42,005 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19898 conditions, 3182 events. 2113/3182 cut-off events. For 75481/75501 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14970 event pairs, 635 based on Foata normal form. 12/3183 useless extension candidates. Maximal degree in co-relation 19843. Up to 2911 conditions per place. 
[2024-06-14 14:55:42,015 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 117 selfloop transitions, 29 changer transitions 0/169 dead transitions.
[2024-06-14 14:55:42,015 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 169 transitions, 1773 flow
[2024-06-14 14:55:42,017 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:55:42,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:55:42,017 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 14:55:42,018 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-14 14:55:42,018 INFO  L175             Difference]: Start difference. First operand has 117 places, 140 transitions, 1355 flow. Second operand 8 states and 147 transitions.
[2024-06-14 14:55:42,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 169 transitions, 1773 flow
[2024-06-14 14:55:42,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 169 transitions, 1610 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-14 14:55:42,059 INFO  L231             Difference]: Finished difference. Result has 117 places, 143 transitions, 1324 flow
[2024-06-14 14:55:42,059 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1324, PETRI_PLACES=117, PETRI_TRANSITIONS=143}
[2024-06-14 14:55:42,059 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 74 predicate places.
[2024-06-14 14:55:42,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 143 transitions, 1324 flow
[2024-06-14 14:55:42,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:42,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:42,061 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:42,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 14:55:42,061 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:42,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:42,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 55676182, now seen corresponding path program 4 times
[2024-06-14 14:55:42,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:42,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210957259]
[2024-06-14 14:55:42,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:42,062 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:42,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:55:52,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:55:52,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:55:52,566 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210957259]
[2024-06-14 14:55:52,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210957259] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:55:52,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:55:52,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:55:52,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393075718]
[2024-06-14 14:55:52,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:55:52,566 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:55:52,566 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:55:52,567 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:55:52,567 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:55:52,701 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:55:52,702 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 143 transitions, 1324 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:52,702 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:55:52,702 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:55:52,702 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:55:54,106 INFO  L124   PetriNetUnfolderBase]: 2108/3174 cut-off events.
[2024-06-14 14:55:54,106 INFO  L125   PetriNetUnfolderBase]: For 80753/80769 co-relation queries the response was YES.
[2024-06-14 14:55:54,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19997 conditions, 3174 events. 2108/3174 cut-off events. For 80753/80769 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14940 event pairs, 636 based on Foata normal form. 6/3169 useless extension candidates. Maximal degree in co-relation 19943. Up to 2961 conditions per place. 
[2024-06-14 14:55:54,128 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 129 selfloop transitions, 17 changer transitions 0/169 dead transitions.
[2024-06-14 14:55:54,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 169 transitions, 1740 flow
[2024-06-14 14:55:54,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:55:54,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:55:54,131 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-14 14:55:54,131 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-14 14:55:54,131 INFO  L175             Difference]: Start difference. First operand has 117 places, 143 transitions, 1324 flow. Second operand 8 states and 140 transitions.
[2024-06-14 14:55:54,131 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 169 transitions, 1740 flow
[2024-06-14 14:55:54,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 169 transitions, 1632 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-14 14:55:54,200 INFO  L231             Difference]: Finished difference. Result has 119 places, 146 transitions, 1330 flow
[2024-06-14 14:55:54,214 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1330, PETRI_PLACES=119, PETRI_TRANSITIONS=146}
[2024-06-14 14:55:54,215 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places.
[2024-06-14 14:55:54,215 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 146 transitions, 1330 flow
[2024-06-14 14:55:54,215 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:55:54,215 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:55:54,215 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:55:54,215 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 14:55:54,215 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:55:54,216 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:55:54,216 INFO  L85        PathProgramCache]: Analyzing trace with hash 1937441652, now seen corresponding path program 1 times
[2024-06-14 14:55:54,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:55:54,216 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034350645]
[2024-06-14 14:55:54,216 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:55:54,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:55:54,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:04,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:04,044 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:04,044 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034350645]
[2024-06-14 14:56:04,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034350645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:04,044 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:04,044 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:04,044 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929066510]
[2024-06-14 14:56:04,044 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:04,045 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:04,045 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:04,045 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:04,045 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:04,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:04,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 146 transitions, 1330 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:04,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:04,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:04,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:05,786 INFO  L124   PetriNetUnfolderBase]: 2240/3307 cut-off events.
[2024-06-14 14:56:05,786 INFO  L125   PetriNetUnfolderBase]: For 89332/89332 co-relation queries the response was YES.
[2024-06-14 14:56:05,797 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21240 conditions, 3307 events. 2240/3307 cut-off events. For 89332/89332 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15158 event pairs, 672 based on Foata normal form. 3/3310 useless extension candidates. Maximal degree in co-relation 21185. Up to 3200 conditions per place. 
[2024-06-14 14:56:05,810 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 138 selfloop transitions, 30 changer transitions 0/171 dead transitions.
[2024-06-14 14:56:05,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 171 transitions, 1830 flow
[2024-06-14 14:56:05,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 14:56:05,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 14:56:05,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-14 14:56:05,812 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43197278911564624
[2024-06-14 14:56:05,812 INFO  L175             Difference]: Start difference. First operand has 119 places, 146 transitions, 1330 flow. Second operand 7 states and 127 transitions.
[2024-06-14 14:56:05,812 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 171 transitions, 1830 flow
[2024-06-14 14:56:05,869 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 171 transitions, 1740 flow, removed 30 selfloop flow, removed 6 redundant places.
[2024-06-14 14:56:05,871 INFO  L231             Difference]: Finished difference. Result has 120 places, 150 transitions, 1386 flow
[2024-06-14 14:56:05,871 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1240, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1386, PETRI_PLACES=120, PETRI_TRANSITIONS=150}
[2024-06-14 14:56:05,871 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places.
[2024-06-14 14:56:05,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 150 transitions, 1386 flow
[2024-06-14 14:56:05,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:05,872 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:05,872 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:05,872 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 14:56:05,872 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:05,873 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:05,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649958325, now seen corresponding path program 4 times
[2024-06-14 14:56:05,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:05,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256057296]
[2024-06-14 14:56:05,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:05,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:05,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:15,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:15,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:15,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256057296]
[2024-06-14 14:56:15,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256057296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:15,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:15,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:15,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267740686]
[2024-06-14 14:56:15,049 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:15,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:15,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:15,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:15,050 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:15,284 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:15,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 150 transitions, 1386 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:15,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:15,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:15,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:16,852 INFO  L124   PetriNetUnfolderBase]: 2276/3359 cut-off events.
[2024-06-14 14:56:16,853 INFO  L125   PetriNetUnfolderBase]: For 97029/97029 co-relation queries the response was YES.
[2024-06-14 14:56:16,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22263 conditions, 3359 events. 2276/3359 cut-off events. For 97029/97029 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 15372 event pairs, 675 based on Foata normal form. 6/3365 useless extension candidates. Maximal degree in co-relation 22207. Up to 3251 conditions per place. 
[2024-06-14 14:56:16,883 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 152 selfloop transitions, 25 changer transitions 0/180 dead transitions.
[2024-06-14 14:56:16,884 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 180 transitions, 1928 flow
[2024-06-14 14:56:16,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:56:16,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:56:16,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 14:56:16,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 14:56:16,885 INFO  L175             Difference]: Start difference. First operand has 120 places, 150 transitions, 1386 flow. Second operand 8 states and 142 transitions.
[2024-06-14 14:56:16,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 180 transitions, 1928 flow
[2024-06-14 14:56:16,970 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 180 transitions, 1834 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-14 14:56:16,973 INFO  L231             Difference]: Finished difference. Result has 123 places, 154 transitions, 1431 flow
[2024-06-14 14:56:16,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1431, PETRI_PLACES=123, PETRI_TRANSITIONS=154}
[2024-06-14 14:56:16,974 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 80 predicate places.
[2024-06-14 14:56:16,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 154 transitions, 1431 flow
[2024-06-14 14:56:16,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:16,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:16,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:16,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 14:56:16,975 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:16,977 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:16,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657315555, now seen corresponding path program 5 times
[2024-06-14 14:56:16,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:16,978 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263188666]
[2024-06-14 14:56:16,978 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:16,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:17,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:26,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:26,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:26,301 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263188666]
[2024-06-14 14:56:26,301 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263188666] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:26,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:26,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:26,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330180811]
[2024-06-14 14:56:26,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:26,302 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:26,302 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:26,302 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:26,302 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:26,492 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:26,492 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 154 transitions, 1431 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:26,492 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:26,492 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:26,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:27,991 INFO  L124   PetriNetUnfolderBase]: 2312/3411 cut-off events.
[2024-06-14 14:56:27,991 INFO  L125   PetriNetUnfolderBase]: For 105414/105414 co-relation queries the response was YES.
[2024-06-14 14:56:28,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22981 conditions, 3411 events. 2312/3411 cut-off events. For 105414/105414 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15654 event pairs, 668 based on Foata normal form. 6/3417 useless extension candidates. Maximal degree in co-relation 22924. Up to 3139 conditions per place. 
[2024-06-14 14:56:28,020 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 150 selfloop transitions, 37 changer transitions 0/190 dead transitions.
[2024-06-14 14:56:28,020 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 190 transitions, 2227 flow
[2024-06-14 14:56:28,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:56:28,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:56:28,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-14 14:56:28,026 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-14 14:56:28,026 INFO  L175             Difference]: Start difference. First operand has 123 places, 154 transitions, 1431 flow. Second operand 8 states and 148 transitions.
[2024-06-14 14:56:28,026 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 190 transitions, 2227 flow
[2024-06-14 14:56:28,087 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 190 transitions, 2124 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-06-14 14:56:28,090 INFO  L231             Difference]: Finished difference. Result has 126 places, 159 transitions, 1532 flow
[2024-06-14 14:56:28,090 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1532, PETRI_PLACES=126, PETRI_TRANSITIONS=159}
[2024-06-14 14:56:28,091 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-14 14:56:28,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 159 transitions, 1532 flow
[2024-06-14 14:56:28,091 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:28,091 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:28,091 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:28,091 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 14:56:28,092 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:28,108 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:28,108 INFO  L85        PathProgramCache]: Analyzing trace with hash 1929822875, now seen corresponding path program 6 times
[2024-06-14 14:56:28,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:28,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492096544]
[2024-06-14 14:56:28,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:28,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:28,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:37,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:37,515 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:37,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492096544]
[2024-06-14 14:56:37,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492096544] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:37,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:37,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 14:56:37,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365189852]
[2024-06-14 14:56:37,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:37,515 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 14:56:37,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:37,516 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 14:56:37,516 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 14:56:37,732 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:56:37,732 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 159 transitions, 1532 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:37,732 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:37,732 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:56:37,732 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:39,091 INFO  L124   PetriNetUnfolderBase]: 2316/3417 cut-off events.
[2024-06-14 14:56:39,091 INFO  L125   PetriNetUnfolderBase]: For 113058/113058 co-relation queries the response was YES.
[2024-06-14 14:56:39,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23442 conditions, 3417 events. 2316/3417 cut-off events. For 113058/113058 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15659 event pairs, 679 based on Foata normal form. 6/3423 useless extension candidates. Maximal degree in co-relation 23383. Up to 3148 conditions per place. 
[2024-06-14 14:56:39,115 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 147 selfloop transitions, 41 changer transitions 0/191 dead transitions.
[2024-06-14 14:56:39,115 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 191 transitions, 2177 flow
[2024-06-14 14:56:39,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:56:39,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:56:39,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-14 14:56:39,116 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-14 14:56:39,116 INFO  L175             Difference]: Start difference. First operand has 126 places, 159 transitions, 1532 flow. Second operand 8 states and 147 transitions.
[2024-06-14 14:56:39,116 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 191 transitions, 2177 flow
[2024-06-14 14:56:39,184 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 191 transitions, 1979 flow, removed 46 selfloop flow, removed 7 redundant places.
[2024-06-14 14:56:39,186 INFO  L231             Difference]: Finished difference. Result has 127 places, 163 transitions, 1518 flow
[2024-06-14 14:56:39,186 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1518, PETRI_PLACES=127, PETRI_TRANSITIONS=163}
[2024-06-14 14:56:39,187 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-14 14:56:39,187 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 163 transitions, 1518 flow
[2024-06-14 14:56:39,187 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:39,187 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:39,187 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:39,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 14:56:39,188 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:56:39,188 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:39,188 INFO  L85        PathProgramCache]: Analyzing trace with hash -601988692, now seen corresponding path program 1 times
[2024-06-14 14:56:39,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:39,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817073516]
[2024-06-14 14:56:39,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:39,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:39,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:56:54,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:56:54,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:56:54,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817073516]
[2024-06-14 14:56:54,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817073516] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:56:54,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:56:54,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:56:54,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156077250]
[2024-06-14 14:56:54,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:56:54,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:56:54,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:56:54,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:56:54,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:56:54,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:56:54,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 163 transitions, 1518 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:54,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:56:54,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:56:54,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:56:56,261 INFO  L124   PetriNetUnfolderBase]: 2154/3228 cut-off events.
[2024-06-14 14:56:56,262 INFO  L125   PetriNetUnfolderBase]: For 116240/116264 co-relation queries the response was YES.
[2024-06-14 14:56:56,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22406 conditions, 3228 events. 2154/3228 cut-off events. For 116240/116264 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 15074 event pairs, 661 based on Foata normal form. 3/3192 useless extension candidates. Maximal degree in co-relation 22347. Up to 3099 conditions per place. 
[2024-06-14 14:56:56,284 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 152 selfloop transitions, 11 changer transitions 0/177 dead transitions.
[2024-06-14 14:56:56,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 177 transitions, 1898 flow
[2024-06-14 14:56:56,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:56:56,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:56:56,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-14 14:56:56,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-14 14:56:56,286 INFO  L175             Difference]: Start difference. First operand has 127 places, 163 transitions, 1518 flow. Second operand 6 states and 103 transitions.
[2024-06-14 14:56:56,286 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 177 transitions, 1898 flow
[2024-06-14 14:56:56,337 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 177 transitions, 1782 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-06-14 14:56:56,340 INFO  L231             Difference]: Finished difference. Result has 128 places, 166 transitions, 1464 flow
[2024-06-14 14:56:56,340 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1464, PETRI_PLACES=128, PETRI_TRANSITIONS=166}
[2024-06-14 14:56:56,340 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-14 14:56:56,340 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 166 transitions, 1464 flow
[2024-06-14 14:56:56,341 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:56:56,341 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:56:56,341 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:56:56,341 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 14:56:56,341 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-14 14:56:56,342 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:56:56,342 INFO  L85        PathProgramCache]: Analyzing trace with hash 1151943786, now seen corresponding path program 1 times
[2024-06-14 14:56:56,342 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:56:56,342 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640004497]
[2024-06-14 14:56:56,342 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:56:56,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:56:56,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:07,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:07,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:07,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640004497]
[2024-06-14 14:57:07,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640004497] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:07,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:07,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:07,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467115520]
[2024-06-14 14:57:07,564 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:07,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:07,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:07,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:07,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:07,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:07,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 166 transitions, 1464 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:07,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:07,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:07,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:09,595 INFO  L124   PetriNetUnfolderBase]: 2209/3330 cut-off events.
[2024-06-14 14:57:09,596 INFO  L125   PetriNetUnfolderBase]: For 123851/123881 co-relation queries the response was YES.
[2024-06-14 14:57:09,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23275 conditions, 3330 events. 2209/3330 cut-off events. For 123851/123881 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15874 event pairs, 465 based on Foata normal form. 8/3327 useless extension candidates. Maximal degree in co-relation 23215. Up to 2981 conditions per place. 
[2024-06-14 14:57:09,622 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 159 selfloop transitions, 28 changer transitions 0/214 dead transitions.
[2024-06-14 14:57:09,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 214 transitions, 2200 flow
[2024-06-14 14:57:09,624 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:57:09,624 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:57:09,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions.
[2024-06-14 14:57:09,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44047619047619047
[2024-06-14 14:57:09,625 INFO  L175             Difference]: Start difference. First operand has 128 places, 166 transitions, 1464 flow. Second operand 10 states and 185 transitions.
[2024-06-14 14:57:09,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 214 transitions, 2200 flow
[2024-06-14 14:57:09,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 214 transitions, 2158 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-14 14:57:09,696 INFO  L231             Difference]: Finished difference. Result has 134 places, 170 transitions, 1633 flow
[2024-06-14 14:57:09,696 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1633, PETRI_PLACES=134, PETRI_TRANSITIONS=170}
[2024-06-14 14:57:09,698 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 91 predicate places.
[2024-06-14 14:57:09,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 170 transitions, 1633 flow
[2024-06-14 14:57:09,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:09,699 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:09,699 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:09,699 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 14:57:09,699 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-14 14:57:09,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:09,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1152004360, now seen corresponding path program 1 times
[2024-06-14 14:57:09,700 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:09,700 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933618948]
[2024-06-14 14:57:09,700 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:09,700 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:09,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:21,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:21,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:21,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933618948]
[2024-06-14 14:57:21,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933618948] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:21,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:21,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:21,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907723362]
[2024-06-14 14:57:21,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:21,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:21,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:21,594 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:21,594 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:21,839 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:57:21,840 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 170 transitions, 1633 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:21,840 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:21,840 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:57:21,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:23,724 INFO  L124   PetriNetUnfolderBase]: 2465/3635 cut-off events.
[2024-06-14 14:57:23,724 INFO  L125   PetriNetUnfolderBase]: For 141637/141637 co-relation queries the response was YES.
[2024-06-14 14:57:23,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26054 conditions, 3635 events. 2465/3635 cut-off events. For 141637/141637 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 16931 event pairs, 639 based on Foata normal form. 6/3641 useless extension candidates. Maximal degree in co-relation 25993. Up to 3370 conditions per place. 
[2024-06-14 14:57:23,752 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 190 selfloop transitions, 41 changer transitions 0/234 dead transitions.
[2024-06-14 14:57:23,752 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 234 transitions, 2835 flow
[2024-06-14 14:57:23,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:57:23,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:57:23,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-14 14:57:23,753 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-14 14:57:23,753 INFO  L175             Difference]: Start difference. First operand has 134 places, 170 transitions, 1633 flow. Second operand 10 states and 193 transitions.
[2024-06-14 14:57:23,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 234 transitions, 2835 flow
[2024-06-14 14:57:23,847 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 234 transitions, 2717 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-06-14 14:57:23,851 INFO  L231             Difference]: Finished difference. Result has 140 places, 182 transitions, 1830 flow
[2024-06-14 14:57:23,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1830, PETRI_PLACES=140, PETRI_TRANSITIONS=182}
[2024-06-14 14:57:23,852 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-14 14:57:23,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 182 transitions, 1830 flow
[2024-06-14 14:57:23,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:23,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:23,852 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:23,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 14:57:23,852 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:23,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:23,853 INFO  L85        PathProgramCache]: Analyzing trace with hash 1152004236, now seen corresponding path program 2 times
[2024-06-14 14:57:23,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:23,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699346351]
[2024-06-14 14:57:23,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:23,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:23,919 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:35,311 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:35,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:35,312 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699346351]
[2024-06-14 14:57:35,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699346351] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:35,312 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:35,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:35,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062067064]
[2024-06-14 14:57:35,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:35,314 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:35,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:35,318 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:35,318 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:35,655 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:57:35,656 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 182 transitions, 1830 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:35,656 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:35,656 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:57:35,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:37,506 INFO  L124   PetriNetUnfolderBase]: 2368/3547 cut-off events.
[2024-06-14 14:57:37,507 INFO  L125   PetriNetUnfolderBase]: For 151602/151632 co-relation queries the response was YES.
[2024-06-14 14:57:37,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26332 conditions, 3547 events. 2368/3547 cut-off events. For 151602/151632 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16989 event pairs, 595 based on Foata normal form. 8/3544 useless extension candidates. Maximal degree in co-relation 26267. Up to 3241 conditions per place. 
[2024-06-14 14:57:37,535 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 170 selfloop transitions, 25 changer transitions 0/225 dead transitions.
[2024-06-14 14:57:37,535 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 225 transitions, 2378 flow
[2024-06-14 14:57:37,537 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 14:57:37,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 14:57:37,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 182 transitions.
[2024-06-14 14:57:37,538 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43333333333333335
[2024-06-14 14:57:37,538 INFO  L175             Difference]: Start difference. First operand has 140 places, 182 transitions, 1830 flow. Second operand 10 states and 182 transitions.
[2024-06-14 14:57:37,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 225 transitions, 2378 flow
[2024-06-14 14:57:37,628 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 225 transitions, 2231 flow, removed 58 selfloop flow, removed 5 redundant places.
[2024-06-14 14:57:37,630 INFO  L231             Difference]: Finished difference. Result has 145 places, 184 transitions, 1798 flow
[2024-06-14 14:57:37,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1798, PETRI_PLACES=145, PETRI_TRANSITIONS=184}
[2024-06-14 14:57:37,631 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-14 14:57:37,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 184 transitions, 1798 flow
[2024-06-14 14:57:37,631 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:37,631 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:37,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:37,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 14:57:37,632 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:37,632 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:37,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 821112292, now seen corresponding path program 2 times
[2024-06-14 14:57:37,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:37,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78541942]
[2024-06-14 14:57:37,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:37,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:37,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:57:47,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:57:47,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:57:47,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78541942]
[2024-06-14 14:57:47,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78541942] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:57:47,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:57:47,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:57:47,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471833655]
[2024-06-14 14:57:47,152 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:57:47,152 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:57:47,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:57:47,153 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:57:47,153 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:57:47,315 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:57:47,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 184 transitions, 1798 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:47,316 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:57:47,316 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:57:47,316 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:57:49,349 INFO  L124   PetriNetUnfolderBase]: 2518/3714 cut-off events.
[2024-06-14 14:57:49,349 INFO  L125   PetriNetUnfolderBase]: For 163172/163172 co-relation queries the response was YES.
[2024-06-14 14:57:49,363 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27564 conditions, 3714 events. 2518/3714 cut-off events. For 163172/163172 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17392 event pairs, 641 based on Foata normal form. 6/3720 useless extension candidates. Maximal degree in co-relation 27497. Up to 3502 conditions per place. 
[2024-06-14 14:57:49,378 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 196 selfloop transitions, 34 changer transitions 0/233 dead transitions.
[2024-06-14 14:57:49,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 233 transitions, 2853 flow
[2024-06-14 14:57:49,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:57:49,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:57:49,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-14 14:57:49,380 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-14 14:57:49,380 INFO  L175             Difference]: Start difference. First operand has 145 places, 184 transitions, 1798 flow. Second operand 9 states and 170 transitions.
[2024-06-14 14:57:49,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 233 transitions, 2853 flow
[2024-06-14 14:57:49,513 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 233 transitions, 2760 flow, removed 23 selfloop flow, removed 8 redundant places.
[2024-06-14 14:57:49,517 INFO  L231             Difference]: Finished difference. Result has 147 places, 191 transitions, 1932 flow
[2024-06-14 14:57:49,517 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1705, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1932, PETRI_PLACES=147, PETRI_TRANSITIONS=191}
[2024-06-14 14:57:49,518 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-14 14:57:49,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 191 transitions, 1932 flow
[2024-06-14 14:57:49,518 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:57:49,518 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:57:49,518 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:57:49,519 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 14:57:49,519 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:57:49,519 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:57:49,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 821112168, now seen corresponding path program 3 times
[2024-06-14 14:57:49,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:57:49,519 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081432076]
[2024-06-14 14:57:49,519 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:57:49,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:57:49,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:01,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:01,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:01,527 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081432076]
[2024-06-14 14:58:01,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081432076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:01,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:01,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:01,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011940604]
[2024-06-14 14:58:01,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:01,527 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:01,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:01,528 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:01,528 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:01,785 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:58:01,786 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 191 transitions, 1932 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:01,786 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:01,786 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:58:01,786 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:03,462 INFO  L124   PetriNetUnfolderBase]: 2393/3584 cut-off events.
[2024-06-14 14:58:03,462 INFO  L125   PetriNetUnfolderBase]: For 167880/167910 co-relation queries the response was YES.
[2024-06-14 14:58:03,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27022 conditions, 3584 events. 2393/3584 cut-off events. For 167880/167910 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 17156 event pairs, 596 based on Foata normal form. 8/3581 useless extension candidates. Maximal degree in co-relation 26953. Up to 3299 conditions per place. 
[2024-06-14 14:58:03,497 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 174 selfloop transitions, 19 changer transitions 0/225 dead transitions.
[2024-06-14 14:58:03,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 225 transitions, 2404 flow
[2024-06-14 14:58:03,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:03,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:03,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions.
[2024-06-14 14:58:03,500 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 14:58:03,500 INFO  L175             Difference]: Start difference. First operand has 147 places, 191 transitions, 1932 flow. Second operand 9 states and 162 transitions.
[2024-06-14 14:58:03,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 225 transitions, 2404 flow
[2024-06-14 14:58:03,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 225 transitions, 2255 flow, removed 59 selfloop flow, removed 5 redundant places.
[2024-06-14 14:58:03,645 INFO  L231             Difference]: Finished difference. Result has 151 places, 191 transitions, 1828 flow
[2024-06-14 14:58:03,646 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1828, PETRI_PLACES=151, PETRI_TRANSITIONS=191}
[2024-06-14 14:58:03,646 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 108 predicate places.
[2024-06-14 14:58:03,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 191 transitions, 1828 flow
[2024-06-14 14:58:03,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:03,646 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:03,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:03,647 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 14:58:03,647 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:03,647 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:03,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 1154805520, now seen corresponding path program 3 times
[2024-06-14 14:58:03,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:03,647 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872355751]
[2024-06-14 14:58:03,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:03,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:03,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:15,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:15,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:15,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872355751]
[2024-06-14 14:58:15,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872355751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:15,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:15,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:15,495 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646371368]
[2024-06-14 14:58:15,495 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:15,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:15,496 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:15,496 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:15,496 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:15,639 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:15,639 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 191 transitions, 1828 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:15,640 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:15,640 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:15,640 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:17,392 INFO  L124   PetriNetUnfolderBase]: 2514/3708 cut-off events.
[2024-06-14 14:58:17,392 INFO  L125   PetriNetUnfolderBase]: For 175833/175833 co-relation queries the response was YES.
[2024-06-14 14:58:17,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27805 conditions, 3708 events. 2514/3708 cut-off events. For 175833/175833 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 17371 event pairs, 637 based on Foata normal form. 6/3714 useless extension candidates. Maximal degree in co-relation 27734. Up to 3562 conditions per place. 
[2024-06-14 14:58:17,424 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 200 selfloop transitions, 31 changer transitions 0/234 dead transitions.
[2024-06-14 14:58:17,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 234 transitions, 2682 flow
[2024-06-14 14:58:17,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:17,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:17,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions.
[2024-06-14 14:58:17,426 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4417989417989418
[2024-06-14 14:58:17,426 INFO  L175             Difference]: Start difference. First operand has 151 places, 191 transitions, 1828 flow. Second operand 9 states and 167 transitions.
[2024-06-14 14:58:17,426 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 234 transitions, 2682 flow
[2024-06-14 14:58:17,554 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 234 transitions, 2632 flow, removed 3 selfloop flow, removed 8 redundant places.
[2024-06-14 14:58:17,557 INFO  L231             Difference]: Finished difference. Result has 152 places, 195 transitions, 1949 flow
[2024-06-14 14:58:17,557 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1949, PETRI_PLACES=152, PETRI_TRANSITIONS=195}
[2024-06-14 14:58:17,558 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places.
[2024-06-14 14:58:17,558 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 195 transitions, 1949 flow
[2024-06-14 14:58:17,558 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:17,558 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:17,558 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:17,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 14:58:17,558 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:17,559 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:17,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 936588036, now seen corresponding path program 1 times
[2024-06-14 14:58:17,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:17,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585318768]
[2024-06-14 14:58:17,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:17,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:17,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:28,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:28,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:28,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585318768]
[2024-06-14 14:58:28,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585318768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:28,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:28,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:28,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400387985]
[2024-06-14 14:58:28,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:28,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:28,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:28,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:28,234 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:28,454 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:28,455 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 195 transitions, 1949 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:28,455 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:28,455 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:28,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:30,222 INFO  L124   PetriNetUnfolderBase]: 2542/3754 cut-off events.
[2024-06-14 14:58:30,223 INFO  L125   PetriNetUnfolderBase]: For 188373/188375 co-relation queries the response was YES.
[2024-06-14 14:58:30,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28522 conditions, 3754 events. 2542/3754 cut-off events. For 188373/188375 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 17666 event pairs, 588 based on Foata normal form. 8/3762 useless extension candidates. Maximal degree in co-relation 28450. Up to 3518 conditions per place. 
[2024-06-14 14:58:30,255 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 188 selfloop transitions, 40 changer transitions 0/231 dead transitions.
[2024-06-14 14:58:30,255 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 231 transitions, 2773 flow
[2024-06-14 14:58:30,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:58:30,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:58:30,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 14:58:30,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 14:58:30,257 INFO  L175             Difference]: Start difference. First operand has 152 places, 195 transitions, 1949 flow. Second operand 8 states and 152 transitions.
[2024-06-14 14:58:30,257 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 231 transitions, 2773 flow
[2024-06-14 14:58:30,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 231 transitions, 2650 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-14 14:58:30,394 INFO  L231             Difference]: Finished difference. Result has 153 places, 198 transitions, 1998 flow
[2024-06-14 14:58:30,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1998, PETRI_PLACES=153, PETRI_TRANSITIONS=198}
[2024-06-14 14:58:30,395 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 110 predicate places.
[2024-06-14 14:58:30,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 198 transitions, 1998 flow
[2024-06-14 14:58:30,395 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:30,395 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:30,395 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:30,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 14:58:30,395 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:30,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:30,396 INFO  L85        PathProgramCache]: Analyzing trace with hash 1270269670, now seen corresponding path program 4 times
[2024-06-14 14:58:30,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:30,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383686138]
[2024-06-14 14:58:30,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:30,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:30,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:42,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:42,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:42,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383686138]
[2024-06-14 14:58:42,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383686138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:42,709 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:42,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:42,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428481223]
[2024-06-14 14:58:42,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:42,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:42,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:42,710 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:42,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:42,921 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:42,922 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 198 transitions, 1998 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:42,922 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:42,922 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:42,922 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:44,567 INFO  L124   PetriNetUnfolderBase]: 2578/3806 cut-off events.
[2024-06-14 14:58:44,568 INFO  L125   PetriNetUnfolderBase]: For 198120/198122 co-relation queries the response was YES.
[2024-06-14 14:58:44,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29367 conditions, 3806 events. 2578/3806 cut-off events. For 198120/198122 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 17977 event pairs, 560 based on Foata normal form. 6/3812 useless extension candidates. Maximal degree in co-relation 29294. Up to 3193 conditions per place. 
[2024-06-14 14:58:44,600 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 159 selfloop transitions, 84 changer transitions 0/246 dead transitions.
[2024-06-14 14:58:44,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 246 transitions, 3068 flow
[2024-06-14 14:58:44,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:44,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:44,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-14 14:58:44,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46296296296296297
[2024-06-14 14:58:44,601 INFO  L175             Difference]: Start difference. First operand has 153 places, 198 transitions, 1998 flow. Second operand 9 states and 175 transitions.
[2024-06-14 14:58:44,602 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 246 transitions, 3068 flow
[2024-06-14 14:58:44,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 246 transitions, 2916 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-14 14:58:44,740 INFO  L231             Difference]: Finished difference. Result has 157 places, 205 transitions, 2208 flow
[2024-06-14 14:58:44,740 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2208, PETRI_PLACES=157, PETRI_TRANSITIONS=205}
[2024-06-14 14:58:44,740 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 114 predicate places.
[2024-06-14 14:58:44,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 205 transitions, 2208 flow
[2024-06-14 14:58:44,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:44,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:44,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:44,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 14:58:44,741 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:58:44,743 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:44,743 INFO  L85        PathProgramCache]: Analyzing trace with hash 1270092040, now seen corresponding path program 5 times
[2024-06-14 14:58:44,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:44,743 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848531512]
[2024-06-14 14:58:44,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:44,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:44,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:58:55,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:58:55,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:58:55,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848531512]
[2024-06-14 14:58:55,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848531512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:58:55,702 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:58:55,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:58:55,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956253533]
[2024-06-14 14:58:55,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:58:55,702 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:58:55,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:58:55,703 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:58:55,703 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:58:55,945 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:58:55,945 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 205 transitions, 2208 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:55,945 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:58:55,945 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:58:55,946 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:58:57,722 INFO  L124   PetriNetUnfolderBase]: 2670/3937 cut-off events.
[2024-06-14 14:58:57,722 INFO  L125   PetriNetUnfolderBase]: For 218186/218188 co-relation queries the response was YES.
[2024-06-14 14:58:57,741 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31830 conditions, 3937 events. 2670/3937 cut-off events. For 218186/218188 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18698 event pairs, 565 based on Foata normal form. 6/3943 useless extension candidates. Maximal degree in co-relation 31755. Up to 3220 conditions per place. 
[2024-06-14 14:58:57,758 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 170 selfloop transitions, 85 changer transitions 0/258 dead transitions.
[2024-06-14 14:58:57,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 258 transitions, 3636 flow
[2024-06-14 14:58:57,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:58:57,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:58:57,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-14 14:58:57,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47354497354497355
[2024-06-14 14:58:57,762 INFO  L175             Difference]: Start difference. First operand has 157 places, 205 transitions, 2208 flow. Second operand 9 states and 179 transitions.
[2024-06-14 14:58:57,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 258 transitions, 3636 flow
[2024-06-14 14:58:57,903 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 258 transitions, 3478 flow, removed 47 selfloop flow, removed 5 redundant places.
[2024-06-14 14:58:57,906 INFO  L231             Difference]: Finished difference. Result has 162 places, 213 transitions, 2436 flow
[2024-06-14 14:58:57,906 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2050, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2436, PETRI_PLACES=162, PETRI_TRANSITIONS=213}
[2024-06-14 14:58:57,907 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 119 predicate places.
[2024-06-14 14:58:57,907 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 213 transitions, 2436 flow
[2024-06-14 14:58:57,907 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:58:57,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:58:57,908 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:58:57,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 14:58:57,908 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-14 14:58:57,908 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:58:57,908 INFO  L85        PathProgramCache]: Analyzing trace with hash 1270091916, now seen corresponding path program 4 times
[2024-06-14 14:58:57,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:58:57,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083351052]
[2024-06-14 14:58:57,909 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:58:57,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:58:57,951 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:08,842 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:08,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:08,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083351052]
[2024-06-14 14:59:08,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083351052] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:08,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:08,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:08,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532495427]
[2024-06-14 14:59:08,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:08,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:08,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:08,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:08,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:09,081 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:09,082 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 213 transitions, 2436 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:09,082 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:09,082 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:09,082 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:10,933 INFO  L124   PetriNetUnfolderBase]: 2559/3834 cut-off events.
[2024-06-14 14:59:10,933 INFO  L125   PetriNetUnfolderBase]: For 231210/231252 co-relation queries the response was YES.
[2024-06-14 14:59:10,953 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32276 conditions, 3834 events. 2559/3834 cut-off events. For 231210/231252 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 18681 event pairs, 605 based on Foata normal form. 14/3837 useless extension candidates. Maximal degree in co-relation 32198. Up to 3476 conditions per place. 
[2024-06-14 14:59:10,970 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 177 selfloop transitions, 31 changer transitions 0/246 dead transitions.
[2024-06-14 14:59:10,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 246 transitions, 3024 flow
[2024-06-14 14:59:10,973 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:59:10,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:59:10,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-14 14:59:10,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-14 14:59:10,974 INFO  L175             Difference]: Start difference. First operand has 162 places, 213 transitions, 2436 flow. Second operand 9 states and 163 transitions.
[2024-06-14 14:59:10,974 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 246 transitions, 3024 flow
[2024-06-14 14:59:11,153 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 246 transitions, 2805 flow, removed 66 selfloop flow, removed 5 redundant places.
[2024-06-14 14:59:11,156 INFO  L231             Difference]: Finished difference. Result has 166 places, 215 transitions, 2384 flow
[2024-06-14 14:59:11,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2217, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2384, PETRI_PLACES=166, PETRI_TRANSITIONS=215}
[2024-06-14 14:59:11,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 123 predicate places.
[2024-06-14 14:59:11,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 215 transitions, 2384 flow
[2024-06-14 14:59:11,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:11,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:11,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:11,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 14:59:11,158 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-14 14:59:11,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:11,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 1270096690, now seen corresponding path program 6 times
[2024-06-14 14:59:11,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:11,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663204456]
[2024-06-14 14:59:11,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:11,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:11,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:21,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:21,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:21,918 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663204456]
[2024-06-14 14:59:21,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663204456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:21,919 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:21,919 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:21,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614600603]
[2024-06-14 14:59:21,919 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:21,919 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:21,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:21,920 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:21,920 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:22,113 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:22,113 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 215 transitions, 2384 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:22,113 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:22,113 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:22,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:23,820 INFO  L124   PetriNetUnfolderBase]: 2691/3970 cut-off events.
[2024-06-14 14:59:23,820 INFO  L125   PetriNetUnfolderBase]: For 240792/240794 co-relation queries the response was YES.
[2024-06-14 14:59:23,840 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33049 conditions, 3970 events. 2691/3970 cut-off events. For 240792/240794 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 18839 event pairs, 568 based on Foata normal form. 6/3976 useless extension candidates. Maximal degree in co-relation 32969. Up to 3357 conditions per place. 
[2024-06-14 14:59:23,855 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 179 selfloop transitions, 79 changer transitions 0/261 dead transitions.
[2024-06-14 14:59:23,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 261 transitions, 3557 flow
[2024-06-14 14:59:23,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 14:59:23,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 14:59:23,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-14 14:59:23,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4656084656084656
[2024-06-14 14:59:23,857 INFO  L175             Difference]: Start difference. First operand has 166 places, 215 transitions, 2384 flow. Second operand 9 states and 176 transitions.
[2024-06-14 14:59:23,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 261 transitions, 3557 flow
[2024-06-14 14:59:24,008 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 261 transitions, 3408 flow, removed 45 selfloop flow, removed 7 redundant places.
[2024-06-14 14:59:24,011 INFO  L231             Difference]: Finished difference. Result has 168 places, 219 transitions, 2511 flow
[2024-06-14 14:59:24,011 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2511, PETRI_PLACES=168, PETRI_TRANSITIONS=219}
[2024-06-14 14:59:24,012 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-14 14:59:24,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 219 transitions, 2511 flow
[2024-06-14 14:59:24,012 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:24,012 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:24,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:24,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 14:59:24,013 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:24,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:24,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -2037501715, now seen corresponding path program 1 times
[2024-06-14 14:59:24,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:24,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383080523]
[2024-06-14 14:59:24,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:24,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:24,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:36,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:36,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:36,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383080523]
[2024-06-14 14:59:36,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383080523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:36,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:36,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 14:59:36,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723444603]
[2024-06-14 14:59:36,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:36,027 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 14:59:36,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:36,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 14:59:36,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 14:59:36,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 14:59:36,189 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 219 transitions, 2511 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:36,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:36,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 14:59:36,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:37,687 INFO  L124   PetriNetUnfolderBase]: 2541/3798 cut-off events.
[2024-06-14 14:59:37,687 INFO  L125   PetriNetUnfolderBase]: For 245589/245613 co-relation queries the response was YES.
[2024-06-14 14:59:37,705 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32725 conditions, 3798 events. 2541/3798 cut-off events. For 245589/245613 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18490 event pairs, 630 based on Foata normal form. 2/3761 useless extension candidates. Maximal degree in co-relation 32644. Up to 3640 conditions per place. 
[2024-06-14 14:59:37,724 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 203 selfloop transitions, 22 changer transitions 0/240 dead transitions.
[2024-06-14 14:59:37,724 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 240 transitions, 3170 flow
[2024-06-14 14:59:37,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 14:59:37,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 14:59:37,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-14 14:59:37,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-14 14:59:37,725 INFO  L175             Difference]: Start difference. First operand has 168 places, 219 transitions, 2511 flow. Second operand 6 states and 110 transitions.
[2024-06-14 14:59:37,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 240 transitions, 3170 flow
[2024-06-14 14:59:37,929 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 240 transitions, 2923 flow, removed 42 selfloop flow, removed 7 redundant places.
[2024-06-14 14:59:37,932 INFO  L231             Difference]: Finished difference. Result has 167 places, 224 transitions, 2408 flow
[2024-06-14 14:59:37,932 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2274, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2408, PETRI_PLACES=167, PETRI_TRANSITIONS=224}
[2024-06-14 14:59:37,933 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places.
[2024-06-14 14:59:37,933 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 224 transitions, 2408 flow
[2024-06-14 14:59:37,933 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:37,933 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:37,933 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:37,933 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 14:59:37,933 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:37,934 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:37,934 INFO  L85        PathProgramCache]: Analyzing trace with hash -68849146, now seen corresponding path program 2 times
[2024-06-14 14:59:37,934 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:37,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166891724]
[2024-06-14 14:59:37,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:37,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:37,977 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:47,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:47,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:47,765 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166891724]
[2024-06-14 14:59:47,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166891724] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:47,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:47,766 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:47,766 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887505025]
[2024-06-14 14:59:47,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:47,766 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:47,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:47,767 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:47,767 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:47,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:47,940 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 224 transitions, 2408 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:47,940 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:47,940 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:47,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 14:59:49,917 INFO  L124   PetriNetUnfolderBase]: 2729/4026 cut-off events.
[2024-06-14 14:59:49,918 INFO  L125   PetriNetUnfolderBase]: For 258800/258800 co-relation queries the response was YES.
[2024-06-14 14:59:49,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33600 conditions, 4026 events. 2729/4026 cut-off events. For 258800/258800 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19163 event pairs, 646 based on Foata normal form. 6/4032 useless extension candidates. Maximal degree in co-relation 33518. Up to 3885 conditions per place. 
[2024-06-14 14:59:49,962 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 217 selfloop transitions, 33 changer transitions 0/253 dead transitions.
[2024-06-14 14:59:49,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 253 transitions, 3148 flow
[2024-06-14 14:59:49,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 14:59:49,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 14:59:49,963 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-14 14:59:49,963 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4255952380952381
[2024-06-14 14:59:49,963 INFO  L175             Difference]: Start difference. First operand has 167 places, 224 transitions, 2408 flow. Second operand 8 states and 143 transitions.
[2024-06-14 14:59:49,963 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 253 transitions, 3148 flow
[2024-06-14 14:59:50,139 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 253 transitions, 3089 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-14 14:59:50,142 INFO  L231             Difference]: Finished difference. Result has 172 places, 227 transitions, 2524 flow
[2024-06-14 14:59:50,143 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2349, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2524, PETRI_PLACES=172, PETRI_TRANSITIONS=227}
[2024-06-14 14:59:50,143 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 129 predicate places.
[2024-06-14 14:59:50,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 227 transitions, 2524 flow
[2024-06-14 14:59:50,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:50,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 14:59:50,144 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 14:59:50,144 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 14:59:50,144 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 14:59:50,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 14:59:50,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 391138382, now seen corresponding path program 1 times
[2024-06-14 14:59:50,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 14:59:50,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542590887]
[2024-06-14 14:59:50,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 14:59:50,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 14:59:50,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 14:59:59,618 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 14:59:59,620 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 14:59:59,620 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542590887]
[2024-06-14 14:59:59,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542590887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 14:59:59,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 14:59:59,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 14:59:59,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909414447]
[2024-06-14 14:59:59,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 14:59:59,621 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 14:59:59,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 14:59:59,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 14:59:59,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-06-14 14:59:59,822 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 14:59:59,823 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 227 transitions, 2524 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 14:59:59,823 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 14:59:59,823 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 14:59:59,823 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:01,798 INFO  L124   PetriNetUnfolderBase]: 2731/4029 cut-off events.
[2024-06-14 15:00:01,798 INFO  L125   PetriNetUnfolderBase]: For 267000/267000 co-relation queries the response was YES.
[2024-06-14 15:00:01,823 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34142 conditions, 4029 events. 2731/4029 cut-off events. For 267000/267000 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 19170 event pairs, 643 based on Foata normal form. 3/4032 useless extension candidates. Maximal degree in co-relation 34059. Up to 3875 conditions per place. 
[2024-06-14 15:00:01,842 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 216 selfloop transitions, 38 changer transitions 0/257 dead transitions.
[2024-06-14 15:00:01,843 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 257 transitions, 3296 flow
[2024-06-14 15:00:01,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:00:01,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:00:01,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:00:01,844 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 15:00:01,844 INFO  L175             Difference]: Start difference. First operand has 172 places, 227 transitions, 2524 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:00:01,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 257 transitions, 3296 flow
[2024-06-14 15:00:02,082 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 257 transitions, 3147 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:02,085 INFO  L231             Difference]: Finished difference. Result has 174 places, 231 transitions, 2587 flow
[2024-06-14 15:00:02,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2375, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2587, PETRI_PLACES=174, PETRI_TRANSITIONS=231}
[2024-06-14 15:00:02,087 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 131 predicate places.
[2024-06-14 15:00:02,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 174 places, 231 transitions, 2587 flow
[2024-06-14 15:00:02,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:02,087 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:02,087 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:02,087 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:00:02,087 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:02,088 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:02,088 INFO  L85        PathProgramCache]: Analyzing trace with hash 1816310782, now seen corresponding path program 7 times
[2024-06-14 15:00:02,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:02,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501446098]
[2024-06-14 15:00:02,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:02,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:02,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:12,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:12,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:12,784 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501446098]
[2024-06-14 15:00:12,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501446098] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:12,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:12,784 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:12,784 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098112136]
[2024-06-14 15:00:12,784 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:12,784 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:12,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:12,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:12,785 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:12,961 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:12,961 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 231 transitions, 2587 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:12,961 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:12,961 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:12,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:14,912 INFO  L124   PetriNetUnfolderBase]: 2767/4081 cut-off events.
[2024-06-14 15:00:14,912 INFO  L125   PetriNetUnfolderBase]: For 281957/281957 co-relation queries the response was YES.
[2024-06-14 15:00:14,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34806 conditions, 4081 events. 2767/4081 cut-off events. For 281957/281957 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 19467 event pairs, 644 based on Foata normal form. 6/4087 useless extension candidates. Maximal degree in co-relation 34722. Up to 3885 conditions per place. 
[2024-06-14 15:00:14,947 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 221 selfloop transitions, 42 changer transitions 0/266 dead transitions.
[2024-06-14 15:00:14,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 266 transitions, 3399 flow
[2024-06-14 15:00:14,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:14,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:14,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions.
[2024-06-14 15:00:14,949 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42592592592592593
[2024-06-14 15:00:14,949 INFO  L175             Difference]: Start difference. First operand has 174 places, 231 transitions, 2587 flow. Second operand 9 states and 161 transitions.
[2024-06-14 15:00:14,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 266 transitions, 3399 flow
[2024-06-14 15:00:15,164 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 266 transitions, 3247 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:15,185 INFO  L231             Difference]: Finished difference. Result has 177 places, 235 transitions, 2657 flow
[2024-06-14 15:00:15,186 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2435, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2657, PETRI_PLACES=177, PETRI_TRANSITIONS=235}
[2024-06-14 15:00:15,186 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 134 predicate places.
[2024-06-14 15:00:15,186 INFO  L495      AbstractCegarLoop]: Abstraction has has 177 places, 235 transitions, 2657 flow
[2024-06-14 15:00:15,186 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:15,186 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:15,187 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:15,187 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:00:15,187 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:15,187 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:15,187 INFO  L85        PathProgramCache]: Analyzing trace with hash -68552476, now seen corresponding path program 3 times
[2024-06-14 15:00:15,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:15,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037934678]
[2024-06-14 15:00:15,188 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:15,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:15,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:25,325 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:25,325 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:25,325 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037934678]
[2024-06-14 15:00:25,325 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037934678] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:25,325 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:25,325 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:25,326 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483634874]
[2024-06-14 15:00:25,326 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:25,326 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:25,326 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:25,326 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:25,327 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:25,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:25,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 235 transitions, 2657 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:25,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:25,584 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:25,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:27,487 INFO  L124   PetriNetUnfolderBase]: 2795/4125 cut-off events.
[2024-06-14 15:00:27,488 INFO  L125   PetriNetUnfolderBase]: For 296444/296444 co-relation queries the response was YES.
[2024-06-14 15:00:27,519 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35788 conditions, 4125 events. 2795/4125 cut-off events. For 296444/296444 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 19774 event pairs, 645 based on Foata normal form. 6/4131 useless extension candidates. Maximal degree in co-relation 35703. Up to 3997 conditions per place. 
[2024-06-14 15:00:27,544 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 233 selfloop transitions, 28 changer transitions 0/264 dead transitions.
[2024-06-14 15:00:27,545 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 264 transitions, 3435 flow
[2024-06-14 15:00:27,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:00:27,545 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:00:27,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-14 15:00:27,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-14 15:00:27,546 INFO  L175             Difference]: Start difference. First operand has 177 places, 235 transitions, 2657 flow. Second operand 8 states and 142 transitions.
[2024-06-14 15:00:27,546 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 264 transitions, 3435 flow
[2024-06-14 15:00:27,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 264 transitions, 3245 flow, removed 56 selfloop flow, removed 7 redundant places.
[2024-06-14 15:00:27,889 INFO  L231             Difference]: Finished difference. Result has 178 places, 238 transitions, 2643 flow
[2024-06-14 15:00:27,889 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2643, PETRI_PLACES=178, PETRI_TRANSITIONS=238}
[2024-06-14 15:00:27,889 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places.
[2024-06-14 15:00:27,889 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 238 transitions, 2643 flow
[2024-06-14 15:00:27,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:27,890 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:27,890 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:27,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:00:27,891 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:27,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:27,891 INFO  L85        PathProgramCache]: Analyzing trace with hash -305204430, now seen corresponding path program 8 times
[2024-06-14 15:00:27,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:27,894 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222290555]
[2024-06-14 15:00:27,894 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:27,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:27,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:38,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:38,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:38,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222290555]
[2024-06-14 15:00:38,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222290555] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:38,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:38,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:38,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320337008]
[2024-06-14 15:00:38,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:38,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:38,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:38,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:38,637 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:38,808 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:38,808 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 238 transitions, 2643 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:38,808 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:38,808 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:38,808 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:40,552 INFO  L124   PetriNetUnfolderBase]: 2831/4177 cut-off events.
[2024-06-14 15:00:40,552 INFO  L125   PetriNetUnfolderBase]: For 311561/311561 co-relation queries the response was YES.
[2024-06-14 15:00:40,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36411 conditions, 4177 events. 2831/4177 cut-off events. For 311561/311561 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20052 event pairs, 634 based on Foata normal form. 6/4183 useless extension candidates. Maximal degree in co-relation 36325. Up to 3814 conditions per place. 
[2024-06-14 15:00:40,598 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 216 selfloop transitions, 60 changer transitions 0/279 dead transitions.
[2024-06-14 15:00:40,599 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 279 transitions, 3731 flow
[2024-06-14 15:00:40,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:40,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:40,600 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-14 15:00:40,600 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-14 15:00:40,600 INFO  L175             Difference]: Start difference. First operand has 178 places, 238 transitions, 2643 flow. Second operand 9 states and 165 transitions.
[2024-06-14 15:00:40,600 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 279 transitions, 3731 flow
[2024-06-14 15:00:40,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 279 transitions, 3579 flow, removed 50 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:40,863 INFO  L231             Difference]: Finished difference. Result has 182 places, 245 transitions, 2833 flow
[2024-06-14 15:00:40,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2491, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2833, PETRI_PLACES=182, PETRI_TRANSITIONS=245}
[2024-06-14 15:00:40,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-14 15:00:40,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 245 transitions, 2833 flow
[2024-06-14 15:00:40,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:40,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:40,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:40,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:00:40,864 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:40,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:40,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 162822266, now seen corresponding path program 9 times
[2024-06-14 15:00:40,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:40,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595643102]
[2024-06-14 15:00:40,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:40,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:40,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:00:51,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:00:51,146 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:00:51,146 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595643102]
[2024-06-14 15:00:51,146 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595643102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:00:51,146 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:00:51,147 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:00:51,147 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347844912]
[2024-06-14 15:00:51,147 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:00:51,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:00:51,150 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:00:51,151 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:00:51,151 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:00:51,316 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:00:51,316 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 245 transitions, 2833 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:51,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:00:51,317 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:00:51,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:00:53,294 INFO  L124   PetriNetUnfolderBase]: 2867/4229 cut-off events.
[2024-06-14 15:00:53,295 INFO  L125   PetriNetUnfolderBase]: For 328103/328103 co-relation queries the response was YES.
[2024-06-14 15:00:53,317 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37835 conditions, 4229 events. 2867/4229 cut-off events. For 328103/328103 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20302 event pairs, 634 based on Foata normal form. 6/4235 useless extension candidates. Maximal degree in co-relation 37747. Up to 3713 conditions per place. 
[2024-06-14 15:00:53,334 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 218 selfloop transitions, 69 changer transitions 0/290 dead transitions.
[2024-06-14 15:00:53,335 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 290 transitions, 4259 flow
[2024-06-14 15:00:53,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:00:53,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:00:53,339 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions.
[2024-06-14 15:00:53,339 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-14 15:00:53,339 INFO  L175             Difference]: Start difference. First operand has 182 places, 245 transitions, 2833 flow. Second operand 9 states and 168 transitions.
[2024-06-14 15:00:53,339 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 290 transitions, 4259 flow
[2024-06-14 15:00:53,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 290 transitions, 4005 flow, removed 68 selfloop flow, removed 6 redundant places.
[2024-06-14 15:00:53,579 INFO  L231             Difference]: Finished difference. Result has 186 places, 253 transitions, 2995 flow
[2024-06-14 15:00:53,579 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2579, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2995, PETRI_PLACES=186, PETRI_TRANSITIONS=253}
[2024-06-14 15:00:53,579 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-14 15:00:53,580 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 253 transitions, 2995 flow
[2024-06-14 15:00:53,580 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:00:53,580 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:00:53,580 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:00:53,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:00:53,580 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:00:53,580 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:00:53,581 INFO  L85        PathProgramCache]: Analyzing trace with hash 163006840, now seen corresponding path program 4 times
[2024-06-14 15:00:53,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:00:53,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274129832]
[2024-06-14 15:00:53,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:00:53,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:00:53,630 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:04,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:04,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:04,492 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274129832]
[2024-06-14 15:01:04,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274129832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:04,492 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:04,492 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:01:04,492 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044136525]
[2024-06-14 15:01:04,492 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:04,492 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:01:04,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:04,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:01:04,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:01:04,695 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:01:04,695 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 253 transitions, 2995 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:04,695 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:04,695 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:01:04,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:06,432 INFO  L124   PetriNetUnfolderBase]: 2870/4234 cut-off events.
[2024-06-14 15:01:06,432 INFO  L125   PetriNetUnfolderBase]: For 342013/342013 co-relation queries the response was YES.
[2024-06-14 15:01:06,454 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38304 conditions, 4234 events. 2870/4234 cut-off events. For 342013/342013 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 20378 event pairs, 649 based on Foata normal form. 6/4240 useless extension candidates. Maximal degree in co-relation 38214. Up to 4074 conditions per place. 
[2024-06-14 15:01:06,472 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 251 selfloop transitions, 30 changer transitions 0/284 dead transitions.
[2024-06-14 15:01:06,473 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 284 transitions, 3935 flow
[2024-06-14 15:01:06,473 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:01:06,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:01:06,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-14 15:01:06,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-14 15:01:06,474 INFO  L175             Difference]: Start difference. First operand has 186 places, 253 transitions, 2995 flow. Second operand 8 states and 144 transitions.
[2024-06-14 15:01:06,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 284 transitions, 3935 flow
[2024-06-14 15:01:06,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 284 transitions, 3698 flow, removed 85 selfloop flow, removed 5 redundant places.
[2024-06-14 15:01:06,738 INFO  L231             Difference]: Finished difference. Result has 189 places, 256 transitions, 2954 flow
[2024-06-14 15:01:06,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2954, PETRI_PLACES=189, PETRI_TRANSITIONS=256}
[2024-06-14 15:01:06,739 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-14 15:01:06,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 256 transitions, 2954 flow
[2024-06-14 15:01:06,739 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:06,739 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:06,739 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:06,739 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:01:06,740 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:06,740 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:06,740 INFO  L85        PathProgramCache]: Analyzing trace with hash 162822142, now seen corresponding path program 5 times
[2024-06-14 15:01:06,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:06,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731000558]
[2024-06-14 15:01:06,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:06,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:06,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:18,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:18,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:18,421 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731000558]
[2024-06-14 15:01:18,421 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731000558] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:18,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:18,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:18,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090060686]
[2024-06-14 15:01:18,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:18,422 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:18,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:18,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:18,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:18,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:01:18,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 256 transitions, 2954 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:18,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:18,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:01:18,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:20,308 INFO  L124   PetriNetUnfolderBase]: 2725/4084 cut-off events.
[2024-06-14 15:01:20,308 INFO  L125   PetriNetUnfolderBase]: For 333745/333809 co-relation queries the response was YES.
[2024-06-14 15:01:20,332 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36754 conditions, 4084 events. 2725/4084 cut-off events. For 333745/333809 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 20073 event pairs, 620 based on Foata normal form. 8/4081 useless extension candidates. Maximal degree in co-relation 36662. Up to 3744 conditions per place. 
[2024-06-14 15:01:20,351 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 217 selfloop transitions, 19 changer transitions 0/286 dead transitions.
[2024-06-14 15:01:20,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 286 transitions, 3612 flow
[2024-06-14 15:01:20,354 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:01:20,354 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:01:20,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions.
[2024-06-14 15:01:20,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4126984126984127
[2024-06-14 15:01:20,355 INFO  L175             Difference]: Start difference. First operand has 189 places, 256 transitions, 2954 flow. Second operand 9 states and 156 transitions.
[2024-06-14 15:01:20,355 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 286 transitions, 3612 flow
[2024-06-14 15:01:20,595 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 286 transitions, 3440 flow, removed 58 selfloop flow, removed 6 redundant places.
[2024-06-14 15:01:20,599 INFO  L231             Difference]: Finished difference. Result has 192 places, 258 transitions, 2947 flow
[2024-06-14 15:01:20,599 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2947, PETRI_PLACES=192, PETRI_TRANSITIONS=258}
[2024-06-14 15:01:20,599 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 149 predicate places.
[2024-06-14 15:01:20,599 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 258 transitions, 2947 flow
[2024-06-14 15:01:20,600 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:20,600 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:20,600 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:20,600 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:01:20,600 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:20,600 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:20,601 INFO  L85        PathProgramCache]: Analyzing trace with hash 162999896, now seen corresponding path program 10 times
[2024-06-14 15:01:20,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:20,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075745622]
[2024-06-14 15:01:20,601 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:20,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:20,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:30,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:30,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:30,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075745622]
[2024-06-14 15:01:30,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075745622] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:30,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:30,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:01:30,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896481458]
[2024-06-14 15:01:30,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:30,986 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:01:30,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:30,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:01:30,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:01:31,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:01:31,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 258 transitions, 2947 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:31,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:31,220 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:01:31,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:33,003 INFO  L124   PetriNetUnfolderBase]: 2866/4228 cut-off events.
[2024-06-14 15:01:33,004 INFO  L125   PetriNetUnfolderBase]: For 351123/351123 co-relation queries the response was YES.
[2024-06-14 15:01:33,030 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37744 conditions, 4228 events. 2866/4228 cut-off events. For 351123/351123 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20352 event pairs, 642 based on Foata normal form. 6/4234 useless extension candidates. Maximal degree in co-relation 37651. Up to 3865 conditions per place. 
[2024-06-14 15:01:33,050 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 233 selfloop transitions, 59 changer transitions 0/295 dead transitions.
[2024-06-14 15:01:33,050 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 295 transitions, 3942 flow
[2024-06-14 15:01:33,050 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:01:33,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:01:33,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 165 transitions.
[2024-06-14 15:01:33,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-14 15:01:33,051 INFO  L175             Difference]: Start difference. First operand has 192 places, 258 transitions, 2947 flow. Second operand 9 states and 165 transitions.
[2024-06-14 15:01:33,051 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 295 transitions, 3942 flow
[2024-06-14 15:01:33,324 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 295 transitions, 3795 flow, removed 56 selfloop flow, removed 7 redundant places.
[2024-06-14 15:01:33,328 INFO  L231             Difference]: Finished difference. Result has 194 places, 262 transitions, 3066 flow
[2024-06-14 15:01:33,328 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3066, PETRI_PLACES=194, PETRI_TRANSITIONS=262}
[2024-06-14 15:01:33,328 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-14 15:01:33,328 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 262 transitions, 3066 flow
[2024-06-14 15:01:33,329 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:33,329 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:33,329 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:33,329 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:01:33,329 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:33,329 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:33,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -1481792305, now seen corresponding path program 2 times
[2024-06-14 15:01:33,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:33,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459895233]
[2024-06-14 15:01:33,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:33,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:33,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:01:45,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:01:45,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:01:45,148 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459895233]
[2024-06-14 15:01:45,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459895233] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:01:45,148 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:01:45,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:01:45,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59336931]
[2024-06-14 15:01:45,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:01:45,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:01:45,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:01:45,150 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:01:45,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:01:45,261 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-14 15:01:45,262 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 262 transitions, 3066 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:45,262 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:01:45,262 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-14 15:01:45,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:01:46,760 INFO  L124   PetriNetUnfolderBase]: 2688/4024 cut-off events.
[2024-06-14 15:01:46,760 INFO  L125   PetriNetUnfolderBase]: For 349612/349636 co-relation queries the response was YES.
[2024-06-14 15:01:46,782 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36531 conditions, 4024 events. 2688/4024 cut-off events. For 349612/349636 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 19859 event pairs, 643 based on Foata normal form. 2/3987 useless extension candidates. Maximal degree in co-relation 36437. Up to 3867 conditions per place. 
[2024-06-14 15:01:46,799 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 239 selfloop transitions, 13 changer transitions 0/271 dead transitions.
[2024-06-14 15:01:46,799 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 271 transitions, 3592 flow
[2024-06-14 15:01:46,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:01:46,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:01:46,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-14 15:01:46,800 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4007936507936508
[2024-06-14 15:01:46,800 INFO  L175             Difference]: Start difference. First operand has 194 places, 262 transitions, 3066 flow. Second operand 6 states and 101 transitions.
[2024-06-14 15:01:46,801 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 271 transitions, 3592 flow
[2024-06-14 15:01:47,058 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 271 transitions, 3376 flow, removed 68 selfloop flow, removed 6 redundant places.
[2024-06-14 15:01:47,061 INFO  L231             Difference]: Finished difference. Result has 194 places, 262 transitions, 2884 flow
[2024-06-14 15:01:47,061 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2850, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2884, PETRI_PLACES=194, PETRI_TRANSITIONS=262}
[2024-06-14 15:01:47,062 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 151 predicate places.
[2024-06-14 15:01:47,062 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 262 transitions, 2884 flow
[2024-06-14 15:01:47,062 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:01:47,062 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:01:47,062 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:01:47,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:01:47,063 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:01:47,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:01:47,063 INFO  L85        PathProgramCache]: Analyzing trace with hash 1220222261, now seen corresponding path program 1 times
[2024-06-14 15:01:47,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:01:47,063 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977247778]
[2024-06-14 15:01:47,063 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:01:47,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:01:47,094 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:02,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:02,420 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:02,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977247778]
[2024-06-14 15:02:02,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977247778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:02,420 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:02,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:02:02,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952342319]
[2024-06-14 15:02:02,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:02,420 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:02:02,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:02,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:02:02,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:02:02,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:02,539 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 262 transitions, 2884 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:02:02,539 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:02,539 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:02,539 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:04,167 INFO  L124   PetriNetUnfolderBase]: 2859/4219 cut-off events.
[2024-06-14 15:02:04,168 INFO  L125   PetriNetUnfolderBase]: For 356113/356113 co-relation queries the response was YES.
[2024-06-14 15:02:04,200 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37412 conditions, 4219 events. 2859/4219 cut-off events. For 356113/356113 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20236 event pairs, 673 based on Foata normal form. 3/4222 useless extension candidates. Maximal degree in co-relation 37317. Up to 4151 conditions per place. 
[2024-06-14 15:02:04,222 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 251 selfloop transitions, 24 changer transitions 0/278 dead transitions.
[2024-06-14 15:02:04,222 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 278 transitions, 3608 flow
[2024-06-14 15:02:04,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:02:04,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:02:04,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions.
[2024-06-14 15:02:04,230 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42063492063492064
[2024-06-14 15:02:04,230 INFO  L175             Difference]: Start difference. First operand has 194 places, 262 transitions, 2884 flow. Second operand 6 states and 106 transitions.
[2024-06-14 15:02:04,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 278 transitions, 3608 flow
[2024-06-14 15:02:04,552 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 278 transitions, 3558 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-14 15:02:04,556 INFO  L231             Difference]: Finished difference. Result has 195 places, 265 transitions, 2937 flow
[2024-06-14 15:02:04,556 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2834, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2937, PETRI_PLACES=195, PETRI_TRANSITIONS=265}
[2024-06-14 15:02:04,556 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 152 predicate places.
[2024-06-14 15:02:04,557 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 265 transitions, 2937 flow
[2024-06-14 15:02:04,557 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:02:04,557 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:04,557 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:04,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:02:04,557 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-14 15:02:04,557 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:04,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -1481786353, now seen corresponding path program 2 times
[2024-06-14 15:02:04,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:04,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689738776]
[2024-06-14 15:02:04,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:04,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:04,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:21,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:21,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:21,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689738776]
[2024-06-14 15:02:21,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689738776] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:21,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:21,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:02:21,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6475134]
[2024-06-14 15:02:21,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:21,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:02:21,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:21,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:02:21,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:02:21,427 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:21,427 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 265 transitions, 2937 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:02:21,428 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:21,428 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:21,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:23,151 INFO  L124   PetriNetUnfolderBase]: 2827/4172 cut-off events.
[2024-06-14 15:02:23,152 INFO  L125   PetriNetUnfolderBase]: For 363747/363749 co-relation queries the response was YES.
[2024-06-14 15:02:23,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37300 conditions, 4172 events. 2827/4172 cut-off events. For 363747/363749 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19997 event pairs, 673 based on Foata normal form. 1/4173 useless extension candidates. Maximal degree in co-relation 37204. Up to 4105 conditions per place. 
[2024-06-14 15:02:23,194 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 246 selfloop transitions, 25 changer transitions 0/274 dead transitions.
[2024-06-14 15:02:23,194 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 274 transitions, 3501 flow
[2024-06-14 15:02:23,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:02:23,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:02:23,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-14 15:02:23,208 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-14 15:02:23,209 INFO  L175             Difference]: Start difference. First operand has 195 places, 265 transitions, 2937 flow. Second operand 6 states and 103 transitions.
[2024-06-14 15:02:23,209 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 274 transitions, 3501 flow
[2024-06-14 15:02:23,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 274 transitions, 3449 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-14 15:02:23,515 INFO  L231             Difference]: Finished difference. Result has 197 places, 265 transitions, 2941 flow
[2024-06-14 15:02:23,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2941, PETRI_PLACES=197, PETRI_TRANSITIONS=265}
[2024-06-14 15:02:23,515 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 154 predicate places.
[2024-06-14 15:02:23,515 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 265 transitions, 2941 flow
[2024-06-14 15:02:23,515 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 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-14 15:02:23,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:23,516 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:23,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:02:23,516 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:23,516 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:23,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -403890604, now seen corresponding path program 1 times
[2024-06-14 15:02:23,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:23,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5144187]
[2024-06-14 15:02:23,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:23,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:23,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:35,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:35,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:35,780 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5144187]
[2024-06-14 15:02:35,781 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5144187] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:35,781 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:35,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:35,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977718613]
[2024-06-14 15:02:35,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:35,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:35,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:35,784 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:35,784 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:36,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:36,083 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 265 transitions, 2941 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:36,083 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:36,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:36,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:38,355 INFO  L124   PetriNetUnfolderBase]: 3165/4708 cut-off events.
[2024-06-14 15:02:38,355 INFO  L125   PetriNetUnfolderBase]: For 469972/469972 co-relation queries the response was YES.
[2024-06-14 15:02:38,383 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44749 conditions, 4708 events. 3165/4708 cut-off events. For 469972/469972 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 23539 event pairs, 626 based on Foata normal form. 24/4732 useless extension candidates. Maximal degree in co-relation 44652. Up to 3726 conditions per place. 
[2024-06-14 15:02:38,402 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 277 selfloop transitions, 57 changer transitions 0/337 dead transitions.
[2024-06-14 15:02:38,402 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 337 transitions, 4707 flow
[2024-06-14 15:02:38,403 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:02:38,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:38,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 215 transitions.
[2024-06-14 15:02:38,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4653679653679654
[2024-06-14 15:02:38,404 INFO  L175             Difference]: Start difference. First operand has 197 places, 265 transitions, 2941 flow. Second operand 11 states and 215 transitions.
[2024-06-14 15:02:38,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 337 transitions, 4707 flow
[2024-06-14 15:02:38,785 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 337 transitions, 4641 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-14 15:02:38,789 INFO  L231             Difference]: Finished difference. Result has 205 places, 271 transitions, 3260 flow
[2024-06-14 15:02:38,789 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3260, PETRI_PLACES=205, PETRI_TRANSITIONS=271}
[2024-06-14 15:02:38,789 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 162 predicate places.
[2024-06-14 15:02:38,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 271 transitions, 3260 flow
[2024-06-14 15:02:38,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:38,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:38,790 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:38,790 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:02:38,790 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:38,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:38,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 1352398392, now seen corresponding path program 2 times
[2024-06-14 15:02:38,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:38,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368940871]
[2024-06-14 15:02:38,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:38,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:38,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:02:49,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:02:49,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:02:49,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368940871]
[2024-06-14 15:02:49,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368940871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:02:49,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:02:49,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:02:49,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439207801]
[2024-06-14 15:02:49,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:02:49,881 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:02:49,881 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:02:49,882 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:02:49,882 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:02:50,171 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:02:50,171 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 271 transitions, 3260 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:50,171 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:02:50,171 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:02:50,171 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:02:52,465 INFO  L124   PetriNetUnfolderBase]: 3289/4912 cut-off events.
[2024-06-14 15:02:52,465 INFO  L125   PetriNetUnfolderBase]: For 532109/532109 co-relation queries the response was YES.
[2024-06-14 15:02:52,495 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47898 conditions, 4912 events. 3289/4912 cut-off events. For 532109/532109 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25015 event pairs, 824 based on Foata normal form. 30/4942 useless extension candidates. Maximal degree in co-relation 47798. Up to 4447 conditions per place. 
[2024-06-14 15:02:52,517 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 270 selfloop transitions, 56 changer transitions 0/329 dead transitions.
[2024-06-14 15:02:52,517 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 329 transitions, 4533 flow
[2024-06-14 15:02:52,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:02:52,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:02:52,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 209 transitions.
[2024-06-14 15:02:52,527 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:02:52,527 INFO  L175             Difference]: Start difference. First operand has 205 places, 271 transitions, 3260 flow. Second operand 11 states and 209 transitions.
[2024-06-14 15:02:52,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 329 transitions, 4533 flow
[2024-06-14 15:02:52,986 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 329 transitions, 4354 flow, removed 58 selfloop flow, removed 6 redundant places.
[2024-06-14 15:02:52,990 INFO  L231             Difference]: Finished difference. Result has 210 places, 273 transitions, 3324 flow
[2024-06-14 15:02:52,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3081, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3324, PETRI_PLACES=210, PETRI_TRANSITIONS=273}
[2024-06-14 15:02:52,990 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 167 predicate places.
[2024-06-14 15:02:52,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 210 places, 273 transitions, 3324 flow
[2024-06-14 15:02:52,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:02:52,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:02:52,991 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:02:52,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:02:52,991 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:02:52,992 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:02:52,992 INFO  L85        PathProgramCache]: Analyzing trace with hash 1352394672, now seen corresponding path program 3 times
[2024-06-14 15:02:52,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:02:52,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994814795]
[2024-06-14 15:02:52,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:02:52,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:02:53,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:03,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-14 15:03:03,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:03,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994814795]
[2024-06-14 15:03:03,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994814795] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:03,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:03,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:03,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903668089]
[2024-06-14 15:03:03,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:03,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:03,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:03,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:03,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:04,202 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:04,202 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 273 transitions, 3324 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:04,202 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:04,202 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:04,203 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:06,768 INFO  L124   PetriNetUnfolderBase]: 3457/5180 cut-off events.
[2024-06-14 15:03:06,768 INFO  L125   PetriNetUnfolderBase]: For 555911/555911 co-relation queries the response was YES.
[2024-06-14 15:03:06,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51113 conditions, 5180 events. 3457/5180 cut-off events. For 555911/555911 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26858 event pairs, 868 based on Foata normal form. 24/5204 useless extension candidates. Maximal degree in co-relation 51011. Up to 4443 conditions per place. 
[2024-06-14 15:03:06,835 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 277 selfloop transitions, 57 changer transitions 0/337 dead transitions.
[2024-06-14 15:03:06,835 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 337 transitions, 4832 flow
[2024-06-14 15:03:06,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-14 15:03:06,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-14 15:03:06,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 212 transitions.
[2024-06-14 15:03:06,837 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4588744588744589
[2024-06-14 15:03:06,837 INFO  L175             Difference]: Start difference. First operand has 210 places, 273 transitions, 3324 flow. Second operand 11 states and 212 transitions.
[2024-06-14 15:03:06,837 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 337 transitions, 4832 flow
[2024-06-14 15:03:07,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 337 transitions, 4646 flow, removed 39 selfloop flow, removed 9 redundant places.
[2024-06-14 15:03:07,479 INFO  L231             Difference]: Finished difference. Result has 213 places, 277 transitions, 3474 flow
[2024-06-14 15:03:07,479 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3474, PETRI_PLACES=213, PETRI_TRANSITIONS=277}
[2024-06-14 15:03:07,480 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 170 predicate places.
[2024-06-14 15:03:07,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 277 transitions, 3474 flow
[2024-06-14 15:03:07,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:07,481 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:07,481 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:07,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:03:07,481 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:07,481 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:07,481 INFO  L85        PathProgramCache]: Analyzing trace with hash -1641679112, now seen corresponding path program 4 times
[2024-06-14 15:03:07,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:07,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532019665]
[2024-06-14 15:03:07,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:07,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:07,538 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:19,625 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:19,626 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:19,626 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532019665]
[2024-06-14 15:03:19,626 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532019665] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:19,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:19,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:19,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728688597]
[2024-06-14 15:03:19,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:19,627 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:19,627 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:19,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:19,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:19,843 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:19,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 277 transitions, 3474 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:19,844 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:19,844 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:19,844 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:22,316 INFO  L124   PetriNetUnfolderBase]: 3581/5384 cut-off events.
[2024-06-14 15:03:22,317 INFO  L125   PetriNetUnfolderBase]: For 586703/586703 co-relation queries the response was YES.
[2024-06-14 15:03:22,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53174 conditions, 5384 events. 3581/5384 cut-off events. For 586703/586703 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 28289 event pairs, 942 based on Foata normal form. 30/5414 useless extension candidates. Maximal degree in co-relation 53070. Up to 4995 conditions per place. 
[2024-06-14 15:03:22,375 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 279 selfloop transitions, 44 changer transitions 0/326 dead transitions.
[2024-06-14 15:03:22,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 326 transitions, 4627 flow
[2024-06-14 15:03:22,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:03:22,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:03:22,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions.
[2024-06-14 15:03:22,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44285714285714284
[2024-06-14 15:03:22,377 INFO  L175             Difference]: Start difference. First operand has 213 places, 277 transitions, 3474 flow. Second operand 10 states and 186 transitions.
[2024-06-14 15:03:22,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 326 transitions, 4627 flow
[2024-06-14 15:03:22,950 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 326 transitions, 4446 flow, removed 57 selfloop flow, removed 7 redundant places.
[2024-06-14 15:03:22,954 INFO  L231             Difference]: Finished difference. Result has 216 places, 279 transitions, 3520 flow
[2024-06-14 15:03:22,954 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3293, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3520, PETRI_PLACES=216, PETRI_TRANSITIONS=279}
[2024-06-14 15:03:22,955 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 173 predicate places.
[2024-06-14 15:03:22,955 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 279 transitions, 3520 flow
[2024-06-14 15:03:22,955 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:22,955 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:22,955 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:22,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:03:22,955 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:22,956 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:22,956 INFO  L85        PathProgramCache]: Analyzing trace with hash -315171022, now seen corresponding path program 1 times
[2024-06-14 15:03:22,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:22,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957116245]
[2024-06-14 15:03:22,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:22,956 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:23,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:34,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:34,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:34,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957116245]
[2024-06-14 15:03:34,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957116245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:34,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:34,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:03:34,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46497840]
[2024-06-14 15:03:34,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:34,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:03:34,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:34,038 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:03:34,038 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:03:34,232 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:34,233 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 279 transitions, 3520 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:34,233 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:34,233 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:34,233 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:36,625 INFO  L124   PetriNetUnfolderBase]: 3609/5428 cut-off events.
[2024-06-14 15:03:36,626 INFO  L125   PetriNetUnfolderBase]: For 571421/571421 co-relation queries the response was YES.
[2024-06-14 15:03:36,659 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 53423 conditions, 5428 events. 3609/5428 cut-off events. For 571421/571421 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 28643 event pairs, 942 based on Foata normal form. 6/5434 useless extension candidates. Maximal degree in co-relation 53317. Up to 5288 conditions per place. 
[2024-06-14 15:03:36,683 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 281 selfloop transitions, 35 changer transitions 0/319 dead transitions.
[2024-06-14 15:03:36,684 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 319 transitions, 4496 flow
[2024-06-14 15:03:36,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:03:36,684 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:03:36,685 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions.
[2024-06-14 15:03:36,685 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43386243386243384
[2024-06-14 15:03:36,685 INFO  L175             Difference]: Start difference. First operand has 216 places, 279 transitions, 3520 flow. Second operand 9 states and 164 transitions.
[2024-06-14 15:03:36,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 319 transitions, 4496 flow
[2024-06-14 15:03:37,272 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 319 transitions, 4326 flow, removed 43 selfloop flow, removed 8 redundant places.
[2024-06-14 15:03:37,276 INFO  L231             Difference]: Finished difference. Result has 217 places, 282 transitions, 3570 flow
[2024-06-14 15:03:37,276 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3350, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3570, PETRI_PLACES=217, PETRI_TRANSITIONS=282}
[2024-06-14 15:03:37,276 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 174 predicate places.
[2024-06-14 15:03:37,276 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 282 transitions, 3570 flow
[2024-06-14 15:03:37,276 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:37,277 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:37,277 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:37,277 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:03:37,277 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:03:37,277 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:37,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 1439086482, now seen corresponding path program 5 times
[2024-06-14 15:03:37,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:37,278 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961514046]
[2024-06-14 15:03:37,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:37,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:37,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:03:51,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:03:51,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:03:51,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961514046]
[2024-06-14 15:03:51,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961514046] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:03:51,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:03:51,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:03:51,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676060060]
[2024-06-14 15:03:51,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:03:51,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:03:51,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:03:51,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:03:51,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:03:51,332 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:03:51,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 282 transitions, 3570 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:51,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:03:51,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:03:51,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:03:53,920 INFO  L124   PetriNetUnfolderBase]: 3705/5588 cut-off events.
[2024-06-14 15:03:53,920 INFO  L125   PetriNetUnfolderBase]: For 612393/612393 co-relation queries the response was YES.
[2024-06-14 15:03:53,955 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54657 conditions, 5588 events. 3705/5588 cut-off events. For 612393/612393 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 29736 event pairs, 915 based on Foata normal form. 24/5612 useless extension candidates. Maximal degree in co-relation 54550. Up to 4722 conditions per place. 
[2024-06-14 15:03:53,984 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 291 selfloop transitions, 45 changer transitions 0/339 dead transitions.
[2024-06-14 15:03:53,984 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 339 transitions, 5182 flow
[2024-06-14 15:03:53,985 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:03:53,985 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:03:53,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-14 15:03:53,985 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:03:53,985 INFO  L175             Difference]: Start difference. First operand has 217 places, 282 transitions, 3570 flow. Second operand 10 states and 190 transitions.
[2024-06-14 15:03:53,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 339 transitions, 5182 flow
[2024-06-14 15:03:54,626 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 339 transitions, 4986 flow, removed 65 selfloop flow, removed 7 redundant places.
[2024-06-14 15:03:54,631 INFO  L231             Difference]: Finished difference. Result has 221 places, 286 transitions, 3704 flow
[2024-06-14 15:03:54,631 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3374, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3704, PETRI_PLACES=221, PETRI_TRANSITIONS=286}
[2024-06-14 15:03:54,631 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 178 predicate places.
[2024-06-14 15:03:54,631 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 286 transitions, 3704 flow
[2024-06-14 15:03:54,631 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:03:54,632 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:03:54,632 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:03:54,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:03:54,632 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-14 15:03:54,632 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:03:54,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 1439234352, now seen corresponding path program 6 times
[2024-06-14 15:03:54,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:03:54,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715896853]
[2024-06-14 15:03:54,633 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:03:54,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:03:54,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:05,690 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:05,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:05,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715896853]
[2024-06-14 15:04:05,691 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715896853] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:05,691 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:05,691 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:04:05,691 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417649936]
[2024-06-14 15:04:05,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:05,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:04:05,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:05,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:04:05,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:04:06,048 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:06,049 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 286 transitions, 3704 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:06,049 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:06,049 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:06,049 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:08,435 INFO  L124   PetriNetUnfolderBase]: 3718/5611 cut-off events.
[2024-06-14 15:04:08,436 INFO  L125   PetriNetUnfolderBase]: For 633116/633116 co-relation queries the response was YES.
[2024-06-14 15:04:08,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54228 conditions, 5611 events. 3718/5611 cut-off events. For 633116/633116 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 29877 event pairs, 947 based on Foata normal form. 30/5641 useless extension candidates. Maximal degree in co-relation 54119. Up to 5285 conditions per place. 
[2024-06-14 15:04:08,495 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 293 selfloop transitions, 38 changer transitions 0/334 dead transitions.
[2024-06-14 15:04:08,496 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 334 transitions, 4778 flow
[2024-06-14 15:04:08,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:04:08,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:04:08,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions.
[2024-06-14 15:04:08,497 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4380952380952381
[2024-06-14 15:04:08,497 INFO  L175             Difference]: Start difference. First operand has 221 places, 286 transitions, 3704 flow. Second operand 10 states and 184 transitions.
[2024-06-14 15:04:08,497 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 334 transitions, 4778 flow
[2024-06-14 15:04:09,032 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 334 transitions, 4602 flow, removed 63 selfloop flow, removed 6 redundant places.
[2024-06-14 15:04:09,037 INFO  L231             Difference]: Finished difference. Result has 225 places, 288 transitions, 3754 flow
[2024-06-14 15:04:09,037 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3530, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3754, PETRI_PLACES=225, PETRI_TRANSITIONS=288}
[2024-06-14 15:04:09,038 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 182 predicate places.
[2024-06-14 15:04:09,038 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 288 transitions, 3754 flow
[2024-06-14 15:04:09,038 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:09,038 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:09,038 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:09,038 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 15:04:09,038 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:09,039 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:09,039 INFO  L85        PathProgramCache]: Analyzing trace with hash 723863468, now seen corresponding path program 2 times
[2024-06-14 15:04:09,039 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:09,039 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338863383]
[2024-06-14 15:04:09,039 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:09,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:09,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:20,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:20,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:20,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338863383]
[2024-06-14 15:04:20,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338863383] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:20,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:20,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:04:20,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212547106]
[2024-06-14 15:04:20,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:20,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:04:20,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:20,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:04:20,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:04:20,715 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:20,715 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 288 transitions, 3754 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:20,715 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:20,715 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:20,715 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:22,933 INFO  L124   PetriNetUnfolderBase]: 3746/5657 cut-off events.
[2024-06-14 15:04:22,933 INFO  L125   PetriNetUnfolderBase]: For 584199/584201 co-relation queries the response was YES.
[2024-06-14 15:04:22,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54269 conditions, 5657 events. 3746/5657 cut-off events. For 584199/584201 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 30248 event pairs, 836 based on Foata normal form. 8/5665 useless extension candidates. Maximal degree in co-relation 54158. Up to 5116 conditions per place. 
[2024-06-14 15:04:23,000 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 244 selfloop transitions, 81 changer transitions 0/328 dead transitions.
[2024-06-14 15:04:23,000 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 328 transitions, 4884 flow
[2024-06-14 15:04:23,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:04:23,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:04:23,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 15:04:23,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-14 15:04:23,001 INFO  L175             Difference]: Start difference. First operand has 225 places, 288 transitions, 3754 flow. Second operand 9 states and 171 transitions.
[2024-06-14 15:04:23,001 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 328 transitions, 4884 flow
[2024-06-14 15:04:23,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 328 transitions, 4720 flow, removed 46 selfloop flow, removed 8 redundant places.
[2024-06-14 15:04:23,668 INFO  L231             Difference]: Finished difference. Result has 226 places, 291 transitions, 3912 flow
[2024-06-14 15:04:23,668 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3590, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3912, PETRI_PLACES=226, PETRI_TRANSITIONS=291}
[2024-06-14 15:04:23,669 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 183 predicate places.
[2024-06-14 15:04:23,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 291 transitions, 3912 flow
[2024-06-14 15:04:23,669 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:23,669 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:23,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-14 15:04:23,669 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 15:04:23,669 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:23,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:23,670 INFO  L85        PathProgramCache]: Analyzing trace with hash 723870908, now seen corresponding path program 3 times
[2024-06-14 15:04:23,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:23,670 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933074702]
[2024-06-14 15:04:23,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:23,670 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:23,714 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:34,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:34,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:34,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933074702]
[2024-06-14 15:04:34,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933074702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:34,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:34,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:04:34,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227503349]
[2024-06-14 15:04:34,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:34,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:04:34,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:34,294 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:04:34,294 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:04:34,451 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:34,476 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 291 transitions, 3912 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:34,476 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:34,476 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:34,476 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:37,062 INFO  L124   PetriNetUnfolderBase]: 3812/5759 cut-off events.
[2024-06-14 15:04:37,062 INFO  L125   PetriNetUnfolderBase]: For 615106/615108 co-relation queries the response was YES.
[2024-06-14 15:04:37,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55583 conditions, 5759 events. 3812/5759 cut-off events. For 615106/615108 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 30973 event pairs, 832 based on Foata normal form. 8/5767 useless extension candidates. Maximal degree in co-relation 55471. Up to 5098 conditions per place. 
[2024-06-14 15:04:37,135 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 241 selfloop transitions, 92 changer transitions 0/336 dead transitions.
[2024-06-14 15:04:37,136 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 336 transitions, 5450 flow
[2024-06-14 15:04:37,136 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:04:37,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:04:37,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-14 15:04:37,137 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4576719576719577
[2024-06-14 15:04:37,137 INFO  L175             Difference]: Start difference. First operand has 226 places, 291 transitions, 3912 flow. Second operand 9 states and 173 transitions.
[2024-06-14 15:04:37,137 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 336 transitions, 5450 flow
[2024-06-14 15:04:37,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 336 transitions, 5148 flow, removed 72 selfloop flow, removed 7 redundant places.
[2024-06-14 15:04:37,890 INFO  L231             Difference]: Finished difference. Result has 228 places, 297 transitions, 4112 flow
[2024-06-14 15:04:37,890 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3610, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4112, PETRI_PLACES=228, PETRI_TRANSITIONS=297}
[2024-06-14 15:04:37,890 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 185 predicate places.
[2024-06-14 15:04:37,891 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 297 transitions, 4112 flow
[2024-06-14 15:04:37,891 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:37,891 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:37,891 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:37,891 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 15:04:37,891 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:37,891 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:37,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030755620, now seen corresponding path program 7 times
[2024-06-14 15:04:37,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:37,892 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796919437]
[2024-06-14 15:04:37,892 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:37,892 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:37,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:04:47,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:04:47,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:04:47,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796919437]
[2024-06-14 15:04:47,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796919437] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:04:47,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:04:47,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:04:47,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675653032]
[2024-06-14 15:04:47,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:04:47,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:04:47,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:04:47,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:04:47,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:04:47,587 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:04:47,588 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 297 transitions, 4112 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:47,588 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:04:47,588 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:04:47,588 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:04:50,179 INFO  L124   PetriNetUnfolderBase]: 3936/5963 cut-off events.
[2024-06-14 15:04:50,180 INFO  L125   PetriNetUnfolderBase]: For 703192/703194 co-relation queries the response was YES.
[2024-06-14 15:04:50,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58095 conditions, 5963 events. 3936/5963 cut-off events. For 703192/703194 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 32441 event pairs, 861 based on Foata normal form. 30/5993 useless extension candidates. Maximal degree in co-relation 57982. Up to 5182 conditions per place. 
[2024-06-14 15:04:50,272 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 244 selfloop transitions, 98 changer transitions 0/345 dead transitions.
[2024-06-14 15:04:50,272 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 345 transitions, 5340 flow
[2024-06-14 15:04:50,273 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:04:50,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:04:50,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-14 15:04:50,273 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-14 15:04:50,273 INFO  L175             Difference]: Start difference. First operand has 228 places, 297 transitions, 4112 flow. Second operand 10 states and 192 transitions.
[2024-06-14 15:04:50,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 345 transitions, 5340 flow
[2024-06-14 15:04:51,314 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 345 transitions, 5042 flow, removed 90 selfloop flow, removed 6 redundant places.
[2024-06-14 15:04:51,319 INFO  L231             Difference]: Finished difference. Result has 232 places, 299 transitions, 4162 flow
[2024-06-14 15:04:51,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3816, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4162, PETRI_PLACES=232, PETRI_TRANSITIONS=299}
[2024-06-14 15:04:51,319 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 189 predicate places.
[2024-06-14 15:04:51,319 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 299 transitions, 4162 flow
[2024-06-14 15:04:51,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:04:51,320 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:04:51,320 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:04:51,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 15:04:51,320 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:04:51,320 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:04:51,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036112048, now seen corresponding path program 4 times
[2024-06-14 15:04:51,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:04:51,321 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583077279]
[2024-06-14 15:04:51,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:04:51,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:04:51,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:02,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:02,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:02,996 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583077279]
[2024-06-14 15:05:02,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583077279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:02,996 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:02,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:05:02,996 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951306694]
[2024-06-14 15:05:02,996 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:02,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:05:02,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:02,997 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:05:02,997 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:05:03,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:03,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 299 transitions, 4162 flow. Second operand  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:03,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:03,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:03,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:05,856 INFO  L124   PetriNetUnfolderBase]: 3926/5948 cut-off events.
[2024-06-14 15:05:05,857 INFO  L125   PetriNetUnfolderBase]: For 657117/657121 co-relation queries the response was YES.
[2024-06-14 15:05:05,898 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57836 conditions, 5948 events. 3926/5948 cut-off events. For 657117/657121 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 32328 event pairs, 857 based on Foata normal form. 10/5958 useless extension candidates. Maximal degree in co-relation 57722. Up to 5408 conditions per place. 
[2024-06-14 15:05:05,928 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 259 selfloop transitions, 79 changer transitions 0/341 dead transitions.
[2024-06-14 15:05:05,928 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 341 transitions, 5320 flow
[2024-06-14 15:05:05,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:05:05,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:05:05,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-14 15:05:05,929 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2024-06-14 15:05:05,929 INFO  L175             Difference]: Start difference. First operand has 232 places, 299 transitions, 4162 flow. Second operand 10 states and 188 transitions.
[2024-06-14 15:05:05,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 341 transitions, 5320 flow
[2024-06-14 15:05:06,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 341 transitions, 4928 flow, removed 100 selfloop flow, removed 8 redundant places.
[2024-06-14 15:05:06,674 INFO  L231             Difference]: Finished difference. Result has 234 places, 299 transitions, 3936 flow
[2024-06-14 15:05:06,674 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3770, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3936, PETRI_PLACES=234, PETRI_TRANSITIONS=299}
[2024-06-14 15:05:06,675 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 191 predicate places.
[2024-06-14 15:05:06,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 299 transitions, 3936 flow
[2024-06-14 15:05:06,675 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:06,675 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:06,675 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:06,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 15:05:06,675 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:06,676 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:06,676 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036118000, now seen corresponding path program 8 times
[2024-06-14 15:05:06,676 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:06,676 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647816757]
[2024-06-14 15:05:06,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:06,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:06,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:05:16,637 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:05:16,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:05:16,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647816757]
[2024-06-14 15:05:16,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647816757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:05:16,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:05:16,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-14 15:05:16,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202235863]
[2024-06-14 15:05:16,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:05:16,638 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-14 15:05:16,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:05:16,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-14 15:05:16,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-06-14 15:05:16,830 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-14 15:05:16,830 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 299 transitions, 3936 flow. Second operand  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:16,830 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:05:16,830 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-14 15:05:16,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:05:19,594 INFO  L124   PetriNetUnfolderBase]: 4050/6153 cut-off events.
[2024-06-14 15:05:19,594 INFO  L125   PetriNetUnfolderBase]: For 717366/717368 co-relation queries the response was YES.
[2024-06-14 15:05:19,641 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59047 conditions, 6153 events. 4050/6153 cut-off events. For 717366/717368 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33809 event pairs, 915 based on Foata normal form. 30/6183 useless extension candidates. Maximal degree in co-relation 58932. Up to 5372 conditions per place. 
[2024-06-14 15:05:19,672 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 252 selfloop transitions, 93 changer transitions 0/348 dead transitions.
[2024-06-14 15:05:19,672 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 348 transitions, 5308 flow
[2024-06-14 15:05:19,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-14 15:05:19,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-14 15:05:19,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-14 15:05:19,675 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4595238095238095
[2024-06-14 15:05:19,675 INFO  L175             Difference]: Start difference. First operand has 234 places, 299 transitions, 3936 flow. Second operand 10 states and 193 transitions.
[2024-06-14 15:05:19,675 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 348 transitions, 5308 flow
[2024-06-14 15:05:20,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 348 transitions, 5135 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-14 15:05:20,486 INFO  L231             Difference]: Finished difference. Result has 236 places, 301 transitions, 4103 flow
[2024-06-14 15:05:20,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=3763, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4103, PETRI_PLACES=236, PETRI_TRANSITIONS=301}
[2024-06-14 15:05:20,487 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 193 predicate places.
[2024-06-14 15:05:20,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 301 transitions, 4103 flow
[2024-06-14 15:05:20,487 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:05:20,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:05:20,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:05:20,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 15:05:20,488 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:05:20,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:05:20,488 INFO  L85        PathProgramCache]: Analyzing trace with hash -1036262150, now seen corresponding path program 9 times
[2024-06-14 15:05:20,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:05:20,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688614408]
[2024-06-14 15:05:20,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:05:20,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:05:20,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15