./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.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/mix006_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
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/mix006_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix006_power.oepc_pso.oepc_rmo.oepc.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-76401ed-m
[2024-06-20 18:21:57,859 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 18:21:57,920 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 18:21:57,927 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 18:21:57,928 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 18:21:57,958 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 18:21:57,959 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 18:21:57,959 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 18:21:57,960 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 18:21:57,964 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 18:21:57,964 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 18:21:57,964 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 18:21:57,965 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 18:21:57,967 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 18:21:57,967 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 18:21:57,967 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 18:21:57,968 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 18:21:57,968 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 18:21:57,968 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 18:21:57,968 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 18:21:57,969 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 18:21:57,969 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 18:21:57,970 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 18:21:57,970 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 18:21:57,970 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 18:21:57,970 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 18:21:57,971 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 18:21:57,971 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 18:21:57,972 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 18:21:57,972 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 18:21:57,973 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 18:21:57,973 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 18:21:57,973 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:21:57,974 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 18:21:57,974 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 18:21:57,974 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 18:21:57,974 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 18:21:57,975 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 18:21:57,975 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 18:21:57,975 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 18:21:57,975 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 18:21:57,976 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 18:21:57,976 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 18:21:57,976 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-20 18:21:58,226 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 18:21:58,244 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 18:21:58,246 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 18:21:58,247 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 18:21:58,248 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 18:21:58,249 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/mix006_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-20 18:21:58,471 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 18:21:58,471 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 18:21:58,472 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:21:59,581 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 18:21:59,820 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 18:21:59,821 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:21:59,835 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c044406c/9e2c4baa36664233907c913e889ef6bb/FLAG55ea43b41
[2024-06-20 18:21:59,847 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c044406c/9e2c4baa36664233907c913e889ef6bb
[2024-06-20 18:21:59,847 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 18:21:59,848 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 18:21:59,849 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 18:21:59,850 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 18:21:59,854 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 18:21:59,855 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:21:58" (1/2) ...
[2024-06-20 18:21:59,855 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7707bc91 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:21:59, skipping insertion in model container
[2024-06-20 18:21:59,856 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:21:58" (1/2) ...
[2024-06-20 18:21:59,857 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@131f2a38 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:21:59, skipping insertion in model container
[2024-06-20 18:21:59,857 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:21:59" (2/2) ...
[2024-06-20 18:21:59,857 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7707bc91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:21:59, skipping insertion in model container
[2024-06-20 18:21:59,858 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:21:59" (2/2) ...
[2024-06-20 18:21:59,858 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 18:21:59,984 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 18:22:00,010 INFO  L97    edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)
[2024-06-20 18:22:00,011 INFO  L97    edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)
[2024-06-20 18:22:00,012 INFO  L97    edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 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_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (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_p1_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (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_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 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_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && y <= 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_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (y == 0 || y == 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_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)
[2024-06-20 18:22:00,012 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 18:22:00,013 INFO  L106   edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1;
[2024-06-20 18:22:00,074 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 18:22:00,523 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:22:00,537 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 18:22:00,894 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:22:00,942 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 18:22:00,943 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00 WrapperNode
[2024-06-20 18:22:00,943 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 18:22:00,945 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 18:22:00,945 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 18:22:00,945 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 18:22:00,951 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,002 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,210 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127
[2024-06-20 18:22:01,211 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 18:22:01,212 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 18:22:01,212 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 18:22:01,212 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 18:22:01,223 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,223 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,266 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,307 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-20 18:22:01,307 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,308 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,362 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,365 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,377 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,382 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,402 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 18:22:01,403 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 18:22:01,404 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 18:22:01,404 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 18:22:01,404 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (1/1) ...
[2024-06-20 18:22:01,409 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:22:01,417 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 18:22:01,431 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-20 18:22:01,453 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-20 18:22:01,465 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 18:22:01,466 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 18:22:01,466 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 18:22:01,466 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 18:22:01,466 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 18:22:01,466 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 18:22:01,467 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 18:22:01,467 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 18:22:01,467 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 18:22:01,467 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 18:22:01,467 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 18:22:01,467 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 18:22:01,468 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 18:22:01,661 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 18:22:01,663 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 18:22:03,297 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 18:22:03,298 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 18:22:03,703 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 18:22:03,703 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 18:22:03,703 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:22:03 BoogieIcfgContainer
[2024-06-20 18:22:03,703 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 18:22:03,706 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 18:22:03,706 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 18:22:03,709 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 18:22:03,710 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:21:58" (1/4) ...
[2024-06-20 18:22:03,710 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d5a44 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:22:03, skipping insertion in model container
[2024-06-20 18:22:03,710 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:21:59" (2/4) ...
[2024-06-20 18:22:03,711 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d5a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:22:03, skipping insertion in model container
[2024-06-20 18:22:03,711 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:22:00" (3/4) ...
[2024-06-20 18:22:03,712 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a5d5a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:22:03, skipping insertion in model container
[2024-06-20 18:22:03,712 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:22:03" (4/4) ...
[2024-06-20 18:22:03,713 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:22:03,730 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 18:22:03,730 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 18:22:03,730 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 18:22:03,868 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 18:22:03,907 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 18:22:03,999 INFO  L124   PetriNetUnfolderBase]: 0/39 cut-off events.
[2024-06-20 18:22:03,999 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:22:04,002 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 71 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-20 18:22:04,003 INFO  L82        GeneralOperation]: Start removeDead. Operand has 52 places, 42 transitions, 96 flow
[2024-06-20 18:22:04,006 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 43 places, 33 transitions, 75 flow
[2024-06-20 18:22:04,021 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 18:22:04,029 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;@5c4fb78c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 18:22:04,029 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 18:22:04,039 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 18:22:04,039 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-20 18:22:04,039 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:22:04,040 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:04,040 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 18:22:04,041 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-20 18:22:04,049 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:04,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 377005305, now seen corresponding path program 1 times
[2024-06-20 18:22:04,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:04,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396955466]
[2024-06-20 18:22:04,060 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:04,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:04,526 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:22:12,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:22:12,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:22:12,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396955466]
[2024-06-20 18:22:12,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396955466] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:22:12,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:22:12,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 18:22:12,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595170757]
[2024-06-20 18:22:12,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:22:12,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 18:22:12,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:22:12,493 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 18:22:12,494 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 18:22:12,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 18:22:12,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 75 flow. Second operand  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:12,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:22:12,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 18:22:12,597 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:22:14,118 INFO  L124   PetriNetUnfolderBase]: 1363/2135 cut-off events.
[2024-06-20 18:22:14,118 INFO  L125   PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES.
[2024-06-20 18:22:14,128 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 2135 events. 1363/2135 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10695 event pairs, 964 based on Foata normal form. 1/2073 useless extension candidates. Maximal degree in co-relation 4247. Up to 2037 conditions per place. 
[2024-06-20 18:22:14,142 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 32 selfloop transitions, 4 changer transitions 0/43 dead transitions.
[2024-06-20 18:22:14,143 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 173 flow
[2024-06-20 18:22:14,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 18:22:14,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 18:22:14,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2024-06-20 18:22:14,156 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6190476190476191
[2024-06-20 18:22:14,158 INFO  L175             Difference]: Start difference. First operand has 43 places, 33 transitions, 75 flow. Second operand 3 states and 78 transitions.
[2024-06-20 18:22:14,159 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 173 flow
[2024-06-20 18:22:14,161 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 18:22:14,163 INFO  L231             Difference]: Finished difference. Result has 43 places, 36 transitions, 102 flow
[2024-06-20 18:22:14,165 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-20 18:22:14,168 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places.
[2024-06-20 18:22:14,168 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 102 flow
[2024-06-20 18:22:14,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:14,169 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:14,169 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:22:14,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 18:22:14,169 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-20 18:22:14,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:14,170 INFO  L85        PathProgramCache]: Analyzing trace with hash 1524958002, now seen corresponding path program 1 times
[2024-06-20 18:22:14,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:14,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447734076]
[2024-06-20 18:22:14,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:14,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:14,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:22:20,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:22:20,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:22:20,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447734076]
[2024-06-20 18:22:20,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447734076] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:22:20,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:22:20,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 18:22:20,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790043920]
[2024-06-20 18:22:20,667 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:22:20,668 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 18:22:20,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:22:20,669 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 18:22:20,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 18:22:20,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42
[2024-06-20 18:22:20,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 102 flow. Second operand  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:20,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:22:20,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42
[2024-06-20 18:22:20,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:22:21,926 INFO  L124   PetriNetUnfolderBase]: 1357/2136 cut-off events.
[2024-06-20 18:22:21,927 INFO  L125   PetriNetUnfolderBase]: For 410/410 co-relation queries the response was YES.
[2024-06-20 18:22:21,933 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 2136 events. 1357/2136 cut-off events. For 410/410 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 10701 event pairs, 840 based on Foata normal form. 3/2115 useless extension candidates. Maximal degree in co-relation 4791. Up to 2013 conditions per place. 
[2024-06-20 18:22:21,944 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 39 selfloop transitions, 7 changer transitions 0/53 dead transitions.
[2024-06-20 18:22:21,944 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 240 flow
[2024-06-20 18:22:21,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 18:22:21,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 18:22:21,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions.
[2024-06-20 18:22:21,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6011904761904762
[2024-06-20 18:22:21,948 INFO  L175             Difference]: Start difference. First operand has 43 places, 36 transitions, 102 flow. Second operand 4 states and 101 transitions.
[2024-06-20 18:22:21,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 240 flow
[2024-06-20 18:22:21,949 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 18:22:21,952 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 138 flow
[2024-06-20 18:22:21,952 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-20 18:22:21,953 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places.
[2024-06-20 18:22:21,954 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 138 flow
[2024-06-20 18:22:21,954 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:21,954 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:21,955 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:22:21,957 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 18:22:21,957 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-20 18:22:21,958 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:21,959 INFO  L85        PathProgramCache]: Analyzing trace with hash 29058688, now seen corresponding path program 1 times
[2024-06-20 18:22:21,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:21,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63293877]
[2024-06-20 18:22:21,965 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:21,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:22,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:22:27,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:22:27,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:22:27,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63293877]
[2024-06-20 18:22:27,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63293877] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:22:27,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:22:27,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 18:22:27,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495814828]
[2024-06-20 18:22:27,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:22:27,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 18:22:27,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:22:27,393 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 18:22:27,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 18:22:27,588 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 18:22:27,588 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 138 flow. Second operand  has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:27,588 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:22:27,588 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 18:22:27,589 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:22:28,900 INFO  L124   PetriNetUnfolderBase]: 1661/2580 cut-off events.
[2024-06-20 18:22:28,900 INFO  L125   PetriNetUnfolderBase]: For 1329/1329 co-relation queries the response was YES.
[2024-06-20 18:22:28,904 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 2580 events. 1661/2580 cut-off events. For 1329/1329 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12701 event pairs, 812 based on Foata normal form. 5/2585 useless extension candidates. Maximal degree in co-relation 6392. Up to 2387 conditions per place. 
[2024-06-20 18:22:28,915 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 53 selfloop transitions, 16 changer transitions 0/75 dead transitions.
[2024-06-20 18:22:28,916 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 396 flow
[2024-06-20 18:22:28,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:22:28,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:22:28,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions.
[2024-06-20 18:22:28,919 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6095238095238096
[2024-06-20 18:22:28,919 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 138 flow. Second operand 5 states and 128 transitions.
[2024-06-20 18:22:28,919 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 396 flow
[2024-06-20 18:22:28,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 382 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 18:22:28,922 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 237 flow
[2024-06-20 18:22:28,923 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=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2024-06-20 18:22:28,924 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 8 predicate places.
[2024-06-20 18:22:28,924 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 237 flow
[2024-06-20 18:22:28,924 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:28,924 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:28,925 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:22:28,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 18:22:28,925 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-20 18:22:28,925 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:28,926 INFO  L85        PathProgramCache]: Analyzing trace with hash 817703351, now seen corresponding path program 1 times
[2024-06-20 18:22:28,926 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:28,926 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074794467]
[2024-06-20 18:22:28,926 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:28,927 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:28,997 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:22:34,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:22:34,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:22:34,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074794467]
[2024-06-20 18:22:34,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074794467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:22:34,719 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:22:34,720 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:22:34,720 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833343211]
[2024-06-20 18:22:34,720 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:22:34,721 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:22:34,721 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:22:34,722 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:22:34,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:22:34,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 18:22:34,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 237 flow. Second operand  has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:34,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:22:34,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 18:22:34,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:22:36,319 INFO  L124   PetriNetUnfolderBase]: 1669/2592 cut-off events.
[2024-06-20 18:22:36,319 INFO  L125   PetriNetUnfolderBase]: For 3080/3082 co-relation queries the response was YES.
[2024-06-20 18:22:36,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7525 conditions, 2592 events. 1669/2592 cut-off events. For 3080/3082 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12792 event pairs, 666 based on Foata normal form. 7/2599 useless extension candidates. Maximal degree in co-relation 7508. Up to 2373 conditions per place. 
[2024-06-20 18:22:36,338 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 60 selfloop transitions, 20 changer transitions 0/86 dead transitions.
[2024-06-20 18:22:36,338 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 86 transitions, 523 flow
[2024-06-20 18:22:36,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:22:36,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:22:36,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions.
[2024-06-20 18:22:36,340 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5992063492063492
[2024-06-20 18:22:36,340 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 237 flow. Second operand 6 states and 151 transitions.
[2024-06-20 18:22:36,340 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 86 transitions, 523 flow
[2024-06-20 18:22:36,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 515 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-20 18:22:36,346 INFO  L231             Difference]: Finished difference. Result has 57 places, 54 transitions, 310 flow
[2024-06-20 18:22:36,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=57, PETRI_TRANSITIONS=54}
[2024-06-20 18:22:36,347 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places.
[2024-06-20 18:22:36,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 310 flow
[2024-06-20 18:22:36,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:36,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:36,348 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:22:36,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 18:22:36,348 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:22:36,349 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:36,349 INFO  L85        PathProgramCache]: Analyzing trace with hash -2139342657, now seen corresponding path program 1 times
[2024-06-20 18:22:36,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:36,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099090534]
[2024-06-20 18:22:36,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:36,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:36,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:22:42,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:22:42,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:22:42,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099090534]
[2024-06-20 18:22:42,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099090534] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:22:42,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:22:42,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:22:42,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588863662]
[2024-06-20 18:22:42,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:22:42,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:22:42,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:22:42,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:22:42,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:22:42,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 42
[2024-06-20 18:22:42,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 310 flow. Second operand  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:42,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:22:42,780 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 42
[2024-06-20 18:22:42,780 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:22:44,238 INFO  L124   PetriNetUnfolderBase]: 1681/2612 cut-off events.
[2024-06-20 18:22:44,238 INFO  L125   PetriNetUnfolderBase]: For 4855/4857 co-relation queries the response was YES.
[2024-06-20 18:22:44,242 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8396 conditions, 2612 events. 1681/2612 cut-off events. For 4855/4857 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12888 event pairs, 502 based on Foata normal form. 12/2624 useless extension candidates. Maximal degree in co-relation 8376. Up to 2341 conditions per place. 
[2024-06-20 18:22:44,253 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 64 selfloop transitions, 23 changer transitions 0/93 dead transitions.
[2024-06-20 18:22:44,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 93 transitions, 624 flow
[2024-06-20 18:22:44,254 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:22:44,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:22:44,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions.
[2024-06-20 18:22:44,255 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5782312925170068
[2024-06-20 18:22:44,256 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 310 flow. Second operand 7 states and 170 transitions.
[2024-06-20 18:22:44,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 93 transitions, 624 flow
[2024-06-20 18:22:44,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 575 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 18:22:44,261 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 337 flow
[2024-06-20 18:22:44,261 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-20 18:22:44,262 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-20 18:22:44,262 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 337 flow
[2024-06-20 18:22:44,263 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:22:44,263 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:44,263 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:22:44,263 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 18:22:44,263 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-20 18:22:44,263 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:44,264 INFO  L85        PathProgramCache]: Analyzing trace with hash -799520460, now seen corresponding path program 1 times
[2024-06-20 18:22:44,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:44,264 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513863905]
[2024-06-20 18:22:44,264 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:44,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:44,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:22:55,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:22:55,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:22:55,776 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513863905]
[2024-06-20 18:22:55,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513863905] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:22:55,777 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:22:55,777 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:22:55,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981026860]
[2024-06-20 18:22:55,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:22:55,777 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:22:55,777 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:22:55,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:22:55,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:22:55,925 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:22:55,925 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 337 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-20 18:22:55,925 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:22:55,925 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:22:55,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:22:57,058 INFO  L124   PetriNetUnfolderBase]: 1676/2600 cut-off events.
[2024-06-20 18:22:57,058 INFO  L125   PetriNetUnfolderBase]: For 6554/6554 co-relation queries the response was YES.
[2024-06-20 18:22:57,062 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8918 conditions, 2600 events. 1676/2600 cut-off events. For 6554/6554 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12779 event pairs, 659 based on Foata normal form. 2/2602 useless extension candidates. Maximal degree in co-relation 8896. Up to 2484 conditions per place. 
[2024-06-20 18:22:57,081 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 54 selfloop transitions, 8 changer transitions 0/67 dead transitions.
[2024-06-20 18:22:57,081 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 489 flow
[2024-06-20 18:22:57,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:22:57,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:22:57,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions.
[2024-06-20 18:22:57,082 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-20 18:22:57,083 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 337 flow. Second operand 5 states and 96 transitions.
[2024-06-20 18:22:57,083 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 489 flow
[2024-06-20 18:22:57,087 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 425 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 18:22:57,089 INFO  L231             Difference]: Finished difference. Result has 59 places, 56 transitions, 297 flow
[2024-06-20 18:22:57,090 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=59, PETRI_TRANSITIONS=56}
[2024-06-20 18:22:57,092 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 16 predicate places.
[2024-06-20 18:22:57,093 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 297 flow
[2024-06-20 18:22:57,093 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-20 18:22:57,093 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:22:57,093 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:22:57,093 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 18:22:57,093 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-20 18:22:57,094 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:22:57,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 956042634, now seen corresponding path program 1 times
[2024-06-20 18:22:57,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:22:57,095 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561149433]
[2024-06-20 18:22:57,095 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:22:57,095 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:22:57,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:23:08,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:23:08,187 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:23:08,187 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561149433]
[2024-06-20 18:23:08,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561149433] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:23:08,187 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:23:08,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:23:08,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043679697]
[2024-06-20 18:23:08,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:23:08,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:23:08,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:23:08,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:23:08,188 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:23:08,323 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:23:08,323 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 297 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-20 18:23:08,323 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:23:08,323 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:23:08,323 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:23:09,557 INFO  L124   PetriNetUnfolderBase]: 1666/2623 cut-off events.
[2024-06-20 18:23:09,557 INFO  L125   PetriNetUnfolderBase]: For 7722/7722 co-relation queries the response was YES.
[2024-06-20 18:23:09,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8905 conditions, 2623 events. 1666/2623 cut-off events. For 7722/7722 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13058 event pairs, 623 based on Foata normal form. 4/2627 useless extension candidates. Maximal degree in co-relation 8881. Up to 2452 conditions per place. 
[2024-06-20 18:23:09,570 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 59 selfloop transitions, 11 changer transitions 0/75 dead transitions.
[2024-06-20 18:23:09,570 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 75 transitions, 497 flow
[2024-06-20 18:23:09,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:23:09,571 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:23:09,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions.
[2024-06-20 18:23:09,571 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 18:23:09,571 INFO  L175             Difference]: Start difference. First operand has 59 places, 56 transitions, 297 flow. Second operand 6 states and 114 transitions.
[2024-06-20 18:23:09,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 75 transitions, 497 flow
[2024-06-20 18:23:09,574 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 75 transitions, 475 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 18:23:09,576 INFO  L231             Difference]: Finished difference. Result has 61 places, 59 transitions, 331 flow
[2024-06-20 18:23:09,576 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=61, PETRI_TRANSITIONS=59}
[2024-06-20 18:23:09,576 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 18 predicate places.
[2024-06-20 18:23:09,577 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 331 flow
[2024-06-20 18:23:09,577 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-20 18:23:09,577 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:23:09,577 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:23:09,577 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 18:23:09,577 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-20 18:23:09,578 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:23:09,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -433169935, now seen corresponding path program 1 times
[2024-06-20 18:23:09,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:23:09,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315858715]
[2024-06-20 18:23:09,578 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:23:09,578 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:23:09,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:23:19,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-20 18:23:19,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:23:19,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315858715]
[2024-06-20 18:23:19,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315858715] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:23:19,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:23:19,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:23:19,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950647002]
[2024-06-20 18:23:19,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:23:19,153 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:23:19,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:23:19,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:23:19,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:23:19,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:23:19,305 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 331 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-20 18:23:19,305 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:23:19,305 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:23:19,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:23:20,378 INFO  L124   PetriNetUnfolderBase]: 1672/2628 cut-off events.
[2024-06-20 18:23:20,378 INFO  L125   PetriNetUnfolderBase]: For 9597/9601 co-relation queries the response was YES.
[2024-06-20 18:23:20,381 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9502 conditions, 2628 events. 1672/2628 cut-off events. For 9597/9601 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13108 event pairs, 636 based on Foata normal form. 8/2636 useless extension candidates. Maximal degree in co-relation 9478. Up to 2404 conditions per place. 
[2024-06-20 18:23:20,387 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 58 selfloop transitions, 19 changer transitions 0/82 dead transitions.
[2024-06-20 18:23:20,387 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 585 flow
[2024-06-20 18:23:20,388 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:23:20,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:23:20,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-20 18:23:20,389 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48412698412698413
[2024-06-20 18:23:20,390 INFO  L175             Difference]: Start difference. First operand has 61 places, 59 transitions, 331 flow. Second operand 6 states and 122 transitions.
[2024-06-20 18:23:20,390 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 585 flow
[2024-06-20 18:23:20,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 553 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 18:23:20,396 INFO  L231             Difference]: Finished difference. Result has 63 places, 62 transitions, 371 flow
[2024-06-20 18:23:20,396 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=371, PETRI_PLACES=63, PETRI_TRANSITIONS=62}
[2024-06-20 18:23:20,397 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 20 predicate places.
[2024-06-20 18:23:20,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 371 flow
[2024-06-20 18:23:20,397 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-20 18:23:20,397 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:23:20,397 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:23:20,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 18:23:20,398 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-20 18:23:20,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:23:20,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 1614720727, now seen corresponding path program 2 times
[2024-06-20 18:23:20,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:23:20,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405934414]
[2024-06-20 18:23:20,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:23:20,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:23:20,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:23:29,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:23:29,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:23:29,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405934414]
[2024-06-20 18:23:29,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405934414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:23:29,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:23:29,962 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:23:29,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636389710]
[2024-06-20 18:23:29,962 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:23:29,962 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:23:29,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:23:29,963 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:23:29,963 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:23:30,143 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:23:30,143 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 371 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-20 18:23:30,143 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:23:30,143 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:23:30,143 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:23:31,268 INFO  L124   PetriNetUnfolderBase]: 1657/2602 cut-off events.
[2024-06-20 18:23:31,268 INFO  L125   PetriNetUnfolderBase]: For 11066/11066 co-relation queries the response was YES.
[2024-06-20 18:23:31,273 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9664 conditions, 2602 events. 1657/2602 cut-off events. For 11066/11066 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12911 event pairs, 632 based on Foata normal form. 2/2604 useless extension candidates. Maximal degree in co-relation 9639. Up to 2445 conditions per place. 
[2024-06-20 18:23:31,283 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 61 selfloop transitions, 11 changer transitions 0/77 dead transitions.
[2024-06-20 18:23:31,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 77 transitions, 553 flow
[2024-06-20 18:23:31,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:23:31,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:23:31,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions.
[2024-06-20 18:23:31,286 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44841269841269843
[2024-06-20 18:23:31,287 INFO  L175             Difference]: Start difference. First operand has 63 places, 62 transitions, 371 flow. Second operand 6 states and 113 transitions.
[2024-06-20 18:23:31,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 77 transitions, 553 flow
[2024-06-20 18:23:31,295 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 524 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 18:23:31,296 INFO  L231             Difference]: Finished difference. Result has 66 places, 62 transitions, 372 flow
[2024-06-20 18:23:31,296 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=372, PETRI_PLACES=66, PETRI_TRANSITIONS=62}
[2024-06-20 18:23:31,297 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places.
[2024-06-20 18:23:31,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 372 flow
[2024-06-20 18:23:31,298 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-20 18:23:31,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:23:31,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:23:31,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 18:23:31,298 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-20 18:23:31,299 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:23:31,299 INFO  L85        PathProgramCache]: Analyzing trace with hash 1919588069, now seen corresponding path program 1 times
[2024-06-20 18:23:31,299 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:23:31,299 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578368404]
[2024-06-20 18:23:31,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:23:31,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:23:31,355 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:23:41,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:23:41,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:23:41,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578368404]
[2024-06-20 18:23:41,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578368404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:23:41,513 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:23:41,513 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:23:41,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775077633]
[2024-06-20 18:23:41,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:23:41,514 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:23:41,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:23:41,515 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:23:41,515 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:23:41,736 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:23:41,736 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 372 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:23:41,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:23:41,736 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:23:41,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:23:42,837 INFO  L124   PetriNetUnfolderBase]: 1733/2713 cut-off events.
[2024-06-20 18:23:42,837 INFO  L125   PetriNetUnfolderBase]: For 13636/13636 co-relation queries the response was YES.
[2024-06-20 18:23:42,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10300 conditions, 2713 events. 1733/2713 cut-off events. For 13636/13636 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13455 event pairs, 559 based on Foata normal form. 8/2720 useless extension candidates. Maximal degree in co-relation 10274. Up to 2371 conditions per place. 
[2024-06-20 18:23:42,851 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 68 selfloop transitions, 26 changer transitions 0/99 dead transitions.
[2024-06-20 18:23:42,851 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 99 transitions, 726 flow
[2024-06-20 18:23:42,852 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:23:42,852 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:23:42,852 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-20 18:23:42,853 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4897959183673469
[2024-06-20 18:23:42,853 INFO  L175             Difference]: Start difference. First operand has 66 places, 62 transitions, 372 flow. Second operand 7 states and 144 transitions.
[2024-06-20 18:23:42,853 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 99 transitions, 726 flow
[2024-06-20 18:23:42,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 99 transitions, 679 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 18:23:42,863 INFO  L231             Difference]: Finished difference. Result has 68 places, 72 transitions, 468 flow
[2024-06-20 18:23:42,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=468, PETRI_PLACES=68, PETRI_TRANSITIONS=72}
[2024-06-20 18:23:42,864 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 25 predicate places.
[2024-06-20 18:23:42,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 468 flow
[2024-06-20 18:23:42,864 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:23:42,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:23:42,864 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:23:42,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 18:23:42,865 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-20 18:23:42,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:23:42,865 INFO  L85        PathProgramCache]: Analyzing trace with hash 1375890695, now seen corresponding path program 2 times
[2024-06-20 18:23:42,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:23:42,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478459422]
[2024-06-20 18:23:42,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:23:42,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:23:42,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:23:52,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:23:52,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:23:52,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478459422]
[2024-06-20 18:23:52,414 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478459422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:23:52,414 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:23:52,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:23:52,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748269710]
[2024-06-20 18:23:52,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:23:52,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:23:52,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:23:52,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:23:52,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:23:52,620 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:23:52,620 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 468 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:23:52,620 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:23:52,620 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:23:52,620 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:23:54,014 INFO  L124   PetriNetUnfolderBase]: 1750/2738 cut-off events.
[2024-06-20 18:23:54,014 INFO  L125   PetriNetUnfolderBase]: For 16745/16745 co-relation queries the response was YES.
[2024-06-20 18:23:54,018 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11345 conditions, 2738 events. 1750/2738 cut-off events. For 16745/16745 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13662 event pairs, 584 based on Foata normal form. 6/2744 useless extension candidates. Maximal degree in co-relation 11317. Up to 2544 conditions per place. 
[2024-06-20 18:23:54,029 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 74 selfloop transitions, 18 changer transitions 0/97 dead transitions.
[2024-06-20 18:23:54,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 756 flow
[2024-06-20 18:23:54,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:23:54,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:23:54,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-20 18:23:54,031 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4489795918367347
[2024-06-20 18:23:54,031 INFO  L175             Difference]: Start difference. First operand has 68 places, 72 transitions, 468 flow. Second operand 7 states and 132 transitions.
[2024-06-20 18:23:54,031 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 756 flow
[2024-06-20 18:23:54,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 728 flow, removed 10 selfloop flow, removed 2 redundant places.
[2024-06-20 18:23:54,046 INFO  L231             Difference]: Finished difference. Result has 73 places, 77 transitions, 549 flow
[2024-06-20 18:23:54,046 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=549, PETRI_PLACES=73, PETRI_TRANSITIONS=77}
[2024-06-20 18:23:54,047 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 30 predicate places.
[2024-06-20 18:23:54,047 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 77 transitions, 549 flow
[2024-06-20 18:23:54,047 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:23:54,047 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:23:54,047 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:23:54,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 18:23:54,048 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-20 18:23:54,048 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:23:54,048 INFO  L85        PathProgramCache]: Analyzing trace with hash 489073385, now seen corresponding path program 3 times
[2024-06-20 18:23:54,048 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:23:54,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806437402]
[2024-06-20 18:23:54,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:23:54,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:23:54,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:24:04,246 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:24:04,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:24:04,247 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806437402]
[2024-06-20 18:24:04,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806437402] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:24:04,247 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:24:04,247 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:24:04,248 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438955677]
[2024-06-20 18:24:04,248 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:24:04,248 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:24:04,248 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:24:04,249 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:24:04,249 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:24:04,433 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:24:04,433 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 77 transitions, 549 flow. Second operand  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:04,433 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:24:04,433 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:24:04,433 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:24:05,618 INFO  L124   PetriNetUnfolderBase]: 1740/2729 cut-off events.
[2024-06-20 18:24:05,618 INFO  L125   PetriNetUnfolderBase]: For 19859/19859 co-relation queries the response was YES.
[2024-06-20 18:24:05,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11811 conditions, 2729 events. 1740/2729 cut-off events. For 19859/19859 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13597 event pairs, 577 based on Foata normal form. 4/2733 useless extension candidates. Maximal degree in co-relation 11780. Up to 2521 conditions per place. 
[2024-06-20 18:24:05,634 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 78 selfloop transitions, 19 changer transitions 0/102 dead transitions.
[2024-06-20 18:24:05,634 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 846 flow
[2024-06-20 18:24:05,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:24:05,635 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:24:05,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-20 18:24:05,636 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4557823129251701
[2024-06-20 18:24:05,636 INFO  L175             Difference]: Start difference. First operand has 73 places, 77 transitions, 549 flow. Second operand 7 states and 134 transitions.
[2024-06-20 18:24:05,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 846 flow
[2024-06-20 18:24:05,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 776 flow, removed 20 selfloop flow, removed 5 redundant places.
[2024-06-20 18:24:05,654 INFO  L231             Difference]: Finished difference. Result has 76 places, 81 transitions, 588 flow
[2024-06-20 18:24:05,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=588, PETRI_PLACES=76, PETRI_TRANSITIONS=81}
[2024-06-20 18:24:05,656 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 33 predicate places.
[2024-06-20 18:24:05,656 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 81 transitions, 588 flow
[2024-06-20 18:24:05,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:05,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:24:05,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:24:05,657 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 18:24:05,657 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:24:05,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:24:05,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -1153240174, now seen corresponding path program 1 times
[2024-06-20 18:24:05,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:24:05,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721063623]
[2024-06-20 18:24:05,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:24:05,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:24:05,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:24:20,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:24:20,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:24:20,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721063623]
[2024-06-20 18:24:20,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721063623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:24:20,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:24:20,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:24:20,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36068363]
[2024-06-20 18:24:20,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:24:20,466 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:24:20,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:24:20,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:24:20,467 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:24:20,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:24:20,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 81 transitions, 588 flow. Second operand  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:20,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:24:20,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:24:20,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:24:22,184 INFO  L124   PetriNetUnfolderBase]: 2227/3351 cut-off events.
[2024-06-20 18:24:22,184 INFO  L125   PetriNetUnfolderBase]: For 30074/30074 co-relation queries the response was YES.
[2024-06-20 18:24:22,190 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14987 conditions, 3351 events. 2227/3351 cut-off events. For 30074/30074 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 15998 event pairs, 810 based on Foata normal form. 1/3352 useless extension candidates. Maximal degree in co-relation 14954. Up to 3256 conditions per place. 
[2024-06-20 18:24:22,200 INFO  L140   encePairwiseOnDemand]: 35/42 looper letters, 74 selfloop transitions, 8 changer transitions 0/92 dead transitions.
[2024-06-20 18:24:22,200 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 92 transitions, 794 flow
[2024-06-20 18:24:22,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:24:22,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:24:22,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions.
[2024-06-20 18:24:22,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41904761904761906
[2024-06-20 18:24:22,202 INFO  L175             Difference]: Start difference. First operand has 76 places, 81 transitions, 588 flow. Second operand 5 states and 88 transitions.
[2024-06-20 18:24:22,202 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 92 transitions, 794 flow
[2024-06-20 18:24:22,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 740 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-20 18:24:22,224 INFO  L231             Difference]: Finished difference. Result has 77 places, 84 transitions, 584 flow
[2024-06-20 18:24:22,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=584, PETRI_PLACES=77, PETRI_TRANSITIONS=84}
[2024-06-20 18:24:22,225 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places.
[2024-06-20 18:24:22,225 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 584 flow
[2024-06-20 18:24:22,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:22,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:24:22,226 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:24:22,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 18:24:22,226 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-20 18:24:22,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:24:22,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 335408242, now seen corresponding path program 1 times
[2024-06-20 18:24:22,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:24:22,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448293271]
[2024-06-20 18:24:22,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:24:22,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:24:22,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:24:33,162 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:24:33,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:24:33,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448293271]
[2024-06-20 18:24:33,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448293271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:24:33,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:24:33,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:24:33,162 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685954401]
[2024-06-20 18:24:33,162 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:24:33,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:24:33,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:24:33,163 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:24:33,163 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:24:33,432 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:24:33,433 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 584 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:33,433 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:24:33,434 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:24:33,434 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:24:34,660 INFO  L124   PetriNetUnfolderBase]: 1841/2850 cut-off events.
[2024-06-20 18:24:34,661 INFO  L125   PetriNetUnfolderBase]: For 29410/29412 co-relation queries the response was YES.
[2024-06-20 18:24:34,666 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13467 conditions, 2850 events. 1841/2850 cut-off events. For 29410/29412 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14193 event pairs, 601 based on Foata normal form. 4/2854 useless extension candidates. Maximal degree in co-relation 13434. Up to 2566 conditions per place. 
[2024-06-20 18:24:34,673 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 85 selfloop transitions, 26 changer transitions 0/117 dead transitions.
[2024-06-20 18:24:34,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 984 flow
[2024-06-20 18:24:34,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:24:34,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:24:34,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions.
[2024-06-20 18:24:34,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48299319727891155
[2024-06-20 18:24:34,677 INFO  L175             Difference]: Start difference. First operand has 77 places, 84 transitions, 584 flow. Second operand 7 states and 142 transitions.
[2024-06-20 18:24:34,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 984 flow
[2024-06-20 18:24:34,689 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 117 transitions, 956 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-20 18:24:34,691 INFO  L231             Difference]: Finished difference. Result has 81 places, 90 transitions, 682 flow
[2024-06-20 18:24:34,692 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=682, PETRI_PLACES=81, PETRI_TRANSITIONS=90}
[2024-06-20 18:24:34,692 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places.
[2024-06-20 18:24:34,692 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 90 transitions, 682 flow
[2024-06-20 18:24:34,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:34,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:24:34,693 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:24:34,693 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 18:24:34,693 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-20 18:24:34,694 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:24:34,694 INFO  L85        PathProgramCache]: Analyzing trace with hash -626035688, now seen corresponding path program 2 times
[2024-06-20 18:24:34,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:24:34,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904246609]
[2024-06-20 18:24:34,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:24:34,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:24:34,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:24:45,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:24:45,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:24:45,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904246609]
[2024-06-20 18:24:45,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904246609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:24:45,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:24:45,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:24:45,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61963858]
[2024-06-20 18:24:45,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:24:45,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:24:45,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:24:45,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:24:45,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:24:45,818 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:24:45,818 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 90 transitions, 682 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:45,818 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:24:45,818 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:24:45,818 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:24:47,128 INFO  L124   PetriNetUnfolderBase]: 1836/2843 cut-off events.
[2024-06-20 18:24:47,128 INFO  L125   PetriNetUnfolderBase]: For 33670/33672 co-relation queries the response was YES.
[2024-06-20 18:24:47,133 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14065 conditions, 2843 events. 1836/2843 cut-off events. For 33670/33672 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14155 event pairs, 601 based on Foata normal form. 4/2847 useless extension candidates. Maximal degree in co-relation 14031. Up to 2594 conditions per place. 
[2024-06-20 18:24:47,140 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 84 selfloop transitions, 22 changer transitions 0/112 dead transitions.
[2024-06-20 18:24:47,140 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 112 transitions, 950 flow
[2024-06-20 18:24:47,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:24:47,141 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:24:47,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-20 18:24:47,141 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46598639455782315
[2024-06-20 18:24:47,141 INFO  L175             Difference]: Start difference. First operand has 81 places, 90 transitions, 682 flow. Second operand 7 states and 137 transitions.
[2024-06-20 18:24:47,141 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 112 transitions, 950 flow
[2024-06-20 18:24:47,157 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 112 transitions, 889 flow, removed 21 selfloop flow, removed 3 redundant places.
[2024-06-20 18:24:47,158 INFO  L231             Difference]: Finished difference. Result has 85 places, 90 transitions, 673 flow
[2024-06-20 18:24:47,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=673, PETRI_PLACES=85, PETRI_TRANSITIONS=90}
[2024-06-20 18:24:47,159 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places.
[2024-06-20 18:24:47,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 673 flow
[2024-06-20 18:24:47,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:47,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:24:47,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:24:47,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 18:24:47,160 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:24:47,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:24:47,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -622316463, now seen corresponding path program 1 times
[2024-06-20 18:24:47,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:24:47,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11951182]
[2024-06-20 18:24:47,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:24:47,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:24:47,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:24:58,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:24:58,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:24:58,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11951182]
[2024-06-20 18:24:58,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11951182] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:24:58,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:24:58,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:24:58,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784970996]
[2024-06-20 18:24:58,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:24:58,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:24:58,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:24:58,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:24:58,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:24:58,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:24:58,228 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 673 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:58,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:24:58,228 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:24:58,228 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:24:59,633 INFO  L124   PetriNetUnfolderBase]: 1858/2875 cut-off events.
[2024-06-20 18:24:59,633 INFO  L125   PetriNetUnfolderBase]: For 37864/37864 co-relation queries the response was YES.
[2024-06-20 18:24:59,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14515 conditions, 2875 events. 1858/2875 cut-off events. For 37864/37864 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14339 event pairs, 575 based on Foata normal form. 4/2878 useless extension candidates. Maximal degree in co-relation 14479. Up to 2458 conditions per place. 
[2024-06-20 18:24:59,647 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 76 selfloop transitions, 44 changer transitions 0/126 dead transitions.
[2024-06-20 18:24:59,647 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 126 transitions, 1121 flow
[2024-06-20 18:24:59,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:24:59,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:24:59,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions.
[2024-06-20 18:24:59,651 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5068027210884354
[2024-06-20 18:24:59,652 INFO  L175             Difference]: Start difference. First operand has 85 places, 90 transitions, 673 flow. Second operand 7 states and 149 transitions.
[2024-06-20 18:24:59,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 126 transitions, 1121 flow
[2024-06-20 18:24:59,673 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 126 transitions, 1066 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 18:24:59,680 INFO  L231             Difference]: Finished difference. Result has 87 places, 96 transitions, 807 flow
[2024-06-20 18:24:59,680 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=807, PETRI_PLACES=87, PETRI_TRANSITIONS=96}
[2024-06-20 18:24:59,681 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 44 predicate places.
[2024-06-20 18:24:59,683 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 96 transitions, 807 flow
[2024-06-20 18:24:59,685 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:24:59,685 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:24:59,685 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:24:59,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 18:24:59,686 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-20 18:24:59,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:24:59,686 INFO  L85        PathProgramCache]: Analyzing trace with hash -622310883, now seen corresponding path program 2 times
[2024-06-20 18:24:59,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:24:59,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222620025]
[2024-06-20 18:24:59,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:24:59,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:24:59,735 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:25:11,483 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:25:11,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:25:11,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222620025]
[2024-06-20 18:25:11,484 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222620025] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:25:11,484 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:25:11,484 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:25:11,484 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155479234]
[2024-06-20 18:25:11,484 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:25:11,485 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:25:11,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:25:11,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:25:11,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:25:11,733 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:25:11,733 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 96 transitions, 807 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:25:11,733 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:25:11,733 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:25:11,733 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:25:13,245 INFO  L124   PetriNetUnfolderBase]: 1880/2907 cut-off events.
[2024-06-20 18:25:13,246 INFO  L125   PetriNetUnfolderBase]: For 43569/43569 co-relation queries the response was YES.
[2024-06-20 18:25:13,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15458 conditions, 2907 events. 1880/2907 cut-off events. For 43569/43569 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14495 event pairs, 582 based on Foata normal form. 4/2910 useless extension candidates. Maximal degree in co-relation 15420. Up to 2477 conditions per place. 
[2024-06-20 18:25:13,260 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 81 selfloop transitions, 43 changer transitions 0/130 dead transitions.
[2024-06-20 18:25:13,260 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 130 transitions, 1244 flow
[2024-06-20 18:25:13,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:25:13,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:25:13,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 18:25:13,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-06-20 18:25:13,263 INFO  L175             Difference]: Start difference. First operand has 87 places, 96 transitions, 807 flow. Second operand 8 states and 163 transitions.
[2024-06-20 18:25:13,263 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 130 transitions, 1244 flow
[2024-06-20 18:25:13,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 130 transitions, 1150 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-20 18:25:13,291 INFO  L231             Difference]: Finished difference. Result has 91 places, 99 transitions, 852 flow
[2024-06-20 18:25:13,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=91, PETRI_TRANSITIONS=99}
[2024-06-20 18:25:13,291 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places.
[2024-06-20 18:25:13,292 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 99 transitions, 852 flow
[2024-06-20 18:25:13,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:25:13,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:25:13,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:25:13,292 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 18:25:13,293 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-20 18:25:13,293 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:25:13,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -297060293, now seen corresponding path program 3 times
[2024-06-20 18:25:13,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:25:13,293 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640949969]
[2024-06-20 18:25:13,293 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:25:13,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:25:13,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:25:23,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:25:23,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:25:23,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640949969]
[2024-06-20 18:25:23,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640949969] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:25:23,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:25:23,871 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:25:23,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752129263]
[2024-06-20 18:25:23,871 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:25:23,871 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:25:23,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:25:23,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:25:23,872 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:25:24,060 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:25:24,060 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 99 transitions, 852 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:25:24,061 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:25:24,061 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:25:24,061 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:25:25,479 INFO  L124   PetriNetUnfolderBase]: 1902/2938 cut-off events.
[2024-06-20 18:25:25,479 INFO  L125   PetriNetUnfolderBase]: For 47886/47886 co-relation queries the response was YES.
[2024-06-20 18:25:25,486 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15898 conditions, 2938 events. 1902/2938 cut-off events. For 47886/47886 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14678 event pairs, 607 based on Foata normal form. 4/2942 useless extension candidates. Maximal degree in co-relation 15859. Up to 2720 conditions per place. 
[2024-06-20 18:25:25,495 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 104 selfloop transitions, 17 changer transitions 0/127 dead transitions.
[2024-06-20 18:25:25,496 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 1208 flow
[2024-06-20 18:25:25,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:25:25,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:25:25,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-20 18:25:25,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44345238095238093
[2024-06-20 18:25:25,499 INFO  L175             Difference]: Start difference. First operand has 91 places, 99 transitions, 852 flow. Second operand 8 states and 149 transitions.
[2024-06-20 18:25:25,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 1208 flow
[2024-06-20 18:25:25,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 127 transitions, 1125 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-20 18:25:25,526 INFO  L231             Difference]: Finished difference. Result has 94 places, 102 transitions, 865 flow
[2024-06-20 18:25:25,526 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=865, PETRI_PLACES=94, PETRI_TRANSITIONS=102}
[2024-06-20 18:25:25,526 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 51 predicate places.
[2024-06-20 18:25:25,526 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 102 transitions, 865 flow
[2024-06-20 18:25:25,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:25:25,527 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:25:25,527 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:25:25,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 18:25:25,527 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-20 18:25:25,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:25:25,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 1531671671, now seen corresponding path program 4 times
[2024-06-20 18:25:25,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:25:25,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65466486]
[2024-06-20 18:25:25,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:25:25,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:25:25,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:25:36,330 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:25:36,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:25:36,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65466486]
[2024-06-20 18:25:36,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65466486] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:25:36,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:25:36,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:25:36,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144439672]
[2024-06-20 18:25:36,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:25:36,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:25:36,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:25:36,332 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:25:36,332 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:25:36,570 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:25:36,571 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 102 transitions, 865 flow. Second operand  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:25:36,571 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:25:36,571 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:25:36,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:25:38,069 INFO  L124   PetriNetUnfolderBase]: 1892/2924 cut-off events.
[2024-06-20 18:25:38,069 INFO  L125   PetriNetUnfolderBase]: For 51710/51710 co-relation queries the response was YES.
[2024-06-20 18:25:38,075 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15859 conditions, 2924 events. 1892/2924 cut-off events. For 51710/51710 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14586 event pairs, 600 based on Foata normal form. 4/2928 useless extension candidates. Maximal degree in co-relation 15819. Up to 2679 conditions per place. 
[2024-06-20 18:25:38,083 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 100 selfloop transitions, 22 changer transitions 0/128 dead transitions.
[2024-06-20 18:25:38,083 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 128 transitions, 1179 flow
[2024-06-20 18:25:38,085 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:25:38,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:25:38,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-20 18:25:38,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 18:25:38,087 INFO  L175             Difference]: Start difference. First operand has 94 places, 102 transitions, 865 flow. Second operand 8 states and 152 transitions.
[2024-06-20 18:25:38,087 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 128 transitions, 1179 flow
[2024-06-20 18:25:38,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1109 flow, removed 17 selfloop flow, removed 6 redundant places.
[2024-06-20 18:25:38,123 INFO  L231             Difference]: Finished difference. Result has 96 places, 102 transitions, 847 flow
[2024-06-20 18:25:38,123 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=847, PETRI_PLACES=96, PETRI_TRANSITIONS=102}
[2024-06-20 18:25:38,124 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-20 18:25:38,124 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 847 flow
[2024-06-20 18:25:38,124 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.333333333333334) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:25:38,124 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:25:38,124 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:25:38,124 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 18:25:38,124 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-20 18:25:38,125 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:25:38,125 INFO  L85        PathProgramCache]: Analyzing trace with hash -2010964430, now seen corresponding path program 1 times
[2024-06-20 18:25:38,125 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:25:38,125 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46501934]
[2024-06-20 18:25:38,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:25:38,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:25:38,164 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:25:53,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:25:53,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:25:53,005 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46501934]
[2024-06-20 18:25:53,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46501934] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:25:53,005 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:25:53,005 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:25:53,005 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241849707]
[2024-06-20 18:25:53,005 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:25:53,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:25:53,006 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:25:53,006 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:25:53,007 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:25:53,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:25:53,235 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 847 flow. Second operand  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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-20 18:25:53,235 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:25:53,235 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:25:53,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:25:54,965 INFO  L124   PetriNetUnfolderBase]: 2246/3408 cut-off events.
[2024-06-20 18:25:54,965 INFO  L125   PetriNetUnfolderBase]: For 64554/64554 co-relation queries the response was YES.
[2024-06-20 18:25:54,972 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18379 conditions, 3408 events. 2246/3408 cut-off events. For 64554/64554 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16473 event pairs, 739 based on Foata normal form. 4/3412 useless extension candidates. Maximal degree in co-relation 18338. Up to 3217 conditions per place. 
[2024-06-20 18:25:54,981 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 105 selfloop transitions, 15 changer transitions 0/125 dead transitions.
[2024-06-20 18:25:54,981 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 125 transitions, 1171 flow
[2024-06-20 18:25:54,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:25:54,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:25:54,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 18:25:54,984 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 18:25:54,985 INFO  L175             Difference]: Start difference. First operand has 96 places, 102 transitions, 847 flow. Second operand 7 states and 126 transitions.
[2024-06-20 18:25:54,985 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 125 transitions, 1171 flow
[2024-06-20 18:25:55,022 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 125 transitions, 1084 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-20 18:25:55,024 INFO  L231             Difference]: Finished difference. Result has 96 places, 104 transitions, 833 flow
[2024-06-20 18:25:55,024 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=833, PETRI_PLACES=96, PETRI_TRANSITIONS=104}
[2024-06-20 18:25:55,025 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 53 predicate places.
[2024-06-20 18:25:55,025 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 104 transitions, 833 flow
[2024-06-20 18:25:55,025 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.3) internal successors, (103), 10 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-20 18:25:55,025 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:25:55,025 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:25:55,026 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 18:25:55,026 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:25:55,026 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:25:55,026 INFO  L85        PathProgramCache]: Analyzing trace with hash -1390705951, now seen corresponding path program 1 times
[2024-06-20 18:25:55,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:25:55,026 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582065612]
[2024-06-20 18:25:55,027 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:25:55,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:25:55,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:26:12,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:26:12,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:26:12,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582065612]
[2024-06-20 18:26:12,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582065612] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:26:12,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:26:12,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:26:12,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234375176]
[2024-06-20 18:26:12,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:26:12,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:26:12,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:26:12,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:26:12,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:26:12,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:26:12,490 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 104 transitions, 833 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:26:12,490 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:26:12,490 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:26:12,490 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:26:13,876 INFO  L124   PetriNetUnfolderBase]: 2298/3457 cut-off events.
[2024-06-20 18:26:13,876 INFO  L125   PetriNetUnfolderBase]: For 68778/68778 co-relation queries the response was YES.
[2024-06-20 18:26:13,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18689 conditions, 3457 events. 2298/3457 cut-off events. For 68778/68778 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16377 event pairs, 823 based on Foata normal form. 3/3460 useless extension candidates. Maximal degree in co-relation 18647. Up to 3352 conditions per place. 
[2024-06-20 18:26:13,900 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 95 selfloop transitions, 11 changer transitions 0/118 dead transitions.
[2024-06-20 18:26:13,901 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 118 transitions, 1099 flow
[2024-06-20 18:26:13,901 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:26:13,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:26:13,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions.
[2024-06-20 18:26:13,904 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4087301587301587
[2024-06-20 18:26:13,904 INFO  L175             Difference]: Start difference. First operand has 96 places, 104 transitions, 833 flow. Second operand 6 states and 103 transitions.
[2024-06-20 18:26:13,904 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 118 transitions, 1099 flow
[2024-06-20 18:26:13,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 118 transitions, 1044 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-20 18:26:13,955 INFO  L231             Difference]: Finished difference. Result has 97 places, 107 transitions, 840 flow
[2024-06-20 18:26:13,956 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=840, PETRI_PLACES=97, PETRI_TRANSITIONS=107}
[2024-06-20 18:26:13,956 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 54 predicate places.
[2024-06-20 18:26:13,956 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 107 transitions, 840 flow
[2024-06-20 18:26:13,958 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:26:13,958 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:26:13,958 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:26:13,958 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 18:26:13,958 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-20 18:26:13,959 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:26:13,959 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694215594, now seen corresponding path program 1 times
[2024-06-20 18:26:13,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:26:13,959 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784250632]
[2024-06-20 18:26:13,959 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:26:13,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:26:14,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:26:26,286 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:26:26,287 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:26:26,287 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784250632]
[2024-06-20 18:26:26,287 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784250632] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:26:26,287 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:26:26,287 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:26:26,287 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437155079]
[2024-06-20 18:26:26,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:26:26,287 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:26:26,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:26:26,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:26:26,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:26:26,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:26:26,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 107 transitions, 840 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:26:26,543 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:26:26,543 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:26:26,543 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:26:27,954 INFO  L124   PetriNetUnfolderBase]: 1896/2932 cut-off events.
[2024-06-20 18:26:27,954 INFO  L125   PetriNetUnfolderBase]: For 64537/64539 co-relation queries the response was YES.
[2024-06-20 18:26:27,961 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16746 conditions, 2932 events. 1896/2932 cut-off events. For 64537/64539 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14584 event pairs, 448 based on Foata normal form. 6/2938 useless extension candidates. Maximal degree in co-relation 16703. Up to 2550 conditions per place. 
[2024-06-20 18:26:27,971 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 106 selfloop transitions, 32 changer transitions 0/144 dead transitions.
[2024-06-20 18:26:27,972 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 144 transitions, 1346 flow
[2024-06-20 18:26:27,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:26:27,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:26:27,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-20 18:26:27,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2024-06-20 18:26:27,975 INFO  L175             Difference]: Start difference. First operand has 97 places, 107 transitions, 840 flow. Second operand 8 states and 160 transitions.
[2024-06-20 18:26:27,975 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 144 transitions, 1346 flow
[2024-06-20 18:26:28,011 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 144 transitions, 1306 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 18:26:28,013 INFO  L231             Difference]: Finished difference. Result has 101 places, 111 transitions, 943 flow
[2024-06-20 18:26:28,013 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=943, PETRI_PLACES=101, PETRI_TRANSITIONS=111}
[2024-06-20 18:26:28,013 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 58 predicate places.
[2024-06-20 18:26:28,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 943 flow
[2024-06-20 18:26:28,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:26:28,014 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:26:28,014 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:26:28,014 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 18:26:28,014 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-20 18:26:28,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:26:28,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694218508, now seen corresponding path program 1 times
[2024-06-20 18:26:28,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:26:28,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606968237]
[2024-06-20 18:26:28,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:26:28,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:26:28,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:26:39,123 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:26:39,123 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:26:39,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606968237]
[2024-06-20 18:26:39,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606968237] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:26:39,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:26:39,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:26:39,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712514669]
[2024-06-20 18:26:39,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:26:39,124 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:26:39,124 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:26:39,124 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:26:39,124 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:26:39,400 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:26:39,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 943 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:26:39,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:26:39,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:26:39,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:26:40,713 INFO  L124   PetriNetUnfolderBase]: 1922/2968 cut-off events.
[2024-06-20 18:26:40,713 INFO  L125   PetriNetUnfolderBase]: For 70724/70724 co-relation queries the response was YES.
[2024-06-20 18:26:40,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17414 conditions, 2968 events. 1922/2968 cut-off events. For 70724/70724 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14813 event pairs, 513 based on Foata normal form. 4/2971 useless extension candidates. Maximal degree in co-relation 17370. Up to 2385 conditions per place. 
[2024-06-20 18:26:40,729 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 92 selfloop transitions, 55 changer transitions 0/153 dead transitions.
[2024-06-20 18:26:40,729 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 153 transitions, 1583 flow
[2024-06-20 18:26:40,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:26:40,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:26:40,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-20 18:26:40,732 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 18:26:40,732 INFO  L175             Difference]: Start difference. First operand has 101 places, 111 transitions, 943 flow. Second operand 8 states and 168 transitions.
[2024-06-20 18:26:40,732 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 153 transitions, 1583 flow
[2024-06-20 18:26:40,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 153 transitions, 1511 flow, removed 21 selfloop flow, removed 4 redundant places.
[2024-06-20 18:26:40,778 INFO  L231             Difference]: Finished difference. Result has 105 places, 117 transitions, 1079 flow
[2024-06-20 18:26:40,778 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1079, PETRI_PLACES=105, PETRI_TRANSITIONS=117}
[2024-06-20 18:26:40,778 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 62 predicate places.
[2024-06-20 18:26:40,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 117 transitions, 1079 flow
[2024-06-20 18:26:40,779 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:26:40,779 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:26:40,779 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:26:40,779 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 18:26:40,779 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-20 18:26:40,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:26:40,780 INFO  L85        PathProgramCache]: Analyzing trace with hash 1694218384, now seen corresponding path program 2 times
[2024-06-20 18:26:40,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:26:40,780 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087716461]
[2024-06-20 18:26:40,780 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:26:40,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:26:40,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:26:52,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-20 18:26:52,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:26:52,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087716461]
[2024-06-20 18:26:52,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087716461] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:26:52,894 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:26:52,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:26:52,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971861914]
[2024-06-20 18:26:52,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:26:52,895 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:26:52,895 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:26:52,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:26:52,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:26:53,159 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:26:53,159 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 117 transitions, 1079 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:26:53,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:26:53,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:26:53,160 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:26:54,562 INFO  L124   PetriNetUnfolderBase]: 1939/2995 cut-off events.
[2024-06-20 18:26:54,562 INFO  L125   PetriNetUnfolderBase]: For 77849/77851 co-relation queries the response was YES.
[2024-06-20 18:26:54,571 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18195 conditions, 2995 events. 1939/2995 cut-off events. For 77849/77851 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15009 event pairs, 560 based on Foata normal form. 6/3001 useless extension candidates. Maximal degree in co-relation 18149. Up to 2695 conditions per place. 
[2024-06-20 18:26:54,581 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 115 selfloop transitions, 28 changer transitions 0/149 dead transitions.
[2024-06-20 18:26:54,581 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 149 transitions, 1467 flow
[2024-06-20 18:26:54,583 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:26:54,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:26:54,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 18:26:54,584 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46726190476190477
[2024-06-20 18:26:54,584 INFO  L175             Difference]: Start difference. First operand has 105 places, 117 transitions, 1079 flow. Second operand 8 states and 157 transitions.
[2024-06-20 18:26:54,584 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 149 transitions, 1467 flow
[2024-06-20 18:26:54,627 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 149 transitions, 1371 flow, removed 23 selfloop flow, removed 4 redundant places.
[2024-06-20 18:26:54,628 INFO  L231             Difference]: Finished difference. Result has 109 places, 119 transitions, 1076 flow
[2024-06-20 18:26:54,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1076, PETRI_PLACES=109, PETRI_TRANSITIONS=119}
[2024-06-20 18:26:54,629 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 66 predicate places.
[2024-06-20 18:26:54,629 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 119 transitions, 1076 flow
[2024-06-20 18:26:54,629 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:26:54,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:26:54,630 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:26:54,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 18:26:54,630 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-20 18:26:54,630 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:26:54,630 INFO  L85        PathProgramCache]: Analyzing trace with hash 1697019668, now seen corresponding path program 2 times
[2024-06-20 18:26:54,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:26:54,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100221373]
[2024-06-20 18:26:54,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:26:54,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:26:54,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:27:05,629 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:27:05,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:27:05,630 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100221373]
[2024-06-20 18:27:05,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100221373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:27:05,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:27:05,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:27:05,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286777516]
[2024-06-20 18:27:05,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:27:05,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:27:05,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:27:05,631 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:27:05,631 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:27:05,857 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:27:05,857 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 119 transitions, 1076 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:05,857 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:27:05,857 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:27:05,857 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:27:07,274 INFO  L124   PetriNetUnfolderBase]: 1961/3032 cut-off events.
[2024-06-20 18:27:07,274 INFO  L125   PetriNetUnfolderBase]: For 83806/83806 co-relation queries the response was YES.
[2024-06-20 18:27:07,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18633 conditions, 3032 events. 1961/3032 cut-off events. For 83806/83806 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15206 event pairs, 526 based on Foata normal form. 4/3035 useless extension candidates. Maximal degree in co-relation 18585. Up to 2567 conditions per place. 
[2024-06-20 18:27:07,292 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 98 selfloop transitions, 49 changer transitions 0/153 dead transitions.
[2024-06-20 18:27:07,292 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 153 transitions, 1582 flow
[2024-06-20 18:27:07,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:27:07,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:27:07,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-20 18:27:07,295 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-06-20 18:27:07,295 INFO  L175             Difference]: Start difference. First operand has 109 places, 119 transitions, 1076 flow. Second operand 8 states and 163 transitions.
[2024-06-20 18:27:07,295 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 153 transitions, 1582 flow
[2024-06-20 18:27:07,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 153 transitions, 1511 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-20 18:27:07,345 INFO  L231             Difference]: Finished difference. Result has 111 places, 122 transitions, 1155 flow
[2024-06-20 18:27:07,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1155, PETRI_PLACES=111, PETRI_TRANSITIONS=122}
[2024-06-20 18:27:07,346 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 68 predicate places.
[2024-06-20 18:27:07,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 122 transitions, 1155 flow
[2024-06-20 18:27:07,347 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:07,347 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:27:07,347 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:27:07,347 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 18:27:07,347 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-20 18:27:07,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:27:07,348 INFO  L85        PathProgramCache]: Analyzing trace with hash 2067731336, now seen corresponding path program 3 times
[2024-06-20 18:27:07,348 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:27:07,348 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225613767]
[2024-06-20 18:27:07,348 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:27:07,348 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:27:07,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:27:19,078 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:27:19,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:27:19,079 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225613767]
[2024-06-20 18:27:19,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225613767] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:27:19,079 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:27:19,079 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:27:19,079 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952770201]
[2024-06-20 18:27:19,079 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:27:19,079 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:27:19,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:27:19,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:27:19,080 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:27:19,375 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:27:19,376 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 122 transitions, 1155 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:19,376 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:27:19,376 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:27:19,376 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:27:20,843 INFO  L124   PetriNetUnfolderBase]: 1953/3020 cut-off events.
[2024-06-20 18:27:20,843 INFO  L125   PetriNetUnfolderBase]: For 88962/88964 co-relation queries the response was YES.
[2024-06-20 18:27:20,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18862 conditions, 3020 events. 1953/3020 cut-off events. For 88962/88964 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15139 event pairs, 558 based on Foata normal form. 6/3026 useless extension candidates. Maximal degree in co-relation 18813. Up to 2748 conditions per place. 
[2024-06-20 18:27:20,860 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 119 selfloop transitions, 24 changer transitions 0/149 dead transitions.
[2024-06-20 18:27:20,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 149 transitions, 1509 flow
[2024-06-20 18:27:20,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:27:20,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:27:20,863 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-20 18:27:20,863 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-20 18:27:20,864 INFO  L175             Difference]: Start difference. First operand has 111 places, 122 transitions, 1155 flow. Second operand 8 states and 154 transitions.
[2024-06-20 18:27:20,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 149 transitions, 1509 flow
[2024-06-20 18:27:20,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 149 transitions, 1375 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-20 18:27:20,919 INFO  L231             Difference]: Finished difference. Result has 113 places, 122 transitions, 1076 flow
[2024-06-20 18:27:20,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1076, PETRI_PLACES=113, PETRI_TRANSITIONS=122}
[2024-06-20 18:27:20,919 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 70 predicate places.
[2024-06-20 18:27:20,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 122 transitions, 1076 flow
[2024-06-20 18:27:20,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:20,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:27:20,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:27:20,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 18:27:20,920 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-20 18:27:20,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:27:20,921 INFO  L85        PathProgramCache]: Analyzing trace with hash 2067731460, now seen corresponding path program 3 times
[2024-06-20 18:27:20,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:27:20,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559484590]
[2024-06-20 18:27:20,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:27:20,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:27:20,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:27:32,944 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:27:32,945 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:27:32,945 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559484590]
[2024-06-20 18:27:32,945 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559484590] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:27:32,945 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:27:32,945 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:27:32,945 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336479113]
[2024-06-20 18:27:32,945 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:27:32,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:27:32,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:27:32,946 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:27:32,946 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:27:33,214 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:27:33,214 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 122 transitions, 1076 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:33,214 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:27:33,214 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:27:33,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:27:34,632 INFO  L124   PetriNetUnfolderBase]: 1975/3057 cut-off events.
[2024-06-20 18:27:34,632 INFO  L125   PetriNetUnfolderBase]: For 94939/94939 co-relation queries the response was YES.
[2024-06-20 18:27:34,641 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19062 conditions, 3057 events. 1975/3057 cut-off events. For 94939/94939 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 15359 event pairs, 524 based on Foata normal form. 4/3060 useless extension candidates. Maximal degree in co-relation 19012. Up to 2560 conditions per place. 
[2024-06-20 18:27:34,652 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 97 selfloop transitions, 54 changer transitions 0/157 dead transitions.
[2024-06-20 18:27:34,652 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 157 transitions, 1608 flow
[2024-06-20 18:27:34,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:27:34,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:27:34,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-20 18:27:34,655 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-06-20 18:27:34,655 INFO  L175             Difference]: Start difference. First operand has 113 places, 122 transitions, 1076 flow. Second operand 8 states and 165 transitions.
[2024-06-20 18:27:34,655 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 157 transitions, 1608 flow
[2024-06-20 18:27:34,717 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 157 transitions, 1545 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 18:27:34,719 INFO  L231             Difference]: Finished difference. Result has 114 places, 125 transitions, 1179 flow
[2024-06-20 18:27:34,719 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1179, PETRI_PLACES=114, PETRI_TRANSITIONS=125}
[2024-06-20 18:27:34,720 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 71 predicate places.
[2024-06-20 18:27:34,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 125 transitions, 1179 flow
[2024-06-20 18:27:34,720 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:34,720 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:27:34,720 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:27:34,720 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 18:27:34,720 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:27:34,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:27:34,721 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812306188, now seen corresponding path program 4 times
[2024-06-20 18:27:34,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:27:34,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235936791]
[2024-06-20 18:27:34,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:27:34,721 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:27:34,768 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:27:45,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:27:45,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:27:45,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235936791]
[2024-06-20 18:27:45,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235936791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:27:45,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:27:45,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:27:45,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281752434]
[2024-06-20 18:27:45,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:27:45,251 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:27:45,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:27:45,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:27:45,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:27:45,561 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:27:45,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 125 transitions, 1179 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:45,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:27:45,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:27:45,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:27:47,133 INFO  L124   PetriNetUnfolderBase]: 1997/3089 cut-off events.
[2024-06-20 18:27:47,133 INFO  L125   PetriNetUnfolderBase]: For 102170/102170 co-relation queries the response was YES.
[2024-06-20 18:27:47,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19679 conditions, 3089 events. 1997/3089 cut-off events. For 102170/102170 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15564 event pairs, 512 based on Foata normal form. 4/3092 useless extension candidates. Maximal degree in co-relation 19628. Up to 2534 conditions per place. 
[2024-06-20 18:27:47,151 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 103 selfloop transitions, 59 changer transitions 0/168 dead transitions.
[2024-06-20 18:27:47,151 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 168 transitions, 1867 flow
[2024-06-20 18:27:47,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:27:47,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:27:47,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions.
[2024-06-20 18:27:47,155 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5178571428571429
[2024-06-20 18:27:47,155 INFO  L175             Difference]: Start difference. First operand has 114 places, 125 transitions, 1179 flow. Second operand 8 states and 174 transitions.
[2024-06-20 18:27:47,155 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 168 transitions, 1867 flow
[2024-06-20 18:27:47,219 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 168 transitions, 1731 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 18:27:47,220 INFO  L231             Difference]: Finished difference. Result has 116 places, 128 transitions, 1219 flow
[2024-06-20 18:27:47,221 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1219, PETRI_PLACES=116, PETRI_TRANSITIONS=128}
[2024-06-20 18:27:47,221 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 73 predicate places.
[2024-06-20 18:27:47,221 INFO  L495      AbstractCegarLoop]: Abstraction has has 116 places, 128 transitions, 1219 flow
[2024-06-20 18:27:47,221 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:27:47,222 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:27:47,222 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:27:47,222 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 18:27:47,222 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-20 18:27:47,222 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:27:47,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -2111767036, now seen corresponding path program 5 times
[2024-06-20 18:27:47,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:27:47,223 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714573415]
[2024-06-20 18:27:47,223 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:27:47,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:27:47,272 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:27:59,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:27:59,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:27:59,023 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714573415]
[2024-06-20 18:27:59,023 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714573415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:27:59,023 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:27:59,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:27:59,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184237360]
[2024-06-20 18:27:59,024 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:27:59,024 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:27:59,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:27:59,025 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:27:59,025 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:27:59,336 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:27:59,336 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 128 transitions, 1219 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:27:59,336 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:27:59,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:27:59,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:28:00,897 INFO  L124   PetriNetUnfolderBase]: 2019/3121 cut-off events.
[2024-06-20 18:28:00,897 INFO  L125   PetriNetUnfolderBase]: For 108949/108949 co-relation queries the response was YES.
[2024-06-20 18:28:00,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20136 conditions, 3121 events. 2019/3121 cut-off events. For 108949/108949 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15756 event pairs, 522 based on Foata normal form. 4/3124 useless extension candidates. Maximal degree in co-relation 20084. Up to 2651 conditions per place. 
[2024-06-20 18:28:00,917 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 112 selfloop transitions, 49 changer transitions 0/167 dead transitions.
[2024-06-20 18:28:00,917 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 167 transitions, 1801 flow
[2024-06-20 18:28:00,920 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:28:00,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:28:00,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-20 18:28:00,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47883597883597884
[2024-06-20 18:28:00,920 INFO  L175             Difference]: Start difference. First operand has 116 places, 128 transitions, 1219 flow. Second operand 9 states and 181 transitions.
[2024-06-20 18:28:00,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 167 transitions, 1801 flow
[2024-06-20 18:28:00,990 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 167 transitions, 1631 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-20 18:28:00,992 INFO  L231             Difference]: Finished difference. Result has 119 places, 131 transitions, 1217 flow
[2024-06-20 18:28:00,992 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1055, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1217, PETRI_PLACES=119, PETRI_TRANSITIONS=131}
[2024-06-20 18:28:00,993 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 76 predicate places.
[2024-06-20 18:28:00,993 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 131 transitions, 1217 flow
[2024-06-20 18:28:00,993 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:28:00,993 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:28:00,993 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:28:00,994 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 18:28:00,994 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-20 18:28:00,994 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:28:00,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -35437518, now seen corresponding path program 6 times
[2024-06-20 18:28:00,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:28:00,995 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331006701]
[2024-06-20 18:28:00,995 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:28:00,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:28:01,059 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:28:12,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:28:12,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:28:12,029 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331006701]
[2024-06-20 18:28:12,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331006701] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:28:12,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:28:12,030 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:28:12,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145002878]
[2024-06-20 18:28:12,030 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:28:12,030 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:28:12,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:28:12,030 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:28:12,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:28:12,234 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:28:12,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 131 transitions, 1217 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:28:12,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:28:12,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:28:12,235 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:28:13,739 INFO  L124   PetriNetUnfolderBase]: 2041/3153 cut-off events.
[2024-06-20 18:28:13,739 INFO  L125   PetriNetUnfolderBase]: For 116098/116098 co-relation queries the response was YES.
[2024-06-20 18:28:13,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20434 conditions, 3153 events. 2041/3153 cut-off events. For 116098/116098 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15942 event pairs, 512 based on Foata normal form. 4/3156 useless extension candidates. Maximal degree in co-relation 20381. Up to 2683 conditions per place. 
[2024-06-20 18:28:13,759 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 110 selfloop transitions, 53 changer transitions 0/169 dead transitions.
[2024-06-20 18:28:13,760 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 169 transitions, 1805 flow
[2024-06-20 18:28:13,764 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:28:13,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:28:13,765 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions.
[2024-06-20 18:28:13,765 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49702380952380953
[2024-06-20 18:28:13,765 INFO  L175             Difference]: Start difference. First operand has 119 places, 131 transitions, 1217 flow. Second operand 8 states and 167 transitions.
[2024-06-20 18:28:13,765 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 169 transitions, 1805 flow
[2024-06-20 18:28:13,840 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 169 transitions, 1673 flow, removed 19 selfloop flow, removed 7 redundant places.
[2024-06-20 18:28:13,842 INFO  L231             Difference]: Finished difference. Result has 120 places, 134 transitions, 1261 flow
[2024-06-20 18:28:13,842 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1261, PETRI_PLACES=120, PETRI_TRANSITIONS=134}
[2024-06-20 18:28:13,843 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 77 predicate places.
[2024-06-20 18:28:13,843 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 134 transitions, 1261 flow
[2024-06-20 18:28:13,843 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 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-20 18:28:13,843 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:28:13,843 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:28:13,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 18:28:13,843 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:28:13,844 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:28:13,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -174605455, now seen corresponding path program 1 times
[2024-06-20 18:28:13,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:28:13,844 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886550869]
[2024-06-20 18:28:13,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:28:13,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:28:13,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:28:27,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:28:27,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:28:27,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886550869]
[2024-06-20 18:28:27,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886550869] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:28:27,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:28:27,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:28:27,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107699217]
[2024-06-20 18:28:27,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:28:27,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:28:27,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:28:27,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:28:27,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:28:28,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:28:28,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 134 transitions, 1261 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-20 18:28:28,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:28:28,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:28:28,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:28:29,598 INFO  L124   PetriNetUnfolderBase]: 2523/3790 cut-off events.
[2024-06-20 18:28:29,598 INFO  L125   PetriNetUnfolderBase]: For 141230/141230 co-relation queries the response was YES.
[2024-06-20 18:28:29,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24144 conditions, 3790 events. 2523/3790 cut-off events. For 141230/141230 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18267 event pairs, 826 based on Foata normal form. 1/3791 useless extension candidates. Maximal degree in co-relation 24090. Up to 3652 conditions per place. 
[2024-06-20 18:28:29,620 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 125 selfloop transitions, 16 changer transitions 0/156 dead transitions.
[2024-06-20 18:28:29,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 156 transitions, 1707 flow
[2024-06-20 18:28:29,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:28:29,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:28:29,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-20 18:28:29,621 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4365079365079365
[2024-06-20 18:28:29,621 INFO  L175             Difference]: Start difference. First operand has 120 places, 134 transitions, 1261 flow. Second operand 6 states and 110 transitions.
[2024-06-20 18:28:29,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 156 transitions, 1707 flow
[2024-06-20 18:28:29,705 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 156 transitions, 1584 flow, removed 22 selfloop flow, removed 5 redundant places.
[2024-06-20 18:28:29,707 INFO  L231             Difference]: Finished difference. Result has 121 places, 140 transitions, 1246 flow
[2024-06-20 18:28:29,707 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1138, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1246, PETRI_PLACES=121, PETRI_TRANSITIONS=140}
[2024-06-20 18:28:29,708 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 78 predicate places.
[2024-06-20 18:28:29,708 INFO  L495      AbstractCegarLoop]: Abstraction has has 121 places, 140 transitions, 1246 flow
[2024-06-20 18:28:29,708 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-20 18:28:29,708 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:28:29,708 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:28:29,708 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 18:28:29,709 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-20 18:28:29,709 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:28:29,709 INFO  L85        PathProgramCache]: Analyzing trace with hash 1854379766, now seen corresponding path program 7 times
[2024-06-20 18:28:29,709 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:28:29,709 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802740573]
[2024-06-20 18:28:29,710 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:28:29,710 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:28:29,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:28:40,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:28:40,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:28:40,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802740573]
[2024-06-20 18:28:40,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802740573] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:28:40,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:28:40,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:28:40,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780359516]
[2024-06-20 18:28:40,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:28:40,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:28:40,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:28:40,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:28:40,652 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:28:40,917 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:28:40,918 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 140 transitions, 1246 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:28:40,918 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:28:40,918 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:28:40,918 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:28:42,468 INFO  L124   PetriNetUnfolderBase]: 2085/3210 cut-off events.
[2024-06-20 18:28:42,468 INFO  L125   PetriNetUnfolderBase]: For 131491/131491 co-relation queries the response was YES.
[2024-06-20 18:28:42,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21327 conditions, 3210 events. 2085/3210 cut-off events. For 131491/131491 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 16172 event pairs, 563 based on Foata normal form. 4/3214 useless extension candidates. Maximal degree in co-relation 21272. Up to 2921 conditions per place. 
[2024-06-20 18:28:42,486 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 139 selfloop transitions, 28 changer transitions 0/175 dead transitions.
[2024-06-20 18:28:42,486 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 175 transitions, 1844 flow
[2024-06-20 18:28:42,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:28:42,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:28:42,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions.
[2024-06-20 18:28:42,488 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4497354497354497
[2024-06-20 18:28:42,488 INFO  L175             Difference]: Start difference. First operand has 121 places, 140 transitions, 1246 flow. Second operand 9 states and 170 transitions.
[2024-06-20 18:28:42,489 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 175 transitions, 1844 flow
[2024-06-20 18:28:42,559 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 175 transitions, 1810 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-20 18:28:42,561 INFO  L231             Difference]: Finished difference. Result has 128 places, 143 transitions, 1345 flow
[2024-06-20 18:28:42,561 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1345, PETRI_PLACES=128, PETRI_TRANSITIONS=143}
[2024-06-20 18:28:42,561 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-20 18:28:42,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 143 transitions, 1345 flow
[2024-06-20 18:28:42,562 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:28:42,562 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:28:42,562 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:28:42,562 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 18:28:42,562 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-20 18:28:42,562 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:28:42,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 237182698, now seen corresponding path program 8 times
[2024-06-20 18:28:42,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:28:42,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994632048]
[2024-06-20 18:28:42,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:28:42,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:28:42,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:28:52,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:28:52,870 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:28:52,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994632048]
[2024-06-20 18:28:52,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994632048] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:28:52,870 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:28:52,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:28:52,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286362417]
[2024-06-20 18:28:52,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:28:52,870 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:28:52,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:28:52,871 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:28:52,871 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:28:53,124 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:28:53,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 143 transitions, 1345 flow. Second operand  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:28:53,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:28:53,125 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:28:53,125 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:28:54,615 INFO  L124   PetriNetUnfolderBase]: 2075/3196 cut-off events.
[2024-06-20 18:28:54,615 INFO  L125   PetriNetUnfolderBase]: For 137694/137694 co-relation queries the response was YES.
[2024-06-20 18:28:54,624 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21507 conditions, 3196 events. 2075/3196 cut-off events. For 137694/137694 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 16096 event pairs, 551 based on Foata normal form. 4/3200 useless extension candidates. Maximal degree in co-relation 21450. Up to 2898 conditions per place. 
[2024-06-20 18:28:54,635 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 136 selfloop transitions, 30 changer transitions 0/174 dead transitions.
[2024-06-20 18:28:54,635 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 174 transitions, 1761 flow
[2024-06-20 18:28:54,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:28:54,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:28:54,637 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-20 18:28:54,638 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 18:28:54,638 INFO  L175             Difference]: Start difference. First operand has 128 places, 143 transitions, 1345 flow. Second operand 9 states and 171 transitions.
[2024-06-20 18:28:54,638 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 174 transitions, 1761 flow
[2024-06-20 18:28:54,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 174 transitions, 1559 flow, removed 42 selfloop flow, removed 9 redundant places.
[2024-06-20 18:28:54,736 INFO  L231             Difference]: Finished difference. Result has 128 places, 143 transitions, 1211 flow
[2024-06-20 18:28:54,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1143, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1211, PETRI_PLACES=128, PETRI_TRANSITIONS=143}
[2024-06-20 18:28:54,736 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 85 predicate places.
[2024-06-20 18:28:54,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 143 transitions, 1211 flow
[2024-06-20 18:28:54,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:28:54,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:28:54,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:28:54,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 18:28:54,737 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:28:54,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:28:54,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 364181675, now seen corresponding path program 2 times
[2024-06-20 18:28:54,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:28:54,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232873001]
[2024-06-20 18:28:54,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:28:54,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:28:54,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:29:07,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-20 18:29:07,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:29:07,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232873001]
[2024-06-20 18:29:07,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232873001] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:29:07,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:29:07,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:29:07,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310615183]
[2024-06-20 18:29:07,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:29:07,494 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:29:07,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:29:07,495 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:29:07,495 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:29:07,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:29:07,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 143 transitions, 1211 flow. Second operand  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-20 18:29:07,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:29:07,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:29:07,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:29:09,041 INFO  L124   PetriNetUnfolderBase]: 2541/3818 cut-off events.
[2024-06-20 18:29:09,042 INFO  L125   PetriNetUnfolderBase]: For 163288/163288 co-relation queries the response was YES.
[2024-06-20 18:29:09,053 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24699 conditions, 3818 events. 2541/3818 cut-off events. For 163288/163288 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18425 event pairs, 831 based on Foata normal form. 1/3819 useless extension candidates. Maximal degree in co-relation 24641. Up to 3699 conditions per place. 
[2024-06-20 18:29:09,065 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 126 selfloop transitions, 11 changer transitions 0/152 dead transitions.
[2024-06-20 18:29:09,065 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 152 transitions, 1507 flow
[2024-06-20 18:29:09,066 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:29:09,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:29:09,066 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions.
[2024-06-20 18:29:09,066 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4007936507936508
[2024-06-20 18:29:09,066 INFO  L175             Difference]: Start difference. First operand has 128 places, 143 transitions, 1211 flow. Second operand 6 states and 101 transitions.
[2024-06-20 18:29:09,066 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 152 transitions, 1507 flow
[2024-06-20 18:29:09,165 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 152 transitions, 1381 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-20 18:29:09,167 INFO  L231             Difference]: Finished difference. Result has 126 places, 143 transitions, 1113 flow
[2024-06-20 18:29:09,167 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1113, PETRI_PLACES=126, PETRI_TRANSITIONS=143}
[2024-06-20 18:29:09,167 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 83 predicate places.
[2024-06-20 18:29:09,167 INFO  L495      AbstractCegarLoop]: Abstraction has has 126 places, 143 transitions, 1113 flow
[2024-06-20 18:29:09,168 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-20 18:29:09,168 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:29:09,168 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:29:09,168 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 18:29:09,168 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:29:09,168 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:29:09,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -162456493, now seen corresponding path program 1 times
[2024-06-20 18:29:09,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:29:09,169 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742893832]
[2024-06-20 18:29:09,169 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:29:09,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:29:09,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:29:25,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:29:25,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:29:25,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742893832]
[2024-06-20 18:29:25,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742893832] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:29:25,858 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:29:25,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:29:25,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079372293]
[2024-06-20 18:29:25,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:29:25,859 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:29:25,859 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:29:25,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:29:25,859 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:29:26,033 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 18:29:26,034 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 143 transitions, 1113 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-20 18:29:26,034 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:29:26,034 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 18:29:26,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:29:27,640 INFO  L124   PetriNetUnfolderBase]: 2678/3957 cut-off events.
[2024-06-20 18:29:27,640 INFO  L125   PetriNetUnfolderBase]: For 172440/172440 co-relation queries the response was YES.
[2024-06-20 18:29:27,716 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25425 conditions, 3957 events. 2678/3957 cut-off events. For 172440/172440 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18567 event pairs, 836 based on Foata normal form. 1/3958 useless extension candidates. Maximal degree in co-relation 25366. Up to 3926 conditions per place. 
[2024-06-20 18:29:27,727 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 143 selfloop transitions, 16 changer transitions 0/162 dead transitions.
[2024-06-20 18:29:27,727 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 162 transitions, 1595 flow
[2024-06-20 18:29:27,728 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:29:27,728 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:29:27,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-20 18:29:27,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40476190476190477
[2024-06-20 18:29:27,728 INFO  L175             Difference]: Start difference. First operand has 126 places, 143 transitions, 1113 flow. Second operand 6 states and 102 transitions.
[2024-06-20 18:29:27,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 162 transitions, 1595 flow
[2024-06-20 18:29:27,817 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 162 transitions, 1563 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 18:29:27,818 INFO  L231             Difference]: Finished difference. Result has 127 places, 149 transitions, 1189 flow
[2024-06-20 18:29:27,819 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1189, PETRI_PLACES=127, PETRI_TRANSITIONS=149}
[2024-06-20 18:29:27,819 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 84 predicate places.
[2024-06-20 18:29:27,819 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 149 transitions, 1189 flow
[2024-06-20 18:29:27,819 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-20 18:29:27,819 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:29:27,819 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:29:27,819 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 18:29:27,819 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:29:27,820 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:29:27,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 382062227, now seen corresponding path program 2 times
[2024-06-20 18:29:27,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:29:27,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463189871]
[2024-06-20 18:29:27,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:29:27,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:29:27,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:29:43,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:29:43,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:29:43,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463189871]
[2024-06-20 18:29:43,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463189871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:29:43,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:29:43,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:29:43,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864945295]
[2024-06-20 18:29:43,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:29:43,718 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:29:43,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:29:43,718 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:29:43,718 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:29:43,837 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 18:29:43,838 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 149 transitions, 1189 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-20 18:29:43,838 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:29:43,838 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 18:29:43,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:29:45,357 INFO  L124   PetriNetUnfolderBase]: 2675/3954 cut-off events.
[2024-06-20 18:29:45,357 INFO  L125   PetriNetUnfolderBase]: For 182176/182178 co-relation queries the response was YES.
[2024-06-20 18:29:45,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25976 conditions, 3954 events. 2675/3954 cut-off events. For 182176/182178 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18571 event pairs, 839 based on Foata normal form. 3/3957 useless extension candidates. Maximal degree in co-relation 25916. Up to 3923 conditions per place. 
[2024-06-20 18:29:45,380 INFO  L140   encePairwiseOnDemand]: 34/42 looper letters, 139 selfloop transitions, 16 changer transitions 0/158 dead transitions.
[2024-06-20 18:29:45,380 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 158 transitions, 1521 flow
[2024-06-20 18:29:45,381 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:29:45,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:29:45,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions.
[2024-06-20 18:29:45,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3888888888888889
[2024-06-20 18:29:45,381 INFO  L175             Difference]: Start difference. First operand has 127 places, 149 transitions, 1189 flow. Second operand 6 states and 98 transitions.
[2024-06-20 18:29:45,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 158 transitions, 1521 flow
[2024-06-20 18:29:45,491 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 158 transitions, 1467 flow, removed 23 selfloop flow, removed 2 redundant places.
[2024-06-20 18:29:45,493 INFO  L231             Difference]: Finished difference. Result has 131 places, 149 transitions, 1173 flow
[2024-06-20 18:29:45,493 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1173, PETRI_PLACES=131, PETRI_TRANSITIONS=149}
[2024-06-20 18:29:45,494 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 88 predicate places.
[2024-06-20 18:29:45,494 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 149 transitions, 1173 flow
[2024-06-20 18:29:45,494 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 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-20 18:29:45,494 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:29:45,494 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:29:45,494 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 18:29:45,495 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-20 18:29:45,495 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:29:45,495 INFO  L85        PathProgramCache]: Analyzing trace with hash 981077170, now seen corresponding path program 1 times
[2024-06-20 18:29:45,495 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:29:45,495 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783097037]
[2024-06-20 18:29:45,495 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:29:45,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:29:45,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:29:59,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:29:59,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:29:59,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783097037]
[2024-06-20 18:29:59,183 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783097037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:29:59,183 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:29:59,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:29:59,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59626377]
[2024-06-20 18:29:59,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:29:59,183 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:29:59,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:29:59,184 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:29:59,184 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:29:59,424 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:29:59,425 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 149 transitions, 1173 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:29:59,425 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:29:59,425 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:29:59,425 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:30:01,161 INFO  L124   PetriNetUnfolderBase]: 2320/3572 cut-off events.
[2024-06-20 18:30:01,161 INFO  L125   PetriNetUnfolderBase]: For 194683/194683 co-relation queries the response was YES.
[2024-06-20 18:30:01,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24776 conditions, 3572 events. 2320/3572 cut-off events. For 194683/194683 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 18390 event pairs, 424 based on Foata normal form. 16/3570 useless extension candidates. Maximal degree in co-relation 24714. Up to 2348 conditions per place. 
[2024-06-20 18:30:01,185 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 121 selfloop transitions, 72 changer transitions 0/203 dead transitions.
[2024-06-20 18:30:01,185 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 203 transitions, 1930 flow
[2024-06-20 18:30:01,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:30:01,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:30:01,187 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions.
[2024-06-20 18:30:01,188 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026455026455027
[2024-06-20 18:30:01,188 INFO  L175             Difference]: Start difference. First operand has 131 places, 149 transitions, 1173 flow. Second operand 9 states and 190 transitions.
[2024-06-20 18:30:01,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 203 transitions, 1930 flow
[2024-06-20 18:30:01,284 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 203 transitions, 1880 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-06-20 18:30:01,286 INFO  L231             Difference]: Finished difference. Result has 135 places, 154 transitions, 1389 flow
[2024-06-20 18:30:01,286 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1389, PETRI_PLACES=135, PETRI_TRANSITIONS=154}
[2024-06-20 18:30:01,287 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 92 predicate places.
[2024-06-20 18:30:01,287 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 154 transitions, 1389 flow
[2024-06-20 18:30:01,287 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:01,287 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:30:01,287 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:30:01,287 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 18:30:01,287 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-20 18:30:01,288 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:30:01,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1240812814, now seen corresponding path program 2 times
[2024-06-20 18:30:01,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:30:01,288 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139970577]
[2024-06-20 18:30:01,288 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:30:01,288 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:30:01,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:30:13,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:30:13,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:30:13,010 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139970577]
[2024-06-20 18:30:13,010 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139970577] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:30:13,010 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:30:13,010 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:30:13,010 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468404436]
[2024-06-20 18:30:13,010 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:30:13,011 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:30:13,011 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:30:13,011 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:30:13,011 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:30:13,230 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:30:13,230 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 154 transitions, 1389 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:13,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:30:13,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:30:13,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:30:15,144 INFO  L124   PetriNetUnfolderBase]: 2472/3841 cut-off events.
[2024-06-20 18:30:15,144 INFO  L125   PetriNetUnfolderBase]: For 216878/216878 co-relation queries the response was YES.
[2024-06-20 18:30:15,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27596 conditions, 3841 events. 2472/3841 cut-off events. For 216878/216878 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 20465 event pairs, 581 based on Foata normal form. 16/3853 useless extension candidates. Maximal degree in co-relation 27533. Up to 2886 conditions per place. 
[2024-06-20 18:30:15,169 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 116 selfloop transitions, 79 changer transitions 0/205 dead transitions.
[2024-06-20 18:30:15,169 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 205 transitions, 2263 flow
[2024-06-20 18:30:15,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:30:15,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:30:15,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-20 18:30:15,172 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-20 18:30:15,172 INFO  L175             Difference]: Start difference. First operand has 135 places, 154 transitions, 1389 flow. Second operand 9 states and 192 transitions.
[2024-06-20 18:30:15,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 205 transitions, 2263 flow
[2024-06-20 18:30:15,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 205 transitions, 2206 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-20 18:30:15,308 INFO  L231             Difference]: Finished difference. Result has 140 places, 156 transitions, 1558 flow
[2024-06-20 18:30:15,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1558, PETRI_PLACES=140, PETRI_TRANSITIONS=156}
[2024-06-20 18:30:15,309 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 97 predicate places.
[2024-06-20 18:30:15,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 156 transitions, 1558 flow
[2024-06-20 18:30:15,309 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:15,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:30:15,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:30:15,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 18:30:15,309 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-20 18:30:15,309 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:30:15,310 INFO  L85        PathProgramCache]: Analyzing trace with hash 981167380, now seen corresponding path program 3 times
[2024-06-20 18:30:15,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:30:15,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521589770]
[2024-06-20 18:30:15,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:30:15,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:30:15,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:30:27,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:30:27,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:30:27,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521589770]
[2024-06-20 18:30:27,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521589770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:30:27,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:30:27,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:30:27,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464142858]
[2024-06-20 18:30:27,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:30:27,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:30:27,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:30:27,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:30:27,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:30:27,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:30:27,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 156 transitions, 1558 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:27,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:30:27,713 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:30:27,713 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:30:29,618 INFO  L124   PetriNetUnfolderBase]: 2436/3785 cut-off events.
[2024-06-20 18:30:29,618 INFO  L125   PetriNetUnfolderBase]: For 218596/218596 co-relation queries the response was YES.
[2024-06-20 18:30:29,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27263 conditions, 3785 events. 2436/3785 cut-off events. For 218596/218596 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 20060 event pairs, 597 based on Foata normal form. 20/3801 useless extension candidates. Maximal degree in co-relation 27198. Up to 2986 conditions per place. 
[2024-06-20 18:30:29,643 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 112 selfloop transitions, 77 changer transitions 0/199 dead transitions.
[2024-06-20 18:30:29,643 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 199 transitions, 2204 flow
[2024-06-20 18:30:29,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:30:29,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:30:29,646 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions.
[2024-06-20 18:30:29,646 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49206349206349204
[2024-06-20 18:30:29,646 INFO  L175             Difference]: Start difference. First operand has 140 places, 156 transitions, 1558 flow. Second operand 9 states and 186 transitions.
[2024-06-20 18:30:29,647 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 199 transitions, 2204 flow
[2024-06-20 18:30:29,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 199 transitions, 2089 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-20 18:30:29,766 INFO  L231             Difference]: Finished difference. Result has 144 places, 156 transitions, 1604 flow
[2024-06-20 18:30:29,766 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1604, PETRI_PLACES=144, PETRI_TRANSITIONS=156}
[2024-06-20 18:30:29,767 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 101 predicate places.
[2024-06-20 18:30:29,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 156 transitions, 1604 flow
[2024-06-20 18:30:29,767 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:29,767 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:30:29,767 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:30:29,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 18:30:29,768 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:30:29,768 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:30:29,768 INFO  L85        PathProgramCache]: Analyzing trace with hash 1068003340, now seen corresponding path program 4 times
[2024-06-20 18:30:29,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:30:29,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266203020]
[2024-06-20 18:30:29,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:30:29,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:30:29,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:30:42,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:30:42,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:30:42,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266203020]
[2024-06-20 18:30:42,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266203020] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:30:42,261 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:30:42,261 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:30:42,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905210331]
[2024-06-20 18:30:42,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:30:42,262 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:30:42,262 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:30:42,262 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:30:42,262 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:30:42,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:30:42,476 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 156 transitions, 1604 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:42,476 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:30:42,476 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:30:42,476 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:30:44,297 INFO  L124   PetriNetUnfolderBase]: 2557/3977 cut-off events.
[2024-06-20 18:30:44,297 INFO  L125   PetriNetUnfolderBase]: For 236961/236961 co-relation queries the response was YES.
[2024-06-20 18:30:44,311 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28771 conditions, 3977 events. 2557/3977 cut-off events. For 236961/236961 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21364 event pairs, 631 based on Foata normal form. 28/3996 useless extension candidates. Maximal degree in co-relation 28704. Up to 3363 conditions per place. 
[2024-06-20 18:30:44,322 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 143 selfloop transitions, 44 changer transitions 0/197 dead transitions.
[2024-06-20 18:30:44,322 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 197 transitions, 2148 flow
[2024-06-20 18:30:44,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:30:44,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:30:44,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-20 18:30:44,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-20 18:30:44,326 INFO  L175             Difference]: Start difference. First operand has 144 places, 156 transitions, 1604 flow. Second operand 9 states and 182 transitions.
[2024-06-20 18:30:44,326 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 197 transitions, 2148 flow
[2024-06-20 18:30:44,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 197 transitions, 1989 flow, removed 1 selfloop flow, removed 8 redundant places.
[2024-06-20 18:30:44,480 INFO  L231             Difference]: Finished difference. Result has 145 places, 158 transitions, 1592 flow
[2024-06-20 18:30:44,481 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1592, PETRI_PLACES=145, PETRI_TRANSITIONS=158}
[2024-06-20 18:30:44,481 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 102 predicate places.
[2024-06-20 18:30:44,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 158 transitions, 1592 flow
[2024-06-20 18:30:44,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:44,482 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:30:44,482 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:30:44,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 18:30:44,482 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-20 18:30:44,482 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:30:44,483 INFO  L85        PathProgramCache]: Analyzing trace with hash 363203680, now seen corresponding path program 5 times
[2024-06-20 18:30:44,483 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:30:44,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690178826]
[2024-06-20 18:30:44,483 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:30:44,483 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:30:44,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:30:57,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:30:57,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:30:57,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690178826]
[2024-06-20 18:30:57,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690178826] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:30:57,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:30:57,132 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:30:57,132 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329745958]
[2024-06-20 18:30:57,132 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:30:57,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:30:57,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:30:57,133 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:30:57,133 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:30:57,401 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:30:57,401 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 158 transitions, 1592 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:57,401 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:30:57,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:30:57,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:30:59,302 INFO  L124   PetriNetUnfolderBase]: 2625/4105 cut-off events.
[2024-06-20 18:30:59,302 INFO  L125   PetriNetUnfolderBase]: For 243937/243937 co-relation queries the response was YES.
[2024-06-20 18:30:59,318 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29646 conditions, 4105 events. 2625/4105 cut-off events. For 243937/243937 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 22402 event pairs, 645 based on Foata normal form. 20/4124 useless extension candidates. Maximal degree in co-relation 29578. Up to 3496 conditions per place. 
[2024-06-20 18:30:59,332 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 140 selfloop transitions, 48 changer transitions 0/198 dead transitions.
[2024-06-20 18:30:59,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 198 transitions, 2122 flow
[2024-06-20 18:30:59,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:30:59,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:30:59,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-20 18:30:59,335 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-20 18:30:59,336 INFO  L175             Difference]: Start difference. First operand has 145 places, 158 transitions, 1592 flow. Second operand 9 states and 182 transitions.
[2024-06-20 18:30:59,336 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 198 transitions, 2122 flow
[2024-06-20 18:30:59,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 198 transitions, 2017 flow, removed 11 selfloop flow, removed 7 redundant places.
[2024-06-20 18:30:59,497 INFO  L231             Difference]: Finished difference. Result has 147 places, 159 transitions, 1626 flow
[2024-06-20 18:30:59,497 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1626, PETRI_PLACES=147, PETRI_TRANSITIONS=159}
[2024-06-20 18:30:59,497 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 104 predicate places.
[2024-06-20 18:30:59,497 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 159 transitions, 1626 flow
[2024-06-20 18:30:59,498 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:30:59,498 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:30:59,498 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:30:59,498 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 18:30:59,498 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-20 18:30:59,498 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:30:59,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 1067855470, now seen corresponding path program 6 times
[2024-06-20 18:30:59,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:30:59,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529256114]
[2024-06-20 18:30:59,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:30:59,499 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:30:59,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:31:11,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:31:11,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:31:11,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529256114]
[2024-06-20 18:31:11,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529256114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:31:11,830 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:31:11,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:31:11,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546580173]
[2024-06-20 18:31:11,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:31:11,831 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:31:11,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:31:11,831 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:31:11,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:31:12,167 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:31:12,168 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 159 transitions, 1626 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:12,168 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:31:12,168 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:31:12,168 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:31:14,072 INFO  L124   PetriNetUnfolderBase]: 2724/4285 cut-off events.
[2024-06-20 18:31:14,072 INFO  L125   PetriNetUnfolderBase]: For 254273/254273 co-relation queries the response was YES.
[2024-06-20 18:31:14,093 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30642 conditions, 4285 events. 2724/4285 cut-off events. For 254273/254273 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23750 event pairs, 662 based on Foata normal form. 16/4300 useless extension candidates. Maximal degree in co-relation 30573. Up to 3406 conditions per place. 
[2024-06-20 18:31:14,108 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 137 selfloop transitions, 58 changer transitions 0/205 dead transitions.
[2024-06-20 18:31:14,109 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 205 transitions, 2366 flow
[2024-06-20 18:31:14,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:31:14,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:31:14,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions.
[2024-06-20 18:31:14,110 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4947089947089947
[2024-06-20 18:31:14,110 INFO  L175             Difference]: Start difference. First operand has 147 places, 159 transitions, 1626 flow. Second operand 9 states and 187 transitions.
[2024-06-20 18:31:14,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 205 transitions, 2366 flow
[2024-06-20 18:31:14,388 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 205 transitions, 2257 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-20 18:31:14,391 INFO  L231             Difference]: Finished difference. Result has 150 places, 161 transitions, 1710 flow
[2024-06-20 18:31:14,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1517, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1710, PETRI_PLACES=150, PETRI_TRANSITIONS=161}
[2024-06-20 18:31:14,392 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 107 predicate places.
[2024-06-20 18:31:14,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 161 transitions, 1710 flow
[2024-06-20 18:31:14,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:14,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:31:14,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:31:14,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 18:31:14,393 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:31:14,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:31:14,394 INFO  L85        PathProgramCache]: Analyzing trace with hash -1118129427, now seen corresponding path program 1 times
[2024-06-20 18:31:14,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:31:14,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391511450]
[2024-06-20 18:31:14,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:31:14,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:31:14,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:31:27,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:31:27,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:31:27,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391511450]
[2024-06-20 18:31:27,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391511450] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:31:27,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:31:27,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:31:27,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647593514]
[2024-06-20 18:31:27,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:31:27,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:31:27,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:31:27,595 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:31:27,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:31:27,694 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 18:31:27,694 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 161 transitions, 1710 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:27,694 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:31:27,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 18:31:27,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:31:29,787 INFO  L124   PetriNetUnfolderBase]: 3416/5171 cut-off events.
[2024-06-20 18:31:29,787 INFO  L125   PetriNetUnfolderBase]: For 293143/293145 co-relation queries the response was YES.
[2024-06-20 18:31:29,805 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36358 conditions, 5171 events. 3416/5171 cut-off events. For 293143/293145 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 27083 event pairs, 1046 based on Foata normal form. 4/5175 useless extension candidates. Maximal degree in co-relation 36287. Up to 5023 conditions per place. 
[2024-06-20 18:31:29,822 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 155 selfloop transitions, 39 changer transitions 0/197 dead transitions.
[2024-06-20 18:31:29,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 197 transitions, 2468 flow
[2024-06-20 18:31:29,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:31:29,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:31:29,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 18:31:29,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4421768707482993
[2024-06-20 18:31:29,823 INFO  L175             Difference]: Start difference. First operand has 150 places, 161 transitions, 1710 flow. Second operand 7 states and 130 transitions.
[2024-06-20 18:31:29,823 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 197 transitions, 2468 flow
[2024-06-20 18:31:30,005 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 197 transitions, 2339 flow, removed 12 selfloop flow, removed 6 redundant places.
[2024-06-20 18:31:30,007 INFO  L231             Difference]: Finished difference. Result has 152 places, 173 transitions, 1840 flow
[2024-06-20 18:31:30,008 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1581, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1840, PETRI_PLACES=152, PETRI_TRANSITIONS=173}
[2024-06-20 18:31:30,008 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 109 predicate places.
[2024-06-20 18:31:30,008 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 173 transitions, 1840 flow
[2024-06-20 18:31:30,009 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:30,009 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:31:30,009 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:31:30,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 18:31:30,009 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-20 18:31:30,009 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:31:30,009 INFO  L85        PathProgramCache]: Analyzing trace with hash -1045777742, now seen corresponding path program 7 times
[2024-06-20 18:31:30,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:31:30,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540821797]
[2024-06-20 18:31:30,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:31:30,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:31:30,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:31:42,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:31:42,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:31:42,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540821797]
[2024-06-20 18:31:42,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540821797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:31:42,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:31:42,698 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:31:42,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317912577]
[2024-06-20 18:31:42,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:31:42,698 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:31:42,698 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:31:42,699 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:31:42,699 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:31:43,072 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:31:43,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 173 transitions, 1840 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:43,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:31:43,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:31:43,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:31:45,364 INFO  L124   PetriNetUnfolderBase]: 2934/4626 cut-off events.
[2024-06-20 18:31:45,364 INFO  L125   PetriNetUnfolderBase]: For 301350/301350 co-relation queries the response was YES.
[2024-06-20 18:31:45,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34325 conditions, 4626 events. 2934/4626 cut-off events. For 301350/301350 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 26207 event pairs, 595 based on Foata normal form. 16/4641 useless extension candidates. Maximal degree in co-relation 34252. Up to 3497 conditions per place. 
[2024-06-20 18:31:45,402 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 139 selfloop transitions, 76 changer transitions 0/228 dead transitions.
[2024-06-20 18:31:45,402 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 228 transitions, 2852 flow
[2024-06-20 18:31:45,404 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:31:45,404 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:31:45,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions.
[2024-06-20 18:31:45,405 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5211640211640212
[2024-06-20 18:31:45,405 INFO  L175             Difference]: Start difference. First operand has 152 places, 173 transitions, 1840 flow. Second operand 9 states and 197 transitions.
[2024-06-20 18:31:45,405 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 228 transitions, 2852 flow
[2024-06-20 18:31:45,571 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 228 transitions, 2782 flow, removed 28 selfloop flow, removed 2 redundant places.
[2024-06-20 18:31:45,574 INFO  L231             Difference]: Finished difference. Result has 160 places, 176 transitions, 2056 flow
[2024-06-20 18:31:45,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2056, PETRI_PLACES=160, PETRI_TRANSITIONS=176}
[2024-06-20 18:31:45,575 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places.
[2024-06-20 18:31:45,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 176 transitions, 2056 flow
[2024-06-20 18:31:45,575 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:45,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:31:45,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:31:45,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 18:31:45,575 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-20 18:31:45,576 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:31:45,576 INFO  L85        PathProgramCache]: Analyzing trace with hash -1045774022, now seen corresponding path program 8 times
[2024-06-20 18:31:45,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:31:45,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585300424]
[2024-06-20 18:31:45,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:31:45,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:31:45,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:31:57,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:31:57,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:31:57,445 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585300424]
[2024-06-20 18:31:57,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585300424] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:31:57,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:31:57,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:31:57,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4722149]
[2024-06-20 18:31:57,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:31:57,445 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:31:57,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:31:57,446 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:31:57,446 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:31:57,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:31:57,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 176 transitions, 2056 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:31:57,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:31:57,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:31:57,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:31:59,897 INFO  L124   PetriNetUnfolderBase]: 3009/4751 cut-off events.
[2024-06-20 18:31:59,897 INFO  L125   PetriNetUnfolderBase]: For 321936/321936 co-relation queries the response was YES.
[2024-06-20 18:31:59,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35822 conditions, 4751 events. 3009/4751 cut-off events. For 321936/321936 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 27141 event pairs, 760 based on Foata normal form. 20/4770 useless extension candidates. Maximal degree in co-relation 35746. Up to 4000 conditions per place. 
[2024-06-20 18:31:59,932 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 139 selfloop transitions, 72 changer transitions 0/224 dead transitions.
[2024-06-20 18:31:59,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 224 transitions, 2821 flow
[2024-06-20 18:31:59,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:31:59,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:31:59,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-20 18:31:59,936 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5079365079365079
[2024-06-20 18:31:59,936 INFO  L175             Difference]: Start difference. First operand has 160 places, 176 transitions, 2056 flow. Second operand 9 states and 192 transitions.
[2024-06-20 18:31:59,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 224 transitions, 2821 flow
[2024-06-20 18:32:00,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 224 transitions, 2698 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-20 18:32:00,148 INFO  L231             Difference]: Finished difference. Result has 164 places, 177 transitions, 2127 flow
[2024-06-20 18:32:00,148 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2127, PETRI_PLACES=164, PETRI_TRANSITIONS=177}
[2024-06-20 18:32:00,149 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 121 predicate places.
[2024-06-20 18:32:00,149 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 177 transitions, 2127 flow
[2024-06-20 18:32:00,149 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:32:00,149 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:32:00,149 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:32:00,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 18:32:00,150 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-20 18:32:00,150 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:32:00,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 352424694, now seen corresponding path program 9 times
[2024-06-20 18:32:00,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:32:00,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504201611]
[2024-06-20 18:32:00,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:32:00,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:32:00,209 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:32:13,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:32:13,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:32:13,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504201611]
[2024-06-20 18:32:13,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504201611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:32:13,604 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:32:13,604 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:32:13,604 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701845346]
[2024-06-20 18:32:13,604 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:32:13,604 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:32:13,604 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:32:13,604 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:32:13,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:32:14,068 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:32:14,068 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 177 transitions, 2127 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:32:14,068 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:32:14,068 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:32:14,068 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:32:16,398 INFO  L124   PetriNetUnfolderBase]: 3084/4875 cut-off events.
[2024-06-20 18:32:16,398 INFO  L125   PetriNetUnfolderBase]: For 335212/335212 co-relation queries the response was YES.
[2024-06-20 18:32:16,420 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36874 conditions, 4875 events. 3084/4875 cut-off events. For 335212/335212 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 28074 event pairs, 790 based on Foata normal form. 20/4894 useless extension candidates. Maximal degree in co-relation 36796. Up to 4276 conditions per place. 
[2024-06-20 18:32:16,438 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 165 selfloop transitions, 43 changer transitions 0/221 dead transitions.
[2024-06-20 18:32:16,439 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 221 transitions, 2712 flow
[2024-06-20 18:32:16,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:32:16,441 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:32:16,442 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 198 transitions.
[2024-06-20 18:32:16,442 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4714285714285714
[2024-06-20 18:32:16,442 INFO  L175             Difference]: Start difference. First operand has 164 places, 177 transitions, 2127 flow. Second operand 10 states and 198 transitions.
[2024-06-20 18:32:16,442 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 221 transitions, 2712 flow
[2024-06-20 18:32:16,691 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 221 transitions, 2555 flow, removed 8 selfloop flow, removed 7 redundant places.
[2024-06-20 18:32:16,694 INFO  L231             Difference]: Finished difference. Result has 167 places, 178 transitions, 2104 flow
[2024-06-20 18:32:16,695 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1970, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2104, PETRI_PLACES=167, PETRI_TRANSITIONS=178}
[2024-06-20 18:32:16,695 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 124 predicate places.
[2024-06-20 18:32:16,695 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 178 transitions, 2104 flow
[2024-06-20 18:32:16,695 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:32:16,696 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:32:16,696 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:32:16,696 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 18:32:16,696 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-20 18:32:16,696 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:32:16,696 INFO  L85        PathProgramCache]: Analyzing trace with hash 347062314, now seen corresponding path program 10 times
[2024-06-20 18:32:16,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:32:16,697 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542510476]
[2024-06-20 18:32:16,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:32:16,697 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:32:16,764 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:32:28,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:32:28,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:32:28,564 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542510476]
[2024-06-20 18:32:28,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542510476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:32:28,565 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:32:28,565 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:32:28,565 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516003683]
[2024-06-20 18:32:28,565 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:32:28,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:32:28,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:32:28,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:32:28,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:32:28,831 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:32:28,831 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 178 transitions, 2104 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:32:28,831 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:32:28,831 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:32:28,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:32:31,225 INFO  L124   PetriNetUnfolderBase]: 3159/5001 cut-off events.
[2024-06-20 18:32:31,226 INFO  L125   PetriNetUnfolderBase]: For 350746/350746 co-relation queries the response was YES.
[2024-06-20 18:32:31,245 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37656 conditions, 5001 events. 3159/5001 cut-off events. For 350746/350746 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29059 event pairs, 785 based on Foata normal form. 20/5020 useless extension candidates. Maximal degree in co-relation 37577. Up to 4372 conditions per place. 
[2024-06-20 18:32:31,262 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 156 selfloop transitions, 54 changer transitions 0/223 dead transitions.
[2024-06-20 18:32:31,262 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 223 transitions, 2867 flow
[2024-06-20 18:32:31,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:32:31,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:32:31,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions.
[2024-06-20 18:32:31,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4947089947089947
[2024-06-20 18:32:31,265 INFO  L175             Difference]: Start difference. First operand has 167 places, 178 transitions, 2104 flow. Second operand 9 states and 187 transitions.
[2024-06-20 18:32:31,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 223 transitions, 2867 flow
[2024-06-20 18:32:31,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 223 transitions, 2766 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-20 18:32:31,505 INFO  L231             Difference]: Finished difference. Result has 168 places, 179 transitions, 2161 flow
[2024-06-20 18:32:31,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2003, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2161, PETRI_PLACES=168, PETRI_TRANSITIONS=179}
[2024-06-20 18:32:31,505 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-20 18:32:31,505 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 179 transitions, 2161 flow
[2024-06-20 18:32:31,505 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:32:31,505 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:32:31,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:32:31,506 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 18:32:31,506 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:32:31,506 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:32:31,506 INFO  L85        PathProgramCache]: Analyzing trace with hash -1117800734, now seen corresponding path program 1 times
[2024-06-20 18:32:31,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:32:31,506 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973872263]
[2024-06-20 18:32:31,507 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:32:31,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:32:31,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:32:46,308 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:32:46,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:32:46,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973872263]
[2024-06-20 18:32:46,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973872263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:32:46,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:32:46,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:32:46,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933772304]
[2024-06-20 18:32:46,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:32:46,309 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:32:46,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:32:46,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:32:46,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:32:46,502 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:32:46,503 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 179 transitions, 2161 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-20 18:32:46,503 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:32:46,503 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:32:46,503 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:32:48,795 INFO  L124   PetriNetUnfolderBase]: 3754/5813 cut-off events.
[2024-06-20 18:32:48,796 INFO  L125   PetriNetUnfolderBase]: For 392948/392948 co-relation queries the response was YES.
[2024-06-20 18:32:48,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42904 conditions, 5813 events. 3754/5813 cut-off events. For 392948/392948 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 32645 event pairs, 1216 based on Foata normal form. 3/5795 useless extension candidates. Maximal degree in co-relation 42824. Up to 5626 conditions per place. 
[2024-06-20 18:32:48,840 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 165 selfloop transitions, 23 changer transitions 0/208 dead transitions.
[2024-06-20 18:32:48,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 208 transitions, 2765 flow
[2024-06-20 18:32:48,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:32:48,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:32:48,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-20 18:32:48,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445578231292517
[2024-06-20 18:32:48,842 INFO  L175             Difference]: Start difference. First operand has 168 places, 179 transitions, 2161 flow. Second operand 7 states and 131 transitions.
[2024-06-20 18:32:48,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 208 transitions, 2765 flow
[2024-06-20 18:32:49,095 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 208 transitions, 2640 flow, removed 10 selfloop flow, removed 7 redundant places.
[2024-06-20 18:32:49,098 INFO  L231             Difference]: Finished difference. Result has 168 places, 185 transitions, 2174 flow
[2024-06-20 18:32:49,099 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2174, PETRI_PLACES=168, PETRI_TRANSITIONS=185}
[2024-06-20 18:32:49,099 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 125 predicate places.
[2024-06-20 18:32:49,099 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 185 transitions, 2174 flow
[2024-06-20 18:32:49,099 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-20 18:32:49,100 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:32:49,100 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:32:49,100 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 18:32:49,100 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:32:49,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:32:49,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -1117801137, now seen corresponding path program 2 times
[2024-06-20 18:32:49,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:32:49,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347064434]
[2024-06-20 18:32:49,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:32:49,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:32:49,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:02,602 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:33:02,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:02,603 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347064434]
[2024-06-20 18:33:02,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347064434] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:02,603 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:02,603 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:33:02,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296362303]
[2024-06-20 18:33:02,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:02,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:33:02,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:02,603 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:33:02,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:33:02,774 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 18:33:02,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 185 transitions, 2174 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:02,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:02,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 18:33:02,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:05,132 INFO  L124   PetriNetUnfolderBase]: 3932/6018 cut-off events.
[2024-06-20 18:33:05,133 INFO  L125   PetriNetUnfolderBase]: For 406329/406331 co-relation queries the response was YES.
[2024-06-20 18:33:05,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44366 conditions, 6018 events. 3932/6018 cut-off events. For 406329/406331 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 33267 event pairs, 1233 based on Foata normal form. 4/6022 useless extension candidates. Maximal degree in co-relation 44285. Up to 5859 conditions per place. 
[2024-06-20 18:33:05,179 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 166 selfloop transitions, 42 changer transitions 0/211 dead transitions.
[2024-06-20 18:33:05,180 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 211 transitions, 2927 flow
[2024-06-20 18:33:05,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:33:05,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:33:05,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions.
[2024-06-20 18:33:05,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4217687074829932
[2024-06-20 18:33:05,181 INFO  L175             Difference]: Start difference. First operand has 168 places, 185 transitions, 2174 flow. Second operand 7 states and 124 transitions.
[2024-06-20 18:33:05,181 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 211 transitions, 2927 flow
[2024-06-20 18:33:05,596 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 211 transitions, 2879 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-20 18:33:05,600 INFO  L231             Difference]: Finished difference. Result has 173 places, 193 transitions, 2337 flow
[2024-06-20 18:33:05,601 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2337, PETRI_PLACES=173, PETRI_TRANSITIONS=193}
[2024-06-20 18:33:05,601 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 130 predicate places.
[2024-06-20 18:33:05,601 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 193 transitions, 2337 flow
[2024-06-20 18:33:05,601 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:05,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:05,602 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:05,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 18:33:05,602 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:33:05,602 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:05,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -380079407, now seen corresponding path program 1 times
[2024-06-20 18:33:05,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:05,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292216623]
[2024-06-20 18:33:05,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:05,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:05,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:17,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:33:17,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:17,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292216623]
[2024-06-20 18:33:17,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292216623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:17,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:17,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:33:17,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043370058]
[2024-06-20 18:33:17,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:17,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:33:17,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:17,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:33:17,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:33:17,722 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:33:17,723 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 193 transitions, 2337 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:17,723 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:17,723 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:33:17,723 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:20,421 INFO  L124   PetriNetUnfolderBase]: 3848/5953 cut-off events.
[2024-06-20 18:33:20,422 INFO  L125   PetriNetUnfolderBase]: For 430234/430234 co-relation queries the response was YES.
[2024-06-20 18:33:20,445 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44691 conditions, 5953 events. 3848/5953 cut-off events. For 430234/430234 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 33373 event pairs, 1140 based on Foata normal form. 8/5961 useless extension candidates. Maximal degree in co-relation 44607. Up to 5683 conditions per place. 
[2024-06-20 18:33:20,463 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 187 selfloop transitions, 22 changer transitions 0/223 dead transitions.
[2024-06-20 18:33:20,464 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 223 transitions, 2913 flow
[2024-06-20 18:33:20,466 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:33:20,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:33:20,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-20 18:33:20,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-20 18:33:20,467 INFO  L175             Difference]: Start difference. First operand has 173 places, 193 transitions, 2337 flow. Second operand 8 states and 144 transitions.
[2024-06-20 18:33:20,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 223 transitions, 2913 flow
[2024-06-20 18:33:20,842 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 223 transitions, 2826 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-20 18:33:20,846 INFO  L231             Difference]: Finished difference. Result has 178 places, 196 transitions, 2399 flow
[2024-06-20 18:33:20,846 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2250, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2399, PETRI_PLACES=178, PETRI_TRANSITIONS=196}
[2024-06-20 18:33:20,846 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 135 predicate places.
[2024-06-20 18:33:20,846 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 196 transitions, 2399 flow
[2024-06-20 18:33:20,847 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:20,847 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:20,847 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:20,847 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 18:33:20,847 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:33:20,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:20,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457475153, now seen corresponding path program 2 times
[2024-06-20 18:33:20,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:20,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723483142]
[2024-06-20 18:33:20,848 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:20,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:20,907 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:32,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:33:32,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:32,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723483142]
[2024-06-20 18:33:32,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723483142] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:32,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:32,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:33:32,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803487328]
[2024-06-20 18:33:32,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:32,244 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:33:32,244 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:32,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:33:32,245 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:33:32,485 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:33:32,486 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 196 transitions, 2399 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:32,486 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:32,486 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:33:32,486 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:35,127 INFO  L124   PetriNetUnfolderBase]: 3839/5940 cut-off events.
[2024-06-20 18:33:35,127 INFO  L125   PetriNetUnfolderBase]: For 439267/439267 co-relation queries the response was YES.
[2024-06-20 18:33:35,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44884 conditions, 5940 events. 3839/5940 cut-off events. For 439267/439267 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 33313 event pairs, 1115 based on Foata normal form. 4/5944 useless extension candidates. Maximal degree in co-relation 44799. Up to 5652 conditions per place. 
[2024-06-20 18:33:35,174 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 190 selfloop transitions, 29 changer transitions 0/233 dead transitions.
[2024-06-20 18:33:35,174 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 233 transitions, 2999 flow
[2024-06-20 18:33:35,177 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:33:35,177 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:33:35,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 18:33:35,177 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4312169312169312
[2024-06-20 18:33:35,177 INFO  L175             Difference]: Start difference. First operand has 178 places, 196 transitions, 2399 flow. Second operand 9 states and 163 transitions.
[2024-06-20 18:33:35,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 233 transitions, 2999 flow
[2024-06-20 18:33:35,614 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 233 transitions, 2880 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-20 18:33:35,617 INFO  L231             Difference]: Finished difference. Result has 182 places, 201 transitions, 2435 flow
[2024-06-20 18:33:35,617 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2280, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2435, PETRI_PLACES=182, PETRI_TRANSITIONS=201}
[2024-06-20 18:33:35,618 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 139 predicate places.
[2024-06-20 18:33:35,618 INFO  L495      AbstractCegarLoop]: Abstraction has has 182 places, 201 transitions, 2435 flow
[2024-06-20 18:33:35,618 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:35,618 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:35,618 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:35,619 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 18:33:35,619 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:33:35,619 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:35,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -67739270, now seen corresponding path program 11 times
[2024-06-20 18:33:35,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:35,620 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604325255]
[2024-06-20 18:33:35,620 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:35,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:35,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:33:48,393 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:33:48,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:33:48,393 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604325255]
[2024-06-20 18:33:48,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604325255] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:33:48,393 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:33:48,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:33:48,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168381858]
[2024-06-20 18:33:48,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:33:48,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:33:48,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:33:48,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:33:48,394 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:33:48,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:33:48,717 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 201 transitions, 2435 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:48,717 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:33:48,717 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:33:48,717 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:33:51,305 INFO  L124   PetriNetUnfolderBase]: 3490/5509 cut-off events.
[2024-06-20 18:33:51,306 INFO  L125   PetriNetUnfolderBase]: For 461596/461596 co-relation queries the response was YES.
[2024-06-20 18:33:51,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42302 conditions, 5509 events. 3490/5509 cut-off events. For 461596/461596 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 32232 event pairs, 960 based on Foata normal form. 36/5545 useless extension candidates. Maximal degree in co-relation 42215. Up to 4916 conditions per place. 
[2024-06-20 18:33:51,356 INFO  L140   encePairwiseOnDemand]: 30/42 looper letters, 194 selfloop transitions, 33 changer transitions 0/243 dead transitions.
[2024-06-20 18:33:51,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 243 transitions, 3240 flow
[2024-06-20 18:33:51,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:33:51,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:33:51,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 18:33:51,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 18:33:51,359 INFO  L175             Difference]: Start difference. First operand has 182 places, 201 transitions, 2435 flow. Second operand 10 states and 190 transitions.
[2024-06-20 18:33:51,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 243 transitions, 3240 flow
[2024-06-20 18:33:51,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 243 transitions, 3131 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-20 18:33:51,684 INFO  L231             Difference]: Finished difference. Result has 186 places, 202 transitions, 2447 flow
[2024-06-20 18:33:51,684 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2447, PETRI_PLACES=186, PETRI_TRANSITIONS=202}
[2024-06-20 18:33:51,684 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-20 18:33:51,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 2447 flow
[2024-06-20 18:33:51,684 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:33:51,684 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:33:51,685 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:33:51,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 18:33:51,685 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-20 18:33:51,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:33:51,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 1798937775, now seen corresponding path program 3 times
[2024-06-20 18:33:51,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:33:51,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830237572]
[2024-06-20 18:33:51,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:33:51,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:33:51,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:03,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:34:03,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:03,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830237572]
[2024-06-20 18:34:03,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830237572] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:03,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:03,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:34:03,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936597215]
[2024-06-20 18:34:03,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:03,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:34:03,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:03,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:34:03,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:34:04,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:34:04,016 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 202 transitions, 2447 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:04,016 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:04,016 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:34:04,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:06,645 INFO  L124   PetriNetUnfolderBase]: 3907/6064 cut-off events.
[2024-06-20 18:34:06,645 INFO  L125   PetriNetUnfolderBase]: For 453909/453909 co-relation queries the response was YES.
[2024-06-20 18:34:06,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45616 conditions, 6064 events. 3907/6064 cut-off events. For 453909/453909 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 34356 event pairs, 1087 based on Foata normal form. 4/6068 useless extension candidates. Maximal degree in co-relation 45528. Up to 5830 conditions per place. 
[2024-06-20 18:34:06,692 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 199 selfloop transitions, 17 changer transitions 0/230 dead transitions.
[2024-06-20 18:34:06,692 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 230 transitions, 3001 flow
[2024-06-20 18:34:06,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:34:06,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:34:06,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-20 18:34:06,695 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4226190476190476
[2024-06-20 18:34:06,695 INFO  L175             Difference]: Start difference. First operand has 186 places, 202 transitions, 2447 flow. Second operand 8 states and 142 transitions.
[2024-06-20 18:34:06,695 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 230 transitions, 3001 flow
[2024-06-20 18:34:07,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 230 transitions, 2909 flow, removed 16 selfloop flow, removed 8 redundant places.
[2024-06-20 18:34:07,250 INFO  L231             Difference]: Finished difference. Result has 186 places, 204 transitions, 2456 flow
[2024-06-20 18:34:07,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2355, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2456, PETRI_PLACES=186, PETRI_TRANSITIONS=204}
[2024-06-20 18:34:07,251 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 143 predicate places.
[2024-06-20 18:34:07,251 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 204 transitions, 2456 flow
[2024-06-20 18:34:07,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:07,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:07,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:07,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 18:34:07,251 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-20 18:34:07,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:07,252 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457259672, now seen corresponding path program 12 times
[2024-06-20 18:34:07,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:07,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904552617]
[2024-06-20 18:34:07,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:07,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:07,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:20,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:34:20,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:20,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904552617]
[2024-06-20 18:34:20,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904552617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:20,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:20,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:34:20,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879056927]
[2024-06-20 18:34:20,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:20,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:34:20,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:20,775 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:34:20,775 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:34:20,999 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42
[2024-06-20 18:34:21,000 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 204 transitions, 2456 flow. Second operand  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:21,000 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:21,000 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42
[2024-06-20 18:34:21,000 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:23,677 INFO  L124   PetriNetUnfolderBase]: 3447/5442 cut-off events.
[2024-06-20 18:34:23,677 INFO  L125   PetriNetUnfolderBase]: For 442337/442337 co-relation queries the response was YES.
[2024-06-20 18:34:23,702 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40977 conditions, 5442 events. 3447/5442 cut-off events. For 442337/442337 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 31816 event pairs, 915 based on Foata normal form. 20/5462 useless extension candidates. Maximal degree in co-relation 40888. Up to 4975 conditions per place. 
[2024-06-20 18:34:23,725 INFO  L140   encePairwiseOnDemand]: 29/42 looper letters, 200 selfloop transitions, 28 changer transitions 0/244 dead transitions.
[2024-06-20 18:34:23,725 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 244 transitions, 3034 flow
[2024-06-20 18:34:23,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:34:23,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:34:23,728 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 190 transitions.
[2024-06-20 18:34:23,728 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4523809523809524
[2024-06-20 18:34:23,728 INFO  L175             Difference]: Start difference. First operand has 186 places, 204 transitions, 2456 flow. Second operand 10 states and 190 transitions.
[2024-06-20 18:34:23,728 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 244 transitions, 3034 flow
[2024-06-20 18:34:24,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 244 transitions, 2939 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-20 18:34:24,157 INFO  L231             Difference]: Finished difference. Result has 190 places, 204 transitions, 2424 flow
[2024-06-20 18:34:24,157 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2361, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2424, PETRI_PLACES=190, PETRI_TRANSITIONS=204}
[2024-06-20 18:34:24,157 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-20 18:34:24,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 204 transitions, 2424 flow
[2024-06-20 18:34:24,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 11 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:24,158 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:24,158 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:24,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 18:34:24,158 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-20 18:34:24,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:24,158 INFO  L85        PathProgramCache]: Analyzing trace with hash 198173212, now seen corresponding path program 1 times
[2024-06-20 18:34:24,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:24,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311395301]
[2024-06-20 18:34:24,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:24,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:24,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:35,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:34:35,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:35,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311395301]
[2024-06-20 18:34:35,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311395301] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:35,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:35,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-20 18:34:35,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184858278]
[2024-06-20 18:34:35,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:35,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-20 18:34:35,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:35,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-20 18:34:35,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2024-06-20 18:34:35,601 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:34:35,604 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 204 transitions, 2424 flow. Second operand  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:35,604 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:35,604 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:34:35,604 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:38,107 INFO  L124   PetriNetUnfolderBase]: 3843/5956 cut-off events.
[2024-06-20 18:34:38,108 INFO  L125   PetriNetUnfolderBase]: For 444869/444869 co-relation queries the response was YES.
[2024-06-20 18:34:38,136 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43726 conditions, 5956 events. 3843/5956 cut-off events. For 444869/444869 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 33559 event pairs, 1094 based on Foata normal form. 2/5958 useless extension candidates. Maximal degree in co-relation 43636. Up to 5676 conditions per place. 
[2024-06-20 18:34:38,155 INFO  L140   encePairwiseOnDemand]: 31/42 looper letters, 193 selfloop transitions, 25 changer transitions 0/232 dead transitions.
[2024-06-20 18:34:38,155 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 232 transitions, 2938 flow
[2024-06-20 18:34:38,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:34:38,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:34:38,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 18:34:38,158 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43452380952380953
[2024-06-20 18:34:38,158 INFO  L175             Difference]: Start difference. First operand has 190 places, 204 transitions, 2424 flow. Second operand 8 states and 146 transitions.
[2024-06-20 18:34:38,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 232 transitions, 2938 flow
[2024-06-20 18:34:38,645 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 232 transitions, 2835 flow, removed 14 selfloop flow, removed 9 redundant places.
[2024-06-20 18:34:38,648 INFO  L231             Difference]: Finished difference. Result has 189 places, 204 transitions, 2383 flow
[2024-06-20 18:34:38,648 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2383, PETRI_PLACES=189, PETRI_TRANSITIONS=204}
[2024-06-20 18:34:38,648 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 146 predicate places.
[2024-06-20 18:34:38,648 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 204 transitions, 2383 flow
[2024-06-20 18:34:38,649 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:38,649 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:38,649 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:38,649 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 18:34:38,649 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:34:38,649 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:38,649 INFO  L85        PathProgramCache]: Analyzing trace with hash -1595269291, now seen corresponding path program 3 times
[2024-06-20 18:34:38,649 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:38,649 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548485289]
[2024-06-20 18:34:38,649 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:38,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:38,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:34:51,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:34:51,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:34:51,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548485289]
[2024-06-20 18:34:51,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548485289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:34:51,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:34:51,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:34:51,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835534133]
[2024-06-20 18:34:51,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:34:51,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:34:51,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:34:51,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:34:51,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:34:52,129 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 42
[2024-06-20 18:34:52,130 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 204 transitions, 2383 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:52,130 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:34:52,130 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 42
[2024-06-20 18:34:52,130 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:34:54,440 INFO  L124   PetriNetUnfolderBase]: 3958/6071 cut-off events.
[2024-06-20 18:34:54,440 INFO  L125   PetriNetUnfolderBase]: For 452756/452758 co-relation queries the response was YES.
[2024-06-20 18:34:54,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44100 conditions, 6071 events. 3958/6071 cut-off events. For 452756/452758 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 33757 event pairs, 1194 based on Foata normal form. 4/6075 useless extension candidates. Maximal degree in co-relation 44009. Up to 6018 conditions per place. 
[2024-06-20 18:34:54,483 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 187 selfloop transitions, 25 changer transitions 0/215 dead transitions.
[2024-06-20 18:34:54,483 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 215 transitions, 2943 flow
[2024-06-20 18:34:54,484 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:34:54,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:34:54,484 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions.
[2024-06-20 18:34:54,484 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3877551020408163
[2024-06-20 18:34:54,484 INFO  L175             Difference]: Start difference. First operand has 189 places, 204 transitions, 2383 flow. Second operand 7 states and 114 transitions.
[2024-06-20 18:34:54,484 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 215 transitions, 2943 flow
[2024-06-20 18:34:54,974 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 215 transitions, 2865 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-20 18:34:54,977 INFO  L231             Difference]: Finished difference. Result has 188 places, 204 transitions, 2365 flow
[2024-06-20 18:34:54,978 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2307, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2365, PETRI_PLACES=188, PETRI_TRANSITIONS=204}
[2024-06-20 18:34:54,978 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 145 predicate places.
[2024-06-20 18:34:54,978 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 204 transitions, 2365 flow
[2024-06-20 18:34:54,978 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:34:54,978 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:34:54,979 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:34:54,979 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 18:34:54,979 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:34:54,979 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:34:54,979 INFO  L85        PathProgramCache]: Analyzing trace with hash -1595268888, now seen corresponding path program 2 times
[2024-06-20 18:34:54,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:34:54,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932445485]
[2024-06-20 18:34:54,980 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:34:54,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:34:55,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:08,558 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:35:08,558 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:08,558 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932445485]
[2024-06-20 18:35:08,558 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932445485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:08,558 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:08,559 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:35:08,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580127556]
[2024-06-20 18:35:08,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:08,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:35:08,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:08,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:35:08,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:35:08,726 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:35:08,727 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 204 transitions, 2365 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-20 18:35:08,727 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:08,727 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:35:08,727 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:11,081 INFO  L124   PetriNetUnfolderBase]: 3829/5932 cut-off events.
[2024-06-20 18:35:11,081 INFO  L125   PetriNetUnfolderBase]: For 452500/452500 co-relation queries the response was YES.
[2024-06-20 18:35:11,109 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43196 conditions, 5932 events. 3829/5932 cut-off events. For 452500/452500 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 33477 event pairs, 1173 based on Foata normal form. 3/5914 useless extension candidates. Maximal degree in co-relation 43105. Up to 5750 conditions per place. 
[2024-06-20 18:35:11,129 INFO  L140   encePairwiseOnDemand]: 33/42 looper letters, 183 selfloop transitions, 19 changer transitions 0/224 dead transitions.
[2024-06-20 18:35:11,129 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 224 transitions, 2963 flow
[2024-06-20 18:35:11,130 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:35:11,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:35:11,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions.
[2024-06-20 18:35:11,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41836734693877553
[2024-06-20 18:35:11,130 INFO  L175             Difference]: Start difference. First operand has 188 places, 204 transitions, 2365 flow. Second operand 7 states and 123 transitions.
[2024-06-20 18:35:11,130 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 224 transitions, 2963 flow
[2024-06-20 18:35:11,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 224 transitions, 2833 flow, removed 15 selfloop flow, removed 8 redundant places.
[2024-06-20 18:35:11,590 INFO  L231             Difference]: Finished difference. Result has 187 places, 207 transitions, 2325 flow
[2024-06-20 18:35:11,590 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2235, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2325, PETRI_PLACES=187, PETRI_TRANSITIONS=207}
[2024-06-20 18:35:11,590 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 144 predicate places.
[2024-06-20 18:35:11,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 187 places, 207 transitions, 2325 flow
[2024-06-20 18:35:11,591 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-20 18:35:11,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:11,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:11,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 18:35:11,591 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:35:11,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:11,592 INFO  L85        PathProgramCache]: Analyzing trace with hash -733570304, now seen corresponding path program 3 times
[2024-06-20 18:35:11,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:11,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606616373]
[2024-06-20 18:35:11,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:11,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:11,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:35:24,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:35:24,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:35:24,894 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606616373]
[2024-06-20 18:35:24,894 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606616373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:35:24,894 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:35:24,894 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:35:24,894 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671621689]
[2024-06-20 18:35:24,894 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:35:24,894 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:35:24,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:35:24,895 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:35:24,895 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:35:25,093 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42
[2024-06-20 18:35:25,094 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 207 transitions, 2325 flow. Second operand  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-20 18:35:25,094 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:35:25,094 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42
[2024-06-20 18:35:25,094 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:35:27,365 INFO  L124   PetriNetUnfolderBase]: 3836/5942 cut-off events.
[2024-06-20 18:35:27,365 INFO  L125   PetriNetUnfolderBase]: For 466054/466054 co-relation queries the response was YES.
[2024-06-20 18:35:27,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43331 conditions, 5942 events. 3836/5942 cut-off events. For 466054/466054 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 33596 event pairs, 1176 based on Foata normal form. 3/5924 useless extension candidates. Maximal degree in co-relation 43241. Up to 5787 conditions per place. 
[2024-06-20 18:35:27,410 INFO  L140   encePairwiseOnDemand]: 32/42 looper letters, 189 selfloop transitions, 14 changer transitions 0/225 dead transitions.
[2024-06-20 18:35:27,410 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 225 transitions, 2827 flow
[2024-06-20 18:35:27,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:35:27,411 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:35:27,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions.
[2024-06-20 18:35:27,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3945578231292517
[2024-06-20 18:35:27,411 INFO  L175             Difference]: Start difference. First operand has 187 places, 207 transitions, 2325 flow. Second operand 7 states and 116 transitions.
[2024-06-20 18:35:27,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 225 transitions, 2827 flow
[2024-06-20 18:35:27,817 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 225 transitions, 2743 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-20 18:35:27,820 INFO  L231             Difference]: Finished difference. Result has 190 places, 213 transitions, 2359 flow
[2024-06-20 18:35:27,820 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2251, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2359, PETRI_PLACES=190, PETRI_TRANSITIONS=213}
[2024-06-20 18:35:27,821 INFO  L281   CegarLoopForPetriNet]: 43 programPoint places, 147 predicate places.
[2024-06-20 18:35:27,821 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 213 transitions, 2359 flow
[2024-06-20 18:35:27,821 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 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-20 18:35:27,821 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:35:27,821 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:35:27,821 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 18:35:27,821 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:35:27,821 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:35:27,821 INFO  L85        PathProgramCache]: Analyzing trace with hash -940490499, now seen corresponding path program 1 times
[2024-06-20 18:35:27,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:35:27,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602872854]
[2024-06-20 18:35:27,822 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:35:27,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:35:27,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15