./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version b44c8288
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false
--- Real Ultimate output ---
This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m
[2024-05-12 11:34:17,663 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-05-12 11:34:17,729 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-05-12 11:34:17,734 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-05-12 11:34:17,735 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-12 11:34:17,759 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-12 11:34:17,760 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-12 11:34:17,760 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-12 11:34:17,761 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-05-12 11:34:17,764 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-05-12 11:34:17,764 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-12 11:34:17,764 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-12 11:34:17,765 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-12 11:34:17,766 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-05-12 11:34:17,766 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-05-12 11:34:17,767 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-12 11:34:17,767 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-05-12 11:34:17,767 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-05-12 11:34:17,767 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-05-12 11:34:17,767 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-05-12 11:34:17,768 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-05-12 11:34:17,768 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-05-12 11:34:17,768 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-12 11:34:17,768 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-05-12 11:34:17,769 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-05-12 11:34:17,769 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-05-12 11:34:17,769 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-05-12 11:34:17,769 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-05-12 11:34:17,770 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-12 11:34:17,770 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-05-12 11:34:17,771 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-05-12 11:34:17,771 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-05-12 11:34:17,771 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:34:17,771 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-12 11:34:17,772 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-05-12 11:34:17,772 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-05-12 11:34:17,772 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-05-12 11:34:17,772 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-12 11:34:17,772 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-12 11:34:17,773 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-05-12 11:34:17,773 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-12 11:34:17,773 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-05-12 11:34:17,773 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-05-12 11:34:17,773 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
[2024-05-12 11:34:18,000 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-12 11:34:18,017 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-12 11:34:18,019 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-12 11:34:18,020 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-05-12 11:34:18,021 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-05-12 11:34:18,021 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.yml/witness.yml
[2024-05-12 11:34:18,239 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-05-12 11:34:18,252 INFO  L274        PluginConnector]: CDTParser initialized
[2024-05-12 11:34:18,252 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-05-12 11:34:19,282 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-05-12 11:34:19,521 INFO  L384              CDTParser]: Found 1 translation units.
[2024-05-12 11:34:19,531 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-05-12 11:34:19,544 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9abc51be/fc59b06ef72a48a69da915d46394e884/FLAGa0e9a686b
[2024-05-12 11:34:19,555 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9abc51be/fc59b06ef72a48a69da915d46394e884
[2024-05-12 11:34:19,556 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-12 11:34:19,557 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-12 11:34:19,559 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-12 11:34:19,559 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-12 11:34:19,563 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-12 11:34:19,563 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:34:18" (1/2) ...
[2024-05-12 11:34:19,564 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fba34a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:34:19, skipping insertion in model container
[2024-05-12 11:34:19,565 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:34:18" (1/2) ...
[2024-05-12 11:34:19,566 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@39ff50cf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:34:19, skipping insertion in model container
[2024-05-12 11:34:19,566 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:34:19" (2/2) ...
[2024-05-12 11:34:19,567 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26fba34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:19, skipping insertion in model container
[2024-05-12 11:34:19,567 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:34:19" (2/2) ...
[2024-05-12 11:34:19,568 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-05-12 11:34:19,689 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-05-12 11:34:19,690 INFO  L97    edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))
[2024-05-12 11:34:19,691 INFO  L97    edCorrectnessWitness]: Location invariant before [L843-L843] (((((((((((((((((((! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))
[2024-05-12 11:34:19,691 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] (((((((((((((((((((! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p2_EBX <= 1) && x <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (x == 0 || x == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))
[2024-05-12 11:34:19,692 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-05-12 11:34:19,692 INFO  L106   edCorrectnessWitness]: ghost_update [L839-L839] multithreaded = 1;
[2024-05-12 11:34:19,729 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-05-12 11:34:19,881 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009]
[2024-05-12 11:34:20,023 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:34:20,034 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
[2024-05-12 11:34:20,073 WARN  L246   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[996,1009]
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-05-12 11:34:20,457 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-05-12 11:34:20,501 INFO  L206         MainTranslator]: Completed translation
[2024-05-12 11:34:20,501 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20 WrapperNode
[2024-05-12 11:34:20,502 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-12 11:34:20,504 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-12 11:34:20,504 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-12 11:34:20,504 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-12 11:34:20,511 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,578 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,703 INFO  L138                Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 134
[2024-05-12 11:34:20,704 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-12 11:34:20,704 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-12 11:34:20,705 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-12 11:34:20,705 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-05-12 11:34:20,713 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,714 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,740 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,795 INFO  L175           MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1].
[2024-05-12 11:34:20,796 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,796 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,830 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,832 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,846 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,854 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,882 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-12 11:34:20,884 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-12 11:34:20,884 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-05-12 11:34:20,884 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-05-12 11:34:20,885 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (1/1) ...
[2024-05-12 11:34:20,890 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-05-12 11:34:20,897 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-05-12 11:34:20,913 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-05-12 11:34:20,927 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-05-12 11:34:20,955 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2024-05-12 11:34:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2024-05-12 11:34:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2024-05-12 11:34:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#3
[2024-05-12 11:34:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-12 11:34:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-12 11:34:20,956 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-12 11:34:20,957 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-12 11:34:20,957 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-05-12 11:34:20,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-05-12 11:34:20,957 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-05-12 11:34:20,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-05-12 11:34:20,957 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-05-12 11:34:20,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-05-12 11:34:20,958 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-05-12 11:34:20,958 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-05-12 11:34:20,958 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2024-05-12 11:34:20,958 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#3
[2024-05-12 11:34:20,958 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-12 11:34:20,958 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-12 11:34:20,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-12 11:34:20,960 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-05-12 11:34:21,079 INFO  L244             CfgBuilder]: Building ICFG
[2024-05-12 11:34:21,081 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-12 11:34:22,424 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-05-12 11:34:22,425 INFO  L293             CfgBuilder]: Performing block encoding
[2024-05-12 11:34:22,745 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-12 11:34:22,746 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-12 11:34:22,746 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:34:22 BoogieIcfgContainer
[2024-05-12 11:34:22,746 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-12 11:34:22,748 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-12 11:34:22,748 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-05-12 11:34:22,750 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-05-12 11:34:22,750 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:34:18" (1/4) ...
[2024-05-12 11:34:22,751 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7186696c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:34:22, skipping insertion in model container
[2024-05-12 11:34:22,751 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:34:19" (2/4) ...
[2024-05-12 11:34:22,751 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7186696c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:34:22, skipping insertion in model container
[2024-05-12 11:34:22,751 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:34:20" (3/4) ...
[2024-05-12 11:34:22,752 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7186696c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:34:22, skipping insertion in model container
[2024-05-12 11:34:22,752 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:34:22" (4/4) ...
[2024-05-12 11:34:22,753 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix025_power.oepc_power.opt_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i
[2024-05-12 11:34:22,765 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-12 11:34:22,765 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-05-12 11:34:22,765 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-12 11:34:22,874 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-05-12 11:34:22,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 108 flow
[2024-05-12 11:34:22,947 INFO  L124   PetriNetUnfolderBase]: 1/45 cut-off events.
[2024-05-12 11:34:22,947 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:34:22,951 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. 
[2024-05-12 11:34:22,951 INFO  L82        GeneralOperation]: Start removeDead. Operand has 57 places, 48 transitions, 108 flow
[2024-05-12 11:34:22,953 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 54 places, 45 transitions, 99 flow
[2024-05-12 11:34:22,971 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-05-12 11:34:22,999 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;@7d2281bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-12 11:34:22,999 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-05-12 11:34:23,022 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-05-12 11:34:23,023 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-05-12 11:34:23,023 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-05-12 11:34:23,023 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:34:23,024 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 11:34:23,024 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:34:23,028 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:34:23,028 INFO  L85        PathProgramCache]: Analyzing trace with hash -1626599668, now seen corresponding path program 1 times
[2024-05-12 11:34:23,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:34:23,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078950356]
[2024-05-12 11:34:23,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:34:23,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:34:23,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:34:28,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-05-12 11:34:28,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:34:28,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078950356]
[2024-05-12 11:34:28,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078950356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:34:28,667 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:34:28,667 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:34:28,668 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471503827]
[2024-05-12 11:34:28,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:34:28,675 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:34:28,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:34:28,701 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:34:28,702 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:34:28,799 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48
[2024-05-12 11:34:28,801 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 99 flow. Second operand  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:28,801 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:34:28,801 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48
[2024-05-12 11:34:28,802 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:34:30,304 INFO  L124   PetriNetUnfolderBase]: 3816/6303 cut-off events.
[2024-05-12 11:34:30,304 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-05-12 11:34:30,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 6303 events. 3816/6303 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 40962 event pairs, 2900 based on Foata normal form. 181/5932 useless extension candidates. Maximal degree in co-relation 11875. Up to 5482 conditions per place. 
[2024-05-12 11:34:30,333 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 43 selfloop transitions, 5 changer transitions 0/59 dead transitions.
[2024-05-12 11:34:30,334 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 59 transitions, 229 flow
[2024-05-12 11:34:30,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:34:30,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:34:30,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions.
[2024-05-12 11:34:30,343 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6597222222222222
[2024-05-12 11:34:30,344 INFO  L175             Difference]: Start difference. First operand has 54 places, 45 transitions, 99 flow. Second operand 3 states and 95 transitions.
[2024-05-12 11:34:30,345 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 59 transitions, 229 flow
[2024-05-12 11:34:30,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-05-12 11:34:30,352 INFO  L231             Difference]: Finished difference. Result has 54 places, 48 transitions, 131 flow
[2024-05-12 11:34:30,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=48}
[2024-05-12 11:34:30,356 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places.
[2024-05-12 11:34:30,356 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 131 flow
[2024-05-12 11:34:30,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:30,356 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:34:30,356 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-05-12 11:34:30,357 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-12 11:34:30,357 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:34:30,359 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:34:30,359 INFO  L85        PathProgramCache]: Analyzing trace with hash -1626598671, now seen corresponding path program 1 times
[2024-05-12 11:34:30,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:34:30,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47693702]
[2024-05-12 11:34:30,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:34:30,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:34:30,379 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:34:30,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:34:30,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:34:30,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47693702]
[2024-05-12 11:34:30,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47693702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:34:30,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:34:30,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-05-12 11:34:30,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776157876]
[2024-05-12 11:34:30,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:34:30,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-12 11:34:30,445 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:34:30,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-12 11:34:30,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-12 11:34:30,446 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 23 out of 48
[2024-05-12 11:34:30,446 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 131 flow. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:30,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:34:30,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 48
[2024-05-12 11:34:30,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:34:30,794 INFO  L124   PetriNetUnfolderBase]: 932/1803 cut-off events.
[2024-05-12 11:34:30,794 INFO  L125   PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES.
[2024-05-12 11:34:30,798 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3489 conditions, 1803 events. 932/1803 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12097 event pairs, 418 based on Foata normal form. 0/1706 useless extension candidates. Maximal degree in co-relation 3474. Up to 1189 conditions per place. 
[2024-05-12 11:34:30,803 INFO  L140   encePairwiseOnDemand]: 45/48 looper letters, 37 selfloop transitions, 3 changer transitions 0/62 dead transitions.
[2024-05-12 11:34:30,803 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 238 flow
[2024-05-12 11:34:30,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-12 11:34:30,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-05-12 11:34:30,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions.
[2024-05-12 11:34:30,805 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7569444444444444
[2024-05-12 11:34:30,805 INFO  L175             Difference]: Start difference. First operand has 54 places, 48 transitions, 131 flow. Second operand 3 states and 109 transitions.
[2024-05-12 11:34:30,805 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 238 flow
[2024-05-12 11:34:30,806 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-05-12 11:34:30,807 INFO  L231             Difference]: Finished difference. Result has 54 places, 46 transitions, 124 flow
[2024-05-12 11:34:30,807 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=54, PETRI_TRANSITIONS=46}
[2024-05-12 11:34:30,808 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places.
[2024-05-12 11:34:30,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 124 flow
[2024-05-12 11:34:30,808 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:30,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:34:30,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:34:30,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-12 11:34:30,809 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:34:30,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:34:30,810 INFO  L85        PathProgramCache]: Analyzing trace with hash 205830090, now seen corresponding path program 1 times
[2024-05-12 11:34:30,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:34:30,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329408392]
[2024-05-12 11:34:30,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:34:30,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:34:30,866 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:34:34,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:34:34,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:34:34,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329408392]
[2024-05-12 11:34:34,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329408392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:34:34,995 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:34:34,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-12 11:34:34,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198080452]
[2024-05-12 11:34:34,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:34:34,996 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-05-12 11:34:34,996 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:34:34,996 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-05-12 11:34:34,996 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-05-12 11:34:35,093 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 48
[2024-05-12 11:34:35,093 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 124 flow. Second operand  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:35,093 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:34:35,093 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 48
[2024-05-12 11:34:35,093 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:34:36,106 INFO  L124   PetriNetUnfolderBase]: 3137/5202 cut-off events.
[2024-05-12 11:34:36,107 INFO  L125   PetriNetUnfolderBase]: For 1268/1268 co-relation queries the response was YES.
[2024-05-12 11:34:36,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11020 conditions, 5202 events. 3137/5202 cut-off events. For 1268/1268 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 32608 event pairs, 1916 based on Foata normal form. 3/5004 useless extension candidates. Maximal degree in co-relation 11004. Up to 4506 conditions per place. 
[2024-05-12 11:34:36,132 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 51 selfloop transitions, 8 changer transitions 2/72 dead transitions.
[2024-05-12 11:34:36,133 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 318 flow
[2024-05-12 11:34:36,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-05-12 11:34:36,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-05-12 11:34:36,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions.
[2024-05-12 11:34:36,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.609375
[2024-05-12 11:34:36,138 INFO  L175             Difference]: Start difference. First operand has 54 places, 46 transitions, 124 flow. Second operand 4 states and 117 transitions.
[2024-05-12 11:34:36,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 318 flow
[2024-05-12 11:34:36,140 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-05-12 11:34:36,141 INFO  L231             Difference]: Finished difference. Result has 57 places, 52 transitions, 185 flow
[2024-05-12 11:34:36,141 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=52}
[2024-05-12 11:34:36,142 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 3 predicate places.
[2024-05-12 11:34:36,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 185 flow
[2024-05-12 11:34:36,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:36,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:34:36,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:34:36,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-12 11:34:36,143 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:34:36,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:34:36,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 234239113, now seen corresponding path program 1 times
[2024-05-12 11:34:36,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:34:36,147 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499165423]
[2024-05-12 11:34:36,147 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:34:36,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:34:36,220 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:34:41,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:34:41,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:34:41,213 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499165423]
[2024-05-12 11:34:41,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499165423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:34:41,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:34:41,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:34:41,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823398376]
[2024-05-12 11:34:41,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:34:41,216 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:34:41,216 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:34:41,218 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:34:41,218 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:34:41,366 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 11:34:41,367 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 185 flow. Second operand  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:41,367 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:34:41,367 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 11:34:41,368 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:34:42,889 INFO  L124   PetriNetUnfolderBase]: 3276/5515 cut-off events.
[2024-05-12 11:34:42,890 INFO  L125   PetriNetUnfolderBase]: For 2282/2282 co-relation queries the response was YES.
[2024-05-12 11:34:42,899 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12517 conditions, 5515 events. 3276/5515 cut-off events. For 2282/2282 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 35099 event pairs, 1480 based on Foata normal form. 3/5284 useless extension candidates. Maximal degree in co-relation 12499. Up to 4665 conditions per place. 
[2024-05-12 11:34:42,916 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 72 selfloop transitions, 14 changer transitions 0/96 dead transitions.
[2024-05-12 11:34:42,916 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 96 transitions, 485 flow
[2024-05-12 11:34:42,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:34:42,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:34:42,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 164 transitions.
[2024-05-12 11:34:42,918 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5694444444444444
[2024-05-12 11:34:42,918 INFO  L175             Difference]: Start difference. First operand has 57 places, 52 transitions, 185 flow. Second operand 6 states and 164 transitions.
[2024-05-12 11:34:42,918 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 96 transitions, 485 flow
[2024-05-12 11:34:42,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 468 flow, removed 4 selfloop flow, removed 1 redundant places.
[2024-05-12 11:34:42,920 INFO  L231             Difference]: Finished difference. Result has 62 places, 58 transitions, 248 flow
[2024-05-12 11:34:42,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=62, PETRI_TRANSITIONS=58}
[2024-05-12 11:34:42,921 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places.
[2024-05-12 11:34:42,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 248 flow
[2024-05-12 11:34:42,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:42,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:34:42,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:34:42,922 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-12 11:34:42,922 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:34:42,922 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:34:42,922 INFO  L85        PathProgramCache]: Analyzing trace with hash -1328521458, now seen corresponding path program 1 times
[2024-05-12 11:34:42,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:34:42,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202544444]
[2024-05-12 11:34:42,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:34:42,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:34:42,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:34:47,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-05-12 11:34:47,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:34:47,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202544444]
[2024-05-12 11:34:47,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202544444] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:34:47,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:34:47,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:34:47,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081599937]
[2024-05-12 11:34:47,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:34:47,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:34:47,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:34:47,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:34:47,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:34:47,819 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 48
[2024-05-12 11:34:47,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 248 flow. Second operand  has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:47,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:34:47,819 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 48
[2024-05-12 11:34:47,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:34:49,333 INFO  L124   PetriNetUnfolderBase]: 3275/5506 cut-off events.
[2024-05-12 11:34:49,333 INFO  L125   PetriNetUnfolderBase]: For 4392/4392 co-relation queries the response was YES.
[2024-05-12 11:34:49,343 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13676 conditions, 5506 events. 3275/5506 cut-off events. For 4392/4392 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 34983 event pairs, 1178 based on Foata normal form. 6/5280 useless extension candidates. Maximal degree in co-relation 13655. Up to 4620 conditions per place. 
[2024-05-12 11:34:49,358 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 79 selfloop transitions, 16 changer transitions 0/105 dead transitions.
[2024-05-12 11:34:49,358 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 564 flow
[2024-05-12 11:34:49,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:34:49,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:34:49,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 186 transitions.
[2024-05-12 11:34:49,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5535714285714286
[2024-05-12 11:34:49,359 INFO  L175             Difference]: Start difference. First operand has 62 places, 58 transitions, 248 flow. Second operand 7 states and 186 transitions.
[2024-05-12 11:34:49,360 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 564 flow
[2024-05-12 11:34:49,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 534 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-05-12 11:34:49,363 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 269 flow
[2024-05-12 11:34:49,364 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2024-05-12 11:34:49,364 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places.
[2024-05-12 11:34:49,364 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 269 flow
[2024-05-12 11:34:49,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:34:49,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:34:49,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:34:49,365 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-05-12 11:34:49,365 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:34:49,365 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:34:49,365 INFO  L85        PathProgramCache]: Analyzing trace with hash -1393284120, now seen corresponding path program 1 times
[2024-05-12 11:34:49,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:34:49,366 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749658203]
[2024-05-12 11:34:49,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:34:49,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:34:49,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:00,176 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:00,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:00,176 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749658203]
[2024-05-12 11:35:00,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749658203] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:00,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:00,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:35:00,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094161589]
[2024-05-12 11:35:00,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:00,179 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:35:00,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:00,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:35:00,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:35:00,375 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:35:00,375 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 269 flow. Second operand  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:00,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:00,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:35:00,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:02,094 INFO  L124   PetriNetUnfolderBase]: 3810/6351 cut-off events.
[2024-05-12 11:35:02,095 INFO  L125   PetriNetUnfolderBase]: For 7262/7262 co-relation queries the response was YES.
[2024-05-12 11:35:02,106 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16357 conditions, 6351 events. 3810/6351 cut-off events. For 7262/7262 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 40431 event pairs, 1709 based on Foata normal form. 2/6172 useless extension candidates. Maximal degree in co-relation 16335. Up to 5452 conditions per place. 
[2024-05-12 11:35:02,124 INFO  L140   encePairwiseOnDemand]: 40/48 looper letters, 60 selfloop transitions, 11 changer transitions 0/80 dead transitions.
[2024-05-12 11:35:02,125 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 80 transitions, 471 flow
[2024-05-12 11:35:02,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:35:02,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:35:02,126 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions.
[2024-05-12 11:35:02,126 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49583333333333335
[2024-05-12 11:35:02,126 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 269 flow. Second operand 5 states and 119 transitions.
[2024-05-12 11:35:02,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 80 transitions, 471 flow
[2024-05-12 11:35:02,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 430 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-05-12 11:35:02,131 INFO  L231             Difference]: Finished difference. Result has 65 places, 62 transitions, 281 flow
[2024-05-12 11:35:02,131 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=281, PETRI_PLACES=65, PETRI_TRANSITIONS=62}
[2024-05-12 11:35:02,131 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places.
[2024-05-12 11:35:02,131 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 281 flow
[2024-05-12 11:35:02,132 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:02,132 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:02,132 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:02,132 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-05-12 11:35:02,132 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:02,132 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:02,133 INFO  L85        PathProgramCache]: Analyzing trace with hash -242133885, now seen corresponding path program 1 times
[2024-05-12 11:35:02,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:02,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105744963]
[2024-05-12 11:35:02,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:02,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:02,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:14,255 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:14,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:14,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105744963]
[2024-05-12 11:35:14,256 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105744963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:14,256 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:14,256 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:35:14,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416288106]
[2024-05-12 11:35:14,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:14,257 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:35:14,257 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:14,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:35:14,258 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:35:14,404 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:35:14,404 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 281 flow. Second operand  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:14,404 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:14,404 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:35:14,405 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:16,975 INFO  L124   PetriNetUnfolderBase]: 4474/7276 cut-off events.
[2024-05-12 11:35:16,976 INFO  L125   PetriNetUnfolderBase]: For 10820/10820 co-relation queries the response was YES.
[2024-05-12 11:35:16,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19672 conditions, 7276 events. 4474/7276 cut-off events. For 10820/10820 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 45532 event pairs, 1915 based on Foata normal form. 6/7065 useless extension candidates. Maximal degree in co-relation 19648. Up to 6258 conditions per place. 
[2024-05-12 11:35:17,008 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 77 selfloop transitions, 19 changer transitions 0/104 dead transitions.
[2024-05-12 11:35:17,009 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 623 flow
[2024-05-12 11:35:17,009 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:35:17,009 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:35:17,010 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-05-12 11:35:17,010 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5034722222222222
[2024-05-12 11:35:17,010 INFO  L175             Difference]: Start difference. First operand has 65 places, 62 transitions, 281 flow. Second operand 6 states and 145 transitions.
[2024-05-12 11:35:17,010 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 623 flow
[2024-05-12 11:35:17,014 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 596 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-05-12 11:35:17,015 INFO  L231             Difference]: Finished difference. Result has 70 places, 73 transitions, 386 flow
[2024-05-12 11:35:17,015 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=70, PETRI_TRANSITIONS=73}
[2024-05-12 11:35:17,016 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 16 predicate places.
[2024-05-12 11:35:17,016 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 386 flow
[2024-05-12 11:35:17,016 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:17,016 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:17,016 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:17,016 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-05-12 11:35:17,017 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:17,017 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:17,017 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077139686, now seen corresponding path program 1 times
[2024-05-12 11:35:17,017 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:17,017 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367125733]
[2024-05-12 11:35:17,017 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:17,018 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:17,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:26,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:26,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:26,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367125733]
[2024-05-12 11:35:26,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367125733] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:26,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:26,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:35:26,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211421853]
[2024-05-12 11:35:26,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:26,590 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:35:26,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:26,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:35:26,606 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:35:26,746 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:35:26,747 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 386 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:26,747 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:26,747 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:35:26,747 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:28,575 INFO  L124   PetriNetUnfolderBase]: 4044/6663 cut-off events.
[2024-05-12 11:35:28,575 INFO  L125   PetriNetUnfolderBase]: For 14934/14952 co-relation queries the response was YES.
[2024-05-12 11:35:28,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20050 conditions, 6663 events. 4044/6663 cut-off events. For 14934/14952 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 41715 event pairs, 1514 based on Foata normal form. 6/6433 useless extension candidates. Maximal degree in co-relation 20023. Up to 5702 conditions per place. 
[2024-05-12 11:35:28,610 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 83 selfloop transitions, 18 changer transitions 0/113 dead transitions.
[2024-05-12 11:35:28,610 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 757 flow
[2024-05-12 11:35:28,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:35:28,611 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:35:28,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions.
[2024-05-12 11:35:28,612 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5138888888888888
[2024-05-12 11:35:28,612 INFO  L175             Difference]: Start difference. First operand has 70 places, 73 transitions, 386 flow. Second operand 6 states and 148 transitions.
[2024-05-12 11:35:28,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 757 flow
[2024-05-12 11:35:28,618 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 113 transitions, 741 flow, removed 7 selfloop flow, removed 1 redundant places.
[2024-05-12 11:35:28,619 INFO  L231             Difference]: Finished difference. Result has 76 places, 83 transitions, 507 flow
[2024-05-12 11:35:28,619 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=76, PETRI_TRANSITIONS=83}
[2024-05-12 11:35:28,620 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 22 predicate places.
[2024-05-12 11:35:28,620 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 507 flow
[2024-05-12 11:35:28,620 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:28,620 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:28,621 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:28,621 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-05-12 11:35:28,621 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:28,621 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:28,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 1313464776, now seen corresponding path program 2 times
[2024-05-12 11:35:28,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:28,621 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410663148]
[2024-05-12 11:35:28,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:28,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:28,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:37,609 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:37,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:37,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410663148]
[2024-05-12 11:35:37,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410663148] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:37,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:37,610 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:35:37,610 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769548983]
[2024-05-12 11:35:37,610 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:37,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:35:37,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:37,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:35:37,611 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:35:37,755 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:35:37,755 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 507 flow. Second operand  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:37,755 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:37,756 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:35:37,756 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:39,797 INFO  L124   PetriNetUnfolderBase]: 4118/6795 cut-off events.
[2024-05-12 11:35:39,798 INFO  L125   PetriNetUnfolderBase]: For 18915/18929 co-relation queries the response was YES.
[2024-05-12 11:35:39,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21526 conditions, 6795 events. 4118/6795 cut-off events. For 18915/18929 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 43266 event pairs, 1734 based on Foata normal form. 2/6585 useless extension candidates. Maximal degree in co-relation 21495. Up to 5844 conditions per place. 
[2024-05-12 11:35:39,827 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 81 selfloop transitions, 13 changer transitions 0/106 dead transitions.
[2024-05-12 11:35:39,827 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 106 transitions, 753 flow
[2024-05-12 11:35:39,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:35:39,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:35:39,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions.
[2024-05-12 11:35:39,829 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4861111111111111
[2024-05-12 11:35:39,829 INFO  L175             Difference]: Start difference. First operand has 76 places, 83 transitions, 507 flow. Second operand 6 states and 140 transitions.
[2024-05-12 11:35:39,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 106 transitions, 753 flow
[2024-05-12 11:35:39,838 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 106 transitions, 717 flow, removed 17 selfloop flow, removed 1 redundant places.
[2024-05-12 11:35:39,840 INFO  L231             Difference]: Finished difference. Result has 81 places, 83 transitions, 505 flow
[2024-05-12 11:35:39,841 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=81, PETRI_TRANSITIONS=83}
[2024-05-12 11:35:39,842 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places.
[2024-05-12 11:35:39,842 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 505 flow
[2024-05-12 11:35:39,842 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:39,842 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:39,842 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:39,843 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-05-12 11:35:39,846 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:39,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:39,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 1833730571, now seen corresponding path program 1 times
[2024-05-12 11:35:39,846 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:39,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810751162]
[2024-05-12 11:35:39,847 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:39,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:39,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:35:49,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:35:49,434 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:35:49,434 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810751162]
[2024-05-12 11:35:49,434 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810751162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:35:49,434 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:35:49,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:35:49,434 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633543960]
[2024-05-12 11:35:49,434 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:35:49,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:35:49,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:35:49,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:35:49,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:35:49,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:35:49,612 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 505 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:49,612 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:35:49,612 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:35:49,612 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:35:51,738 INFO  L124   PetriNetUnfolderBase]: 4064/6688 cut-off events.
[2024-05-12 11:35:51,738 INFO  L125   PetriNetUnfolderBase]: For 19952/19966 co-relation queries the response was YES.
[2024-05-12 11:35:51,756 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21338 conditions, 6688 events. 4064/6688 cut-off events. For 19952/19966 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 41842 event pairs, 1468 based on Foata normal form. 2/6453 useless extension candidates. Maximal degree in co-relation 21304. Up to 5737 conditions per place. 
[2024-05-12 11:35:51,778 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 98 selfloop transitions, 15 changer transitions 0/125 dead transitions.
[2024-05-12 11:35:51,778 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 863 flow
[2024-05-12 11:35:51,779 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:35:51,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:35:51,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions.
[2024-05-12 11:35:51,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5059523809523809
[2024-05-12 11:35:51,780 INFO  L175             Difference]: Start difference. First operand has 81 places, 83 transitions, 505 flow. Second operand 7 states and 170 transitions.
[2024-05-12 11:35:51,780 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 863 flow
[2024-05-12 11:35:51,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 820 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-05-12 11:35:51,793 INFO  L231             Difference]: Finished difference. Result has 82 places, 86 transitions, 534 flow
[2024-05-12 11:35:51,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=534, PETRI_PLACES=82, PETRI_TRANSITIONS=86}
[2024-05-12 11:35:51,795 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 28 predicate places.
[2024-05-12 11:35:51,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 534 flow
[2024-05-12 11:35:51,795 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:35:51,796 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:35:51,796 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:35:51,796 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-05-12 11:35:51,796 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:35:51,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:35:51,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 1806029777, now seen corresponding path program 1 times
[2024-05-12 11:35:51,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:35:51,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566947218]
[2024-05-12 11:35:51,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:35:51,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:35:51,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:01,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:01,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:01,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566947218]
[2024-05-12 11:36:01,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566947218] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:01,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:01,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:36:01,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219944655]
[2024-05-12 11:36:01,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:01,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:36:01,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:01,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:36:01,568 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:36:01,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:01,735 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 534 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:01,735 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:01,735 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:01,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:03,833 INFO  L124   PetriNetUnfolderBase]: 4732/7600 cut-off events.
[2024-05-12 11:36:03,833 INFO  L125   PetriNetUnfolderBase]: For 27865/27865 co-relation queries the response was YES.
[2024-05-12 11:36:03,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25437 conditions, 7600 events. 4732/7600 cut-off events. For 27865/27865 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 46853 event pairs, 1552 based on Foata normal form. 6/7348 useless extension candidates. Maximal degree in co-relation 25404. Up to 6397 conditions per place. 
[2024-05-12 11:36:03,880 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 115 selfloop transitions, 31 changer transitions 0/154 dead transitions.
[2024-05-12 11:36:03,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 154 transitions, 1186 flow
[2024-05-12 11:36:03,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:03,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:03,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions.
[2024-05-12 11:36:03,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5267857142857143
[2024-05-12 11:36:03,882 INFO  L175             Difference]: Start difference. First operand has 82 places, 86 transitions, 534 flow. Second operand 7 states and 177 transitions.
[2024-05-12 11:36:03,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 154 transitions, 1186 flow
[2024-05-12 11:36:03,898 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 154 transitions, 1138 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-05-12 11:36:03,900 INFO  L231             Difference]: Finished difference. Result has 87 places, 106 transitions, 742 flow
[2024-05-12 11:36:03,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=742, PETRI_PLACES=87, PETRI_TRANSITIONS=106}
[2024-05-12 11:36:03,900 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places.
[2024-05-12 11:36:03,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 106 transitions, 742 flow
[2024-05-12 11:36:03,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:03,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:03,901 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:03,901 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-05-12 11:36:03,901 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:03,902 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:03,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -2067719451, now seen corresponding path program 2 times
[2024-05-12 11:36:03,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:03,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186398907]
[2024-05-12 11:36:03,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:03,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:03,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:13,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:13,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:13,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186398907]
[2024-05-12 11:36:13,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186398907] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:13,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:13,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:36:13,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278761142]
[2024-05-12 11:36:13,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:13,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:36:13,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:13,086 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:36:13,086 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:36:13,255 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:36:13,255 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 106 transitions, 742 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:13,255 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:13,255 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:36:13,255 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:15,312 INFO  L124   PetriNetUnfolderBase]: 4351/7144 cut-off events.
[2024-05-12 11:36:15,313 INFO  L125   PetriNetUnfolderBase]: For 34530/34575 co-relation queries the response was YES.
[2024-05-12 11:36:15,334 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26630 conditions, 7144 events. 4351/7144 cut-off events. For 34530/34575 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 44966 event pairs, 1418 based on Foata normal form. 9/6885 useless extension candidates. Maximal degree in co-relation 26593. Up to 5994 conditions per place. 
[2024-05-12 11:36:15,359 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 104 selfloop transitions, 28 changer transitions 0/150 dead transitions.
[2024-05-12 11:36:15,359 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 150 transitions, 1228 flow
[2024-05-12 11:36:15,360 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:15,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:15,361 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions.
[2024-05-12 11:36:15,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5148809523809523
[2024-05-12 11:36:15,362 INFO  L175             Difference]: Start difference. First operand has 87 places, 106 transitions, 742 flow. Second operand 7 states and 173 transitions.
[2024-05-12 11:36:15,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 150 transitions, 1228 flow
[2024-05-12 11:36:15,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 150 transitions, 1192 flow, removed 17 selfloop flow, removed 1 redundant places.
[2024-05-12 11:36:15,399 INFO  L231             Difference]: Finished difference. Result has 93 places, 112 transitions, 852 flow
[2024-05-12 11:36:15,400 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=706, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=852, PETRI_PLACES=93, PETRI_TRANSITIONS=112}
[2024-05-12 11:36:15,400 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places.
[2024-05-12 11:36:15,400 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 112 transitions, 852 flow
[2024-05-12 11:36:15,400 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:15,400 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:15,401 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:15,401 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-05-12 11:36:15,401 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:15,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:15,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 2062969247, now seen corresponding path program 2 times
[2024-05-12 11:36:15,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:15,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611403800]
[2024-05-12 11:36:15,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:15,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:15,439 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:24,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:24,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:24,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611403800]
[2024-05-12 11:36:24,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611403800] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:24,382 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:24,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:36:24,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658673558]
[2024-05-12 11:36:24,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:24,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:36:24,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:24,383 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:36:24,383 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:36:24,568 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:24,569 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 112 transitions, 852 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:24,569 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:24,569 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:24,569 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:26,932 INFO  L124   PetriNetUnfolderBase]: 4844/7844 cut-off events.
[2024-05-12 11:36:26,932 INFO  L125   PetriNetUnfolderBase]: For 45108/45108 co-relation queries the response was YES.
[2024-05-12 11:36:26,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30351 conditions, 7844 events. 4844/7844 cut-off events. For 45108/45108 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 49245 event pairs, 1827 based on Foata normal form. 6/7619 useless extension candidates. Maximal degree in co-relation 30311. Up to 6790 conditions per place. 
[2024-05-12 11:36:26,976 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 120 selfloop transitions, 26 changer transitions 0/154 dead transitions.
[2024-05-12 11:36:26,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 154 transitions, 1360 flow
[2024-05-12 11:36:26,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:26,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:26,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions.
[2024-05-12 11:36:26,993 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4880952380952381
[2024-05-12 11:36:26,993 INFO  L175             Difference]: Start difference. First operand has 93 places, 112 transitions, 852 flow. Second operand 7 states and 164 transitions.
[2024-05-12 11:36:26,993 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 154 transitions, 1360 flow
[2024-05-12 11:36:27,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 154 transitions, 1306 flow, removed 18 selfloop flow, removed 3 redundant places.
[2024-05-12 11:36:27,025 INFO  L231             Difference]: Finished difference. Result has 100 places, 122 transitions, 989 flow
[2024-05-12 11:36:27,026 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=989, PETRI_PLACES=100, PETRI_TRANSITIONS=122}
[2024-05-12 11:36:27,026 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 46 predicate places.
[2024-05-12 11:36:27,026 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 122 transitions, 989 flow
[2024-05-12 11:36:27,026 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:27,026 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:27,027 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:27,027 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-05-12 11:36:27,027 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:27,027 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:27,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 1813352597, now seen corresponding path program 3 times
[2024-05-12 11:36:27,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:27,027 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460004949]
[2024-05-12 11:36:27,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:27,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:27,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:36,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:36,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:36,101 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460004949]
[2024-05-12 11:36:36,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460004949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:36,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:36,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:36:36,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305477192]
[2024-05-12 11:36:36,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:36,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:36:36,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:36,103 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:36:36,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:36:36,285 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:36:36,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 122 transitions, 989 flow. Second operand  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:36,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:36,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:36:36,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:38,727 INFO  L124   PetriNetUnfolderBase]: 4872/7874 cut-off events.
[2024-05-12 11:36:38,728 INFO  L125   PetriNetUnfolderBase]: For 49759/49759 co-relation queries the response was YES.
[2024-05-12 11:36:38,754 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31265 conditions, 7874 events. 4872/7874 cut-off events. For 49759/49759 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 49382 event pairs, 1817 based on Foata normal form. 6/7651 useless extension candidates. Maximal degree in co-relation 31220. Up to 6690 conditions per place. 
[2024-05-12 11:36:38,781 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 125 selfloop transitions, 32 changer transitions 0/165 dead transitions.
[2024-05-12 11:36:38,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 165 transitions, 1550 flow
[2024-05-12 11:36:38,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:38,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:38,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions.
[2024-05-12 11:36:38,783 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:36:38,784 INFO  L175             Difference]: Start difference. First operand has 100 places, 122 transitions, 989 flow. Second operand 7 states and 168 transitions.
[2024-05-12 11:36:38,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 165 transitions, 1550 flow
[2024-05-12 11:36:38,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 165 transitions, 1485 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-05-12 11:36:38,812 INFO  L231             Difference]: Finished difference. Result has 105 places, 129 transitions, 1096 flow
[2024-05-12 11:36:38,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1096, PETRI_PLACES=105, PETRI_TRANSITIONS=129}
[2024-05-12 11:36:38,812 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 51 predicate places.
[2024-05-12 11:36:38,813 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 129 transitions, 1096 flow
[2024-05-12 11:36:38,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:38,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:38,813 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:38,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-05-12 11:36:38,813 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:38,814 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:38,814 INFO  L85        PathProgramCache]: Analyzing trace with hash 1813352411, now seen corresponding path program 3 times
[2024-05-12 11:36:38,814 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:38,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368691297]
[2024-05-12 11:36:38,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:38,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:38,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:36:47,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:36:47,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:36:47,848 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368691297]
[2024-05-12 11:36:47,848 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368691297] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:36:47,848 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:36:47,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-12 11:36:47,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880794434]
[2024-05-12 11:36:47,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:36:47,849 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-12 11:36:47,849 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:36:47,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-12 11:36:47,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-05-12 11:36:48,031 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:36:48,032 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 129 transitions, 1096 flow. Second operand  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:48,032 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:36:48,032 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:36:48,032 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:36:50,042 INFO  L124   PetriNetUnfolderBase]: 4521/7413 cut-off events.
[2024-05-12 11:36:50,043 INFO  L125   PetriNetUnfolderBase]: For 51824/51867 co-relation queries the response was YES.
[2024-05-12 11:36:50,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30017 conditions, 7413 events. 4521/7413 cut-off events. For 51824/51867 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 47313 event pairs, 1637 based on Foata normal form. 4/7175 useless extension candidates. Maximal degree in co-relation 29970. Up to 6319 conditions per place. 
[2024-05-12 11:36:50,091 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 123 selfloop transitions, 16 changer transitions 0/160 dead transitions.
[2024-05-12 11:36:50,091 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 160 transitions, 1458 flow
[2024-05-12 11:36:50,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:36:50,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:36:50,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-05-12 11:36:50,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4851190476190476
[2024-05-12 11:36:50,094 INFO  L175             Difference]: Start difference. First operand has 105 places, 129 transitions, 1096 flow. Second operand 7 states and 163 transitions.
[2024-05-12 11:36:50,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 160 transitions, 1458 flow
[2024-05-12 11:36:50,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 160 transitions, 1382 flow, removed 27 selfloop flow, removed 3 redundant places.
[2024-05-12 11:36:50,148 INFO  L231             Difference]: Finished difference. Result has 109 places, 129 transitions, 1060 flow
[2024-05-12 11:36:50,148 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1060, PETRI_PLACES=109, PETRI_TRANSITIONS=129}
[2024-05-12 11:36:50,148 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 55 predicate places.
[2024-05-12 11:36:50,149 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 129 transitions, 1060 flow
[2024-05-12 11:36:50,149 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:36:50,149 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:36:50,149 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:36:50,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-05-12 11:36:50,149 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:36:50,149 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:36:50,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 1813628466, now seen corresponding path program 1 times
[2024-05-12 11:36:50,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:36:50,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303129035]
[2024-05-12 11:36:50,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:36:50,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:36:50,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:02,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:02,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:02,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303129035]
[2024-05-12 11:37:02,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303129035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:02,791 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:02,791 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:37:02,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712653842]
[2024-05-12 11:37:02,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:02,792 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:37:02,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:02,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:37:02,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:37:02,952 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:37:02,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 129 transitions, 1060 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:02,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:02,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:37:02,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:05,569 INFO  L124   PetriNetUnfolderBase]: 4890/7930 cut-off events.
[2024-05-12 11:37:05,569 INFO  L125   PetriNetUnfolderBase]: For 58430/58430 co-relation queries the response was YES.
[2024-05-12 11:37:05,595 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32302 conditions, 7930 events. 4890/7930 cut-off events. For 58430/58430 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 50001 event pairs, 1757 based on Foata normal form. 6/7698 useless extension candidates. Maximal degree in co-relation 32253. Up to 6774 conditions per place. 
[2024-05-12 11:37:05,621 INFO  L140   encePairwiseOnDemand]: 38/48 looper letters, 130 selfloop transitions, 33 changer transitions 0/171 dead transitions.
[2024-05-12 11:37:05,621 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 171 transitions, 1592 flow
[2024-05-12 11:37:05,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:37:05,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:37:05,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions.
[2024-05-12 11:37:05,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:37:05,623 INFO  L175             Difference]: Start difference. First operand has 109 places, 129 transitions, 1060 flow. Second operand 7 states and 168 transitions.
[2024-05-12 11:37:05,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 171 transitions, 1592 flow
[2024-05-12 11:37:05,655 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 1544 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-05-12 11:37:05,657 INFO  L231             Difference]: Finished difference. Result has 110 places, 132 transitions, 1132 flow
[2024-05-12 11:37:05,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1132, PETRI_PLACES=110, PETRI_TRANSITIONS=132}
[2024-05-12 11:37:05,658 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places.
[2024-05-12 11:37:05,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 132 transitions, 1132 flow
[2024-05-12 11:37:05,658 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:05,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:05,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:05,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-05-12 11:37:05,658 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:05,659 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:05,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -1149234322, now seen corresponding path program 1 times
[2024-05-12 11:37:05,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:05,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633745394]
[2024-05-12 11:37:05,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:05,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:05,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:19,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:19,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:19,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633745394]
[2024-05-12 11:37:19,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633745394] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:19,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:19,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-05-12 11:37:19,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754644165]
[2024-05-12 11:37:19,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:19,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-12 11:37:19,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:19,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-12 11:37:19,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-05-12 11:37:19,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:37:19,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 1132 flow. Second operand  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-05-12 11:37:19,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:19,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:37:19,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:21,454 INFO  L124   PetriNetUnfolderBase]: 4574/7583 cut-off events.
[2024-05-12 11:37:21,454 INFO  L125   PetriNetUnfolderBase]: For 63235/63237 co-relation queries the response was YES.
[2024-05-12 11:37:21,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31716 conditions, 7583 events. 4574/7583 cut-off events. For 63235/63237 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 49186 event pairs, 1817 based on Foata normal form. 3/7355 useless extension candidates. Maximal degree in co-relation 31666. Up to 6472 conditions per place. 
[2024-05-12 11:37:21,505 INFO  L140   encePairwiseOnDemand]: 41/48 looper letters, 114 selfloop transitions, 14 changer transitions 0/146 dead transitions.
[2024-05-12 11:37:21,506 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 146 transitions, 1420 flow
[2024-05-12 11:37:21,506 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-05-12 11:37:21,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-05-12 11:37:21,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions.
[2024-05-12 11:37:21,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4791666666666667
[2024-05-12 11:37:21,507 INFO  L175             Difference]: Start difference. First operand has 110 places, 132 transitions, 1132 flow. Second operand 5 states and 115 transitions.
[2024-05-12 11:37:21,507 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 146 transitions, 1420 flow
[2024-05-12 11:37:21,538 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 1308 flow, removed 25 selfloop flow, removed 5 redundant places.
[2024-05-12 11:37:21,540 INFO  L231             Difference]: Finished difference. Result has 110 places, 132 transitions, 1058 flow
[2024-05-12 11:37:21,541 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1058, PETRI_PLACES=110, PETRI_TRANSITIONS=132}
[2024-05-12 11:37:21,541 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 56 predicate places.
[2024-05-12 11:37:21,541 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 132 transitions, 1058 flow
[2024-05-12 11:37:21,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 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-05-12 11:37:21,541 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:21,542 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:21,542 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-05-12 11:37:21,542 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:21,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:21,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 321397899, now seen corresponding path program 1 times
[2024-05-12 11:37:21,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:21,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739672248]
[2024-05-12 11:37:21,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:21,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:21,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:32,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:32,116 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:32,116 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739672248]
[2024-05-12 11:37:32,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739672248] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:32,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:32,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:37:32,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878327411]
[2024-05-12 11:37:32,117 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:32,117 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:37:32,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:32,118 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:37:32,118 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:37:32,341 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:37:32,341 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 132 transitions, 1058 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:32,341 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:32,341 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:37:32,341 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:34,907 INFO  L124   PetriNetUnfolderBase]: 4521/7414 cut-off events.
[2024-05-12 11:37:34,907 INFO  L125   PetriNetUnfolderBase]: For 65281/65314 co-relation queries the response was YES.
[2024-05-12 11:37:34,932 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31459 conditions, 7414 events. 4521/7414 cut-off events. For 65281/65314 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 46786 event pairs, 1399 based on Foata normal form. 7/7159 useless extension candidates. Maximal degree in co-relation 31408. Up to 6235 conditions per place. 
[2024-05-12 11:37:34,956 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 152 selfloop transitions, 24 changer transitions 0/198 dead transitions.
[2024-05-12 11:37:34,956 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 198 transitions, 1738 flow
[2024-05-12 11:37:34,957 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:37:34,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:37:34,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 222 transitions.
[2024-05-12 11:37:34,959 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5138888888888888
[2024-05-12 11:37:34,959 INFO  L175             Difference]: Start difference. First operand has 110 places, 132 transitions, 1058 flow. Second operand 9 states and 222 transitions.
[2024-05-12 11:37:34,959 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 198 transitions, 1738 flow
[2024-05-12 11:37:34,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 198 transitions, 1699 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-05-12 11:37:34,997 INFO  L231             Difference]: Finished difference. Result has 115 places, 138 transitions, 1177 flow
[2024-05-12 11:37:34,997 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1177, PETRI_PLACES=115, PETRI_TRANSITIONS=138}
[2024-05-12 11:37:35,006 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 61 predicate places.
[2024-05-12 11:37:35,006 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 138 transitions, 1177 flow
[2024-05-12 11:37:35,007 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:35,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:35,007 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:35,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-05-12 11:37:35,007 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:35,007 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:35,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 1899680558, now seen corresponding path program 1 times
[2024-05-12 11:37:35,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:35,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717103418]
[2024-05-12 11:37:35,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:35,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:35,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:44,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:44,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:44,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717103418]
[2024-05-12 11:37:44,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717103418] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:44,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:44,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:37:44,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315387197]
[2024-05-12 11:37:44,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:44,714 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:37:44,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:44,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:37:44,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:37:44,873 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:37:44,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 138 transitions, 1177 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:44,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:44,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:37:44,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:37:47,510 INFO  L124   PetriNetUnfolderBase]: 5087/8141 cut-off events.
[2024-05-12 11:37:47,511 INFO  L125   PetriNetUnfolderBase]: For 77999/77999 co-relation queries the response was YES.
[2024-05-12 11:37:47,534 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35776 conditions, 8141 events. 5087/8141 cut-off events. For 77999/77999 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 50469 event pairs, 1535 based on Foata normal form. 6/7873 useless extension candidates. Maximal degree in co-relation 35725. Up to 7031 conditions per place. 
[2024-05-12 11:37:47,559 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 164 selfloop transitions, 29 changer transitions 0/201 dead transitions.
[2024-05-12 11:37:47,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 201 transitions, 1935 flow
[2024-05-12 11:37:47,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:37:47,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:37:47,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 197 transitions.
[2024-05-12 11:37:47,561 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5130208333333334
[2024-05-12 11:37:47,561 INFO  L175             Difference]: Start difference. First operand has 115 places, 138 transitions, 1177 flow. Second operand 8 states and 197 transitions.
[2024-05-12 11:37:47,561 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 201 transitions, 1935 flow
[2024-05-12 11:37:47,613 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 201 transitions, 1860 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-05-12 11:37:47,615 INFO  L231             Difference]: Finished difference. Result has 120 places, 149 transitions, 1320 flow
[2024-05-12 11:37:47,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1320, PETRI_PLACES=120, PETRI_TRANSITIONS=149}
[2024-05-12 11:37:47,615 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 66 predicate places.
[2024-05-12 11:37:47,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 149 transitions, 1320 flow
[2024-05-12 11:37:47,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:47,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:37:47,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:37:47,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-05-12 11:37:47,617 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:37:47,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:37:47,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 40422919, now seen corresponding path program 2 times
[2024-05-12 11:37:47,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:37:47,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038536922]
[2024-05-12 11:37:47,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:37:47,617 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:37:47,681 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:37:57,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:37:57,507 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:37:57,507 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038536922]
[2024-05-12 11:37:57,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038536922] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:37:57,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:37:57,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:37:57,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727427067]
[2024-05-12 11:37:57,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:37:57,507 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:37:57,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:37:57,508 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:37:57,508 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:37:57,751 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:37:57,752 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 149 transitions, 1320 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:37:57,752 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:37:57,752 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:37:57,752 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:00,300 INFO  L124   PetriNetUnfolderBase]: 4693/7106 cut-off events.
[2024-05-12 11:38:00,301 INFO  L125   PetriNetUnfolderBase]: For 87677/87700 co-relation queries the response was YES.
[2024-05-12 11:38:00,325 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35213 conditions, 7106 events. 4693/7106 cut-off events. For 87677/87700 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 40719 event pairs, 1206 based on Foata normal form. 7/7036 useless extension candidates. Maximal degree in co-relation 35158. Up to 6431 conditions per place. 
[2024-05-12 11:38:00,348 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 152 selfloop transitions, 32 changer transitions 0/209 dead transitions.
[2024-05-12 11:38:00,348 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 209 transitions, 2056 flow
[2024-05-12 11:38:00,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:38:00,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:38:00,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions.
[2024-05-12 11:38:00,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052083333333334
[2024-05-12 11:38:00,350 INFO  L175             Difference]: Start difference. First operand has 120 places, 149 transitions, 1320 flow. Second operand 8 states and 194 transitions.
[2024-05-12 11:38:00,350 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 209 transitions, 2056 flow
[2024-05-12 11:38:00,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 209 transitions, 1907 flow, removed 48 selfloop flow, removed 4 redundant places.
[2024-05-12 11:38:00,420 INFO  L231             Difference]: Finished difference. Result has 125 places, 161 transitions, 1499 flow
[2024-05-12 11:38:00,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1499, PETRI_PLACES=125, PETRI_TRANSITIONS=161}
[2024-05-12 11:38:00,420 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 71 predicate places.
[2024-05-12 11:38:00,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 161 transitions, 1499 flow
[2024-05-12 11:38:00,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:00,421 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:00,421 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:00,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-05-12 11:38:00,421 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:00,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:00,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 44141989, now seen corresponding path program 3 times
[2024-05-12 11:38:00,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:00,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714654488]
[2024-05-12 11:38:00,421 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:00,421 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:00,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:10,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:10,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:10,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714654488]
[2024-05-12 11:38:10,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714654488] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:10,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:10,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:10,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339691376]
[2024-05-12 11:38:10,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:10,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:10,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:10,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:10,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:10,688 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:38:10,688 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 161 transitions, 1499 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:10,688 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:10,688 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:38:10,689 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:13,111 INFO  L124   PetriNetUnfolderBase]: 4760/7742 cut-off events.
[2024-05-12 11:38:13,111 INFO  L125   PetriNetUnfolderBase]: For 101706/101750 co-relation queries the response was YES.
[2024-05-12 11:38:13,141 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37412 conditions, 7742 events. 4760/7742 cut-off events. For 101706/101750 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 48745 event pairs, 1398 based on Foata normal form. 15/7487 useless extension candidates. Maximal degree in co-relation 37355. Up to 6472 conditions per place. 
[2024-05-12 11:38:13,169 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 152 selfloop transitions, 31 changer transitions 0/208 dead transitions.
[2024-05-12 11:38:13,169 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 208 transitions, 2055 flow
[2024-05-12 11:38:13,170 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:38:13,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:38:13,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions.
[2024-05-12 11:38:13,171 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052083333333334
[2024-05-12 11:38:13,171 INFO  L175             Difference]: Start difference. First operand has 125 places, 161 transitions, 1499 flow. Second operand 8 states and 194 transitions.
[2024-05-12 11:38:13,171 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 208 transitions, 2055 flow
[2024-05-12 11:38:13,247 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 208 transitions, 1892 flow, removed 77 selfloop flow, removed 2 redundant places.
[2024-05-12 11:38:13,249 INFO  L231             Difference]: Finished difference. Result has 131 places, 164 transitions, 1476 flow
[2024-05-12 11:38:13,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1476, PETRI_PLACES=131, PETRI_TRANSITIONS=164}
[2024-05-12 11:38:13,250 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 77 predicate places.
[2024-05-12 11:38:13,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 164 transitions, 1476 flow
[2024-05-12 11:38:13,250 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:13,250 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:13,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:13,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-05-12 11:38:13,251 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:13,251 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:13,251 INFO  L85        PathProgramCache]: Analyzing trace with hash 44142144, now seen corresponding path program 2 times
[2024-05-12 11:38:13,251 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:13,251 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621357620]
[2024-05-12 11:38:13,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:13,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:13,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:23,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:23,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:23,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621357620]
[2024-05-12 11:38:23,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621357620] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:23,439 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:23,439 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:23,439 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781482186]
[2024-05-12 11:38:23,439 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:23,440 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:23,440 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:23,440 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:23,440 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:23,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:38:23,574 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 164 transitions, 1476 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:23,574 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:23,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:38:23,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:26,350 INFO  L124   PetriNetUnfolderBase]: 5378/8505 cut-off events.
[2024-05-12 11:38:26,350 INFO  L125   PetriNetUnfolderBase]: For 122322/122324 co-relation queries the response was YES.
[2024-05-12 11:38:26,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42893 conditions, 8505 events. 5378/8505 cut-off events. For 122322/122324 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 52125 event pairs, 1519 based on Foata normal form. 8/8253 useless extension candidates. Maximal degree in co-relation 42834. Up to 6651 conditions per place. 
[2024-05-12 11:38:26,418 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 165 selfloop transitions, 59 changer transitions 0/232 dead transitions.
[2024-05-12 11:38:26,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 232 transitions, 2560 flow
[2024-05-12 11:38:26,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:38:26,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:38:26,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 206 transitions.
[2024-05-12 11:38:26,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5364583333333334
[2024-05-12 11:38:26,420 INFO  L175             Difference]: Start difference. First operand has 131 places, 164 transitions, 1476 flow. Second operand 8 states and 206 transitions.
[2024-05-12 11:38:26,420 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 232 transitions, 2560 flow
[2024-05-12 11:38:26,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 232 transitions, 2444 flow, removed 29 selfloop flow, removed 6 redundant places.
[2024-05-12 11:38:26,510 INFO  L231             Difference]: Finished difference. Result has 134 places, 175 transitions, 1658 flow
[2024-05-12 11:38:26,510 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1658, PETRI_PLACES=134, PETRI_TRANSITIONS=175}
[2024-05-12 11:38:26,510 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 80 predicate places.
[2024-05-12 11:38:26,510 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 175 transitions, 1658 flow
[2024-05-12 11:38:26,511 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:26,511 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:26,511 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:26,511 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-05-12 11:38:26,511 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:26,511 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:26,511 INFO  L85        PathProgramCache]: Analyzing trace with hash 44147724, now seen corresponding path program 3 times
[2024-05-12 11:38:26,511 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:26,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908603349]
[2024-05-12 11:38:26,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:26,512 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:26,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:35,922 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:35,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:35,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908603349]
[2024-05-12 11:38:35,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908603349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:35,923 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:35,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:35,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240300773]
[2024-05-12 11:38:35,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:35,927 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:35,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:35,928 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:35,928 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:36,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:38:36,125 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 175 transitions, 1658 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:36,125 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:36,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:38:36,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:39,019 INFO  L124   PetriNetUnfolderBase]: 5406/8543 cut-off events.
[2024-05-12 11:38:39,019 INFO  L125   PetriNetUnfolderBase]: For 136645/136647 co-relation queries the response was YES.
[2024-05-12 11:38:39,058 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45072 conditions, 8543 events. 5406/8543 cut-off events. For 136645/136647 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 52389 event pairs, 1503 based on Foata normal form. 8/8291 useless extension candidates. Maximal degree in co-relation 45011. Up to 6680 conditions per place. 
[2024-05-12 11:38:39,202 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 158 selfloop transitions, 67 changer transitions 0/233 dead transitions.
[2024-05-12 11:38:39,202 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 233 transitions, 2565 flow
[2024-05-12 11:38:39,202 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:38:39,203 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:38:39,204 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions.
[2024-05-12 11:38:39,204 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.53125
[2024-05-12 11:38:39,204 INFO  L175             Difference]: Start difference. First operand has 134 places, 175 transitions, 1658 flow. Second operand 8 states and 204 transitions.
[2024-05-12 11:38:39,204 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 233 transitions, 2565 flow
[2024-05-12 11:38:39,322 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 233 transitions, 2431 flow, removed 49 selfloop flow, removed 3 redundant places.
[2024-05-12 11:38:39,325 INFO  L231             Difference]: Finished difference. Result has 139 places, 179 transitions, 1746 flow
[2024-05-12 11:38:39,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1746, PETRI_PLACES=139, PETRI_TRANSITIONS=179}
[2024-05-12 11:38:39,326 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 85 predicate places.
[2024-05-12 11:38:39,326 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 179 transitions, 1746 flow
[2024-05-12 11:38:39,326 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:39,326 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:39,326 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:39,326 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-05-12 11:38:39,327 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:39,327 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:39,327 INFO  L85        PathProgramCache]: Analyzing trace with hash -472166137, now seen corresponding path program 1 times
[2024-05-12 11:38:39,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:39,327 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766213068]
[2024-05-12 11:38:39,328 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:39,328 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:39,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:48,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:48,159 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:48,159 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766213068]
[2024-05-12 11:38:48,159 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766213068] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:48,159 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:48,159 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:48,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889567923]
[2024-05-12 11:38:48,160 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:48,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:48,160 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:48,160 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:48,160 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:38:48,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:38:48,351 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 179 transitions, 1746 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:48,351 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:38:48,351 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:38:48,351 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:38:51,169 INFO  L124   PetriNetUnfolderBase]: 5425/8328 cut-off events.
[2024-05-12 11:38:51,169 INFO  L125   PetriNetUnfolderBase]: For 143017/143017 co-relation queries the response was YES.
[2024-05-12 11:38:51,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45493 conditions, 8328 events. 5425/8328 cut-off events. For 143017/143017 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 50076 event pairs, 1810 based on Foata normal form. 3/8179 useless extension candidates. Maximal degree in co-relation 45430. Up to 7533 conditions per place. 
[2024-05-12 11:38:51,235 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 178 selfloop transitions, 37 changer transitions 0/223 dead transitions.
[2024-05-12 11:38:51,235 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 223 transitions, 2438 flow
[2024-05-12 11:38:51,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-12 11:38:51,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-05-12 11:38:51,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions.
[2024-05-12 11:38:51,236 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49107142857142855
[2024-05-12 11:38:51,236 INFO  L175             Difference]: Start difference. First operand has 139 places, 179 transitions, 1746 flow. Second operand 7 states and 165 transitions.
[2024-05-12 11:38:51,236 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 223 transitions, 2438 flow
[2024-05-12 11:38:51,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 223 transitions, 2287 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-05-12 11:38:51,331 INFO  L231             Difference]: Finished difference. Result has 143 places, 192 transitions, 1873 flow
[2024-05-12 11:38:51,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1873, PETRI_PLACES=143, PETRI_TRANSITIONS=192}
[2024-05-12 11:38:51,332 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 89 predicate places.
[2024-05-12 11:38:51,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 192 transitions, 1873 flow
[2024-05-12 11:38:51,332 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:38:51,332 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:38:51,333 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:38:51,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-05-12 11:38:51,333 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:38:51,333 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:38:51,333 INFO  L85        PathProgramCache]: Analyzing trace with hash 2126832128, now seen corresponding path program 4 times
[2024-05-12 11:38:51,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:38:51,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177501154]
[2024-05-12 11:38:51,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:38:51,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:38:51,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:38:59,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:38:59,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:38:59,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177501154]
[2024-05-12 11:38:59,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177501154] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:38:59,826 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:38:59,826 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:38:59,826 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324623473]
[2024-05-12 11:38:59,826 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:38:59,826 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:38:59,827 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:38:59,827 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:38:59,827 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:00,061 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:39:00,061 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 192 transitions, 1873 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:00,061 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:00,061 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:39:00,062 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:02,801 INFO  L124   PetriNetUnfolderBase]: 5509/8450 cut-off events.
[2024-05-12 11:39:02,801 INFO  L125   PetriNetUnfolderBase]: For 155578/155578 co-relation queries the response was YES.
[2024-05-12 11:39:02,836 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47547 conditions, 8450 events. 5509/8450 cut-off events. For 155578/155578 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 50839 event pairs, 1795 based on Foata normal form. 6/8301 useless extension candidates. Maximal degree in co-relation 47481. Up to 7322 conditions per place. 
[2024-05-12 11:39:02,871 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 197 selfloop transitions, 39 changer transitions 0/244 dead transitions.
[2024-05-12 11:39:02,872 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 244 transitions, 2809 flow
[2024-05-12 11:39:02,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:39:02,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:39:02,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 194 transitions.
[2024-05-12 11:39:02,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5052083333333334
[2024-05-12 11:39:02,873 INFO  L175             Difference]: Start difference. First operand has 143 places, 192 transitions, 1873 flow. Second operand 8 states and 194 transitions.
[2024-05-12 11:39:02,873 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 244 transitions, 2809 flow
[2024-05-12 11:39:03,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 244 transitions, 2705 flow, removed 33 selfloop flow, removed 3 redundant places.
[2024-05-12 11:39:03,018 INFO  L231             Difference]: Finished difference. Result has 149 places, 197 transitions, 1972 flow
[2024-05-12 11:39:03,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1972, PETRI_PLACES=149, PETRI_TRANSITIONS=197}
[2024-05-12 11:39:03,019 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 95 predicate places.
[2024-05-12 11:39:03,019 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 197 transitions, 1972 flow
[2024-05-12 11:39:03,019 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:03,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:03,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:03,020 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-05-12 11:39:03,020 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:03,020 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:03,020 INFO  L85        PathProgramCache]: Analyzing trace with hash 2135083088, now seen corresponding path program 5 times
[2024-05-12 11:39:03,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:03,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690282873]
[2024-05-12 11:39:03,021 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:03,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:03,064 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:12,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:12,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:12,189 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690282873]
[2024-05-12 11:39:12,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690282873] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:12,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:12,189 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:12,189 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873270988]
[2024-05-12 11:39:12,189 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:12,191 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:12,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:12,191 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:12,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:12,354 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:39:12,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 197 transitions, 1972 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:12,355 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:12,355 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:39:12,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:15,218 INFO  L124   PetriNetUnfolderBase]: 5593/8576 cut-off events.
[2024-05-12 11:39:15,218 INFO  L125   PetriNetUnfolderBase]: For 171734/171734 co-relation queries the response was YES.
[2024-05-12 11:39:15,253 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49401 conditions, 8576 events. 5593/8576 cut-off events. For 171734/171734 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 51592 event pairs, 1830 based on Foata normal form. 6/8425 useless extension candidates. Maximal degree in co-relation 49333. Up to 7750 conditions per place. 
[2024-05-12 11:39:15,283 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 203 selfloop transitions, 30 changer transitions 0/241 dead transitions.
[2024-05-12 11:39:15,284 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 241 transitions, 2687 flow
[2024-05-12 11:39:15,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:39:15,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:39:15,285 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 187 transitions.
[2024-05-12 11:39:15,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4869791666666667
[2024-05-12 11:39:15,285 INFO  L175             Difference]: Start difference. First operand has 149 places, 197 transitions, 1972 flow. Second operand 8 states and 187 transitions.
[2024-05-12 11:39:15,285 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 241 transitions, 2687 flow
[2024-05-12 11:39:15,422 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 241 transitions, 2504 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-05-12 11:39:15,425 INFO  L231             Difference]: Finished difference. Result has 151 places, 201 transitions, 1951 flow
[2024-05-12 11:39:15,425 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1805, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1951, PETRI_PLACES=151, PETRI_TRANSITIONS=201}
[2024-05-12 11:39:15,426 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 97 predicate places.
[2024-05-12 11:39:15,426 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 201 transitions, 1951 flow
[2024-05-12 11:39:15,426 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:15,426 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:15,426 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:15,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-05-12 11:39:15,426 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:15,427 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:15,427 INFO  L85        PathProgramCache]: Analyzing trace with hash 379350613, now seen corresponding path program 4 times
[2024-05-12 11:39:15,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:15,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123780457]
[2024-05-12 11:39:15,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:15,427 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:15,501 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:25,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-05-12 11:39:25,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:25,499 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123780457]
[2024-05-12 11:39:25,499 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123780457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:25,499 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:25,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:25,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339052367]
[2024-05-12 11:39:25,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:25,501 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:25,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:25,501 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:25,502 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:25,762 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:39:25,762 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 201 transitions, 1951 flow. Second operand  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:25,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:25,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:39:25,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:28,464 INFO  L124   PetriNetUnfolderBase]: 5215/8189 cut-off events.
[2024-05-12 11:39:28,465 INFO  L125   PetriNetUnfolderBase]: For 172000/172039 co-relation queries the response was YES.
[2024-05-12 11:39:28,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47045 conditions, 8189 events. 5215/8189 cut-off events. For 172000/172039 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 50793 event pairs, 1645 based on Foata normal form. 9/8021 useless extension candidates. Maximal degree in co-relation 46976. Up to 7121 conditions per place. 
[2024-05-12 11:39:28,538 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 188 selfloop transitions, 29 changer transitions 0/251 dead transitions.
[2024-05-12 11:39:28,538 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 251 transitions, 2765 flow
[2024-05-12 11:39:28,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:39:28,539 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:39:28,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions.
[2024-05-12 11:39:28,539 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4895833333333333
[2024-05-12 11:39:28,539 INFO  L175             Difference]: Start difference. First operand has 151 places, 201 transitions, 1951 flow. Second operand 8 states and 188 transitions.
[2024-05-12 11:39:28,539 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 251 transitions, 2765 flow
[2024-05-12 11:39:28,699 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 251 transitions, 2658 flow, removed 26 selfloop flow, removed 6 redundant places.
[2024-05-12 11:39:28,702 INFO  L231             Difference]: Finished difference. Result has 155 places, 210 transitions, 2193 flow
[2024-05-12 11:39:28,703 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2193, PETRI_PLACES=155, PETRI_TRANSITIONS=210}
[2024-05-12 11:39:28,703 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 101 predicate places.
[2024-05-12 11:39:28,703 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 210 transitions, 2193 flow
[2024-05-12 11:39:28,704 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 13.444444444444445) internal successors, (121), 9 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:28,704 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:28,704 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:28,704 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-05-12 11:39:28,704 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:28,704 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:28,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 379356348, now seen corresponding path program 6 times
[2024-05-12 11:39:28,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:28,705 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492737896]
[2024-05-12 11:39:28,705 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:28,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:28,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:37,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:37,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:37,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492737896]
[2024-05-12 11:39:37,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492737896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:37,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:37,887 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:39:37,887 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611731153]
[2024-05-12 11:39:37,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:37,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:39:37,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:37,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:39:37,888 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:39:38,086 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:39:38,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 210 transitions, 2193 flow. Second operand  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:38,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:38,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:39:38,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:40,943 INFO  L124   PetriNetUnfolderBase]: 5631/8640 cut-off events.
[2024-05-12 11:39:40,943 INFO  L125   PetriNetUnfolderBase]: For 190869/190869 co-relation queries the response was YES.
[2024-05-12 11:39:40,998 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50485 conditions, 8640 events. 5631/8640 cut-off events. For 190869/190869 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 52183 event pairs, 1828 based on Foata normal form. 6/8485 useless extension candidates. Maximal degree in co-relation 50413. Up to 7427 conditions per place. 
[2024-05-12 11:39:41,034 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 204 selfloop transitions, 46 changer transitions 0/258 dead transitions.
[2024-05-12 11:39:41,034 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 258 transitions, 3012 flow
[2024-05-12 11:39:41,035 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:39:41,035 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:39:41,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions.
[2024-05-12 11:39:41,035 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5026041666666666
[2024-05-12 11:39:41,035 INFO  L175             Difference]: Start difference. First operand has 155 places, 210 transitions, 2193 flow. Second operand 8 states and 193 transitions.
[2024-05-12 11:39:41,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 258 transitions, 3012 flow
[2024-05-12 11:39:41,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 258 transitions, 2781 flow, removed 107 selfloop flow, removed 3 redundant places.
[2024-05-12 11:39:41,269 INFO  L231             Difference]: Finished difference. Result has 160 places, 214 transitions, 2144 flow
[2024-05-12 11:39:41,269 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2144, PETRI_PLACES=160, PETRI_TRANSITIONS=214}
[2024-05-12 11:39:41,273 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 106 predicate places.
[2024-05-12 11:39:41,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 214 transitions, 2144 flow
[2024-05-12 11:39:41,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:41,274 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:41,274 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:41,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-05-12 11:39:41,288 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:41,288 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:41,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -1266523533, now seen corresponding path program 1 times
[2024-05-12 11:39:41,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:41,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912198080]
[2024-05-12 11:39:41,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:41,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:41,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:39:56,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:39:56,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:39:56,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912198080]
[2024-05-12 11:39:56,496 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912198080] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:39:56,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:39:56,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:39:56,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836526010]
[2024-05-12 11:39:56,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:39:56,497 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:39:56,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:39:56,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:39:56,498 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:39:56,630 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:39:56,631 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 214 transitions, 2144 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:56,631 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:39:56,631 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:39:56,631 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:39:59,321 INFO  L124   PetriNetUnfolderBase]: 5248/8084 cut-off events.
[2024-05-12 11:39:59,322 INFO  L125   PetriNetUnfolderBase]: For 196106/196192 co-relation queries the response was YES.
[2024-05-12 11:39:59,360 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48304 conditions, 8084 events. 5248/8084 cut-off events. For 196106/196192 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 48809 event pairs, 1764 based on Foata normal form. 45/7928 useless extension candidates. Maximal degree in co-relation 48230. Up to 7308 conditions per place. 
[2024-05-12 11:39:59,391 INFO  L140   encePairwiseOnDemand]: 40/48 looper letters, 200 selfloop transitions, 17 changer transitions 0/238 dead transitions.
[2024-05-12 11:39:59,392 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 238 transitions, 2664 flow
[2024-05-12 11:39:59,392 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:39:59,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:39:59,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-05-12 11:39:59,393 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4756944444444444
[2024-05-12 11:39:59,393 INFO  L175             Difference]: Start difference. First operand has 160 places, 214 transitions, 2144 flow. Second operand 6 states and 137 transitions.
[2024-05-12 11:39:59,393 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 238 transitions, 2664 flow
[2024-05-12 11:39:59,544 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 238 transitions, 2530 flow, removed 34 selfloop flow, removed 5 redundant places.
[2024-05-12 11:39:59,547 INFO  L231             Difference]: Finished difference. Result has 161 places, 217 transitions, 2087 flow
[2024-05-12 11:39:59,547 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2010, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2087, PETRI_PLACES=161, PETRI_TRANSITIONS=217}
[2024-05-12 11:39:59,548 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 107 predicate places.
[2024-05-12 11:39:59,548 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 217 transitions, 2087 flow
[2024-05-12 11:39:59,548 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:39:59,548 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:39:59,548 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:39:59,548 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-05-12 11:39:59,548 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:39:59,549 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:39:59,549 INFO  L85        PathProgramCache]: Analyzing trace with hash 1250254280, now seen corresponding path program 1 times
[2024-05-12 11:39:59,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:39:59,549 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333426900]
[2024-05-12 11:39:59,549 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:39:59,549 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:39:59,594 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:10,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:10,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:10,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333426900]
[2024-05-12 11:40:10,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333426900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:10,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:10,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:40:10,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799051665]
[2024-05-12 11:40:10,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:10,663 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:40:10,663 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:10,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:40:10,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:40:10,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:40:10,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 217 transitions, 2087 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:10,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:10,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:40:10,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:14,018 INFO  L124   PetriNetUnfolderBase]: 5257/7987 cut-off events.
[2024-05-12 11:40:14,019 INFO  L125   PetriNetUnfolderBase]: For 205612/205651 co-relation queries the response was YES.
[2024-05-12 11:40:14,060 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49724 conditions, 7987 events. 5257/7987 cut-off events. For 205612/205651 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 46859 event pairs, 920 based on Foata normal form. 11/7902 useless extension candidates. Maximal degree in co-relation 49649. Up to 6963 conditions per place. 
[2024-05-12 11:40:14,093 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 215 selfloop transitions, 47 changer transitions 0/297 dead transitions.
[2024-05-12 11:40:14,094 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 297 transitions, 3235 flow
[2024-05-12 11:40:14,094 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:40:14,094 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:40:14,095 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 247 transitions.
[2024-05-12 11:40:14,095 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5145833333333333
[2024-05-12 11:40:14,095 INFO  L175             Difference]: Start difference. First operand has 161 places, 217 transitions, 2087 flow. Second operand 10 states and 247 transitions.
[2024-05-12 11:40:14,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 297 transitions, 3235 flow
[2024-05-12 11:40:14,331 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 297 transitions, 3180 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-05-12 11:40:14,334 INFO  L231             Difference]: Finished difference. Result has 169 places, 225 transitions, 2442 flow
[2024-05-12 11:40:14,334 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2032, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2442, PETRI_PLACES=169, PETRI_TRANSITIONS=225}
[2024-05-12 11:40:14,335 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 115 predicate places.
[2024-05-12 11:40:14,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 169 places, 225 transitions, 2442 flow
[2024-05-12 11:40:14,335 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:14,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:14,335 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:14,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-05-12 11:40:14,335 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:14,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:14,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 1363818564, now seen corresponding path program 1 times
[2024-05-12 11:40:14,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:14,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636191774]
[2024-05-12 11:40:14,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:14,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:14,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:24,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:24,912 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:24,912 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636191774]
[2024-05-12 11:40:24,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636191774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:24,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:24,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:40:24,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684602559]
[2024-05-12 11:40:24,913 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:24,913 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:40:24,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:24,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:40:24,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:40:25,026 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:40:25,027 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 225 transitions, 2442 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:40:25,027 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:25,027 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:40:25,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:28,536 INFO  L124   PetriNetUnfolderBase]: 5974/9104 cut-off events.
[2024-05-12 11:40:28,537 INFO  L125   PetriNetUnfolderBase]: For 242966/242966 co-relation queries the response was YES.
[2024-05-12 11:40:28,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57198 conditions, 9104 events. 5974/9104 cut-off events. For 242966/242966 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 54514 event pairs, 1516 based on Foata normal form. 6/8931 useless extension candidates. Maximal degree in co-relation 57120. Up to 7931 conditions per place. 
[2024-05-12 11:40:28,618 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 264 selfloop transitions, 43 changer transitions 0/315 dead transitions.
[2024-05-12 11:40:28,619 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 315 transitions, 3952 flow
[2024-05-12 11:40:28,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:40:28,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:40:28,620 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions.
[2024-05-12 11:40:28,636 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5291666666666667
[2024-05-12 11:40:28,636 INFO  L175             Difference]: Start difference. First operand has 169 places, 225 transitions, 2442 flow. Second operand 10 states and 254 transitions.
[2024-05-12 11:40:28,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 315 transitions, 3952 flow
[2024-05-12 11:40:28,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 315 transitions, 3739 flow, removed 90 selfloop flow, removed 5 redundant places.
[2024-05-12 11:40:28,950 INFO  L231             Difference]: Finished difference. Result has 176 places, 237 transitions, 2584 flow
[2024-05-12 11:40:28,950 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2229, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2584, PETRI_PLACES=176, PETRI_TRANSITIONS=237}
[2024-05-12 11:40:28,951 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 122 predicate places.
[2024-05-12 11:40:28,951 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 237 transitions, 2584 flow
[2024-05-12 11:40:28,951 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:40:28,951 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:28,951 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:28,952 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-05-12 11:40:28,952 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:28,952 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:28,952 INFO  L85        PathProgramCache]: Analyzing trace with hash 1373401028, now seen corresponding path program 2 times
[2024-05-12 11:40:28,953 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:28,953 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247873650]
[2024-05-12 11:40:28,953 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:28,953 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:29,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:38,122 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:40:38,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:38,123 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247873650]
[2024-05-12 11:40:38,123 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247873650] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:38,123 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:38,123 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:40:38,123 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792297104]
[2024-05-12 11:40:38,123 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:38,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:40:38,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:38,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:40:38,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:40:38,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:40:38,359 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 237 transitions, 2584 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:38,359 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:38,360 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:40:38,360 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:41,673 INFO  L124   PetriNetUnfolderBase]: 5640/8738 cut-off events.
[2024-05-12 11:40:41,673 INFO  L125   PetriNetUnfolderBase]: For 258346/258386 co-relation queries the response was YES.
[2024-05-12 11:40:41,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56883 conditions, 8738 events. 5640/8738 cut-off events. For 258346/258386 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 53697 event pairs, 1395 based on Foata normal form. 11/8569 useless extension candidates. Maximal degree in co-relation 56801. Up to 7569 conditions per place. 
[2024-05-12 11:40:41,765 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 242 selfloop transitions, 26 changer transitions 0/306 dead transitions.
[2024-05-12 11:40:41,765 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 306 transitions, 3390 flow
[2024-05-12 11:40:41,766 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:40:41,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:40:41,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 243 transitions.
[2024-05-12 11:40:41,767 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.50625
[2024-05-12 11:40:41,767 INFO  L175             Difference]: Start difference. First operand has 176 places, 237 transitions, 2584 flow. Second operand 10 states and 243 transitions.
[2024-05-12 11:40:41,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 306 transitions, 3390 flow
[2024-05-12 11:40:42,118 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 306 transitions, 3213 flow, removed 72 selfloop flow, removed 5 redundant places.
[2024-05-12 11:40:42,122 INFO  L231             Difference]: Finished difference. Result has 181 places, 239 transitions, 2524 flow
[2024-05-12 11:40:42,122 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2407, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2524, PETRI_PLACES=181, PETRI_TRANSITIONS=239}
[2024-05-12 11:40:42,123 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 127 predicate places.
[2024-05-12 11:40:42,123 INFO  L495      AbstractCegarLoop]: Abstraction has has 181 places, 239 transitions, 2524 flow
[2024-05-12 11:40:42,123 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:40:42,124 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:42,124 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:42,124 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-05-12 11:40:42,124 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:42,124 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:42,124 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376197662, now seen corresponding path program 2 times
[2024-05-12 11:40:42,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:42,124 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992848648]
[2024-05-12 11:40:42,125 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:42,125 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:42,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:40:52,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-05-12 11:40:52,465 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:40:52,465 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992848648]
[2024-05-12 11:40:52,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992848648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:40:52,466 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:40:52,466 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:40:52,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531556264]
[2024-05-12 11:40:52,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:40:52,466 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:40:52,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:40:52,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:40:52,467 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:40:52,713 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:40:52,713 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 239 transitions, 2524 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:40:52,713 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:40:52,714 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:40:52,714 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:40:56,226 INFO  L124   PetriNetUnfolderBase]: 6165/9085 cut-off events.
[2024-05-12 11:40:56,226 INFO  L125   PetriNetUnfolderBase]: For 274143/274143 co-relation queries the response was YES.
[2024-05-12 11:40:56,270 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60197 conditions, 9085 events. 6165/9085 cut-off events. For 274143/274143 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 51779 event pairs, 1305 based on Foata normal form. 6/9008 useless extension candidates. Maximal degree in co-relation 60113. Up to 8223 conditions per place. 
[2024-05-12 11:40:56,307 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 259 selfloop transitions, 61 changer transitions 0/328 dead transitions.
[2024-05-12 11:40:56,307 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 328 transitions, 4207 flow
[2024-05-12 11:40:56,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:40:56,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:40:56,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions.
[2024-05-12 11:40:56,309 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208333333333334
[2024-05-12 11:40:56,309 INFO  L175             Difference]: Start difference. First operand has 181 places, 239 transitions, 2524 flow. Second operand 9 states and 225 transitions.
[2024-05-12 11:40:56,309 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 328 transitions, 4207 flow
[2024-05-12 11:40:56,625 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 328 transitions, 4114 flow, removed 22 selfloop flow, removed 8 redundant places.
[2024-05-12 11:40:56,629 INFO  L231             Difference]: Finished difference. Result has 184 places, 261 transitions, 3011 flow
[2024-05-12 11:40:56,629 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2431, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3011, PETRI_PLACES=184, PETRI_TRANSITIONS=261}
[2024-05-12 11:40:56,629 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 130 predicate places.
[2024-05-12 11:40:56,630 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 261 transitions, 3011 flow
[2024-05-12 11:40:56,630 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:40:56,630 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:40:56,630 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:40:56,630 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-05-12 11:40:56,630 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:40:56,630 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:40:56,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 1376202312, now seen corresponding path program 3 times
[2024-05-12 11:40:56,631 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:40:56,631 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592916511]
[2024-05-12 11:40:56,631 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:40:56,631 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:40:56,695 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:05,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:05,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:05,836 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592916511]
[2024-05-12 11:41:05,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592916511] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:05,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:05,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:41:05,837 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675401255]
[2024-05-12 11:41:05,837 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:05,837 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:41:05,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:05,837 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:41:05,838 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:41:06,098 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:41:06,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 261 transitions, 3011 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:41:06,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:06,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:41:06,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:09,575 INFO  L124   PetriNetUnfolderBase]: 6504/9820 cut-off events.
[2024-05-12 11:41:09,576 INFO  L125   PetriNetUnfolderBase]: For 312876/312876 co-relation queries the response was YES.
[2024-05-12 11:41:09,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66740 conditions, 9820 events. 6504/9820 cut-off events. For 312876/312876 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 58814 event pairs, 1660 based on Foata normal form. 6/9656 useless extension candidates. Maximal degree in co-relation 66653. Up to 8930 conditions per place. 
[2024-05-12 11:41:09,832 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 303 selfloop transitions, 35 changer transitions 0/346 dead transitions.
[2024-05-12 11:41:09,832 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 346 transitions, 4505 flow
[2024-05-12 11:41:09,833 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:41:09,833 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:41:09,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 229 transitions.
[2024-05-12 11:41:09,835 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47708333333333336
[2024-05-12 11:41:09,835 INFO  L175             Difference]: Start difference. First operand has 184 places, 261 transitions, 3011 flow. Second operand 10 states and 229 transitions.
[2024-05-12 11:41:09,835 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 346 transitions, 4505 flow
[2024-05-12 11:41:10,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 346 transitions, 4297 flow, removed 91 selfloop flow, removed 3 redundant places.
[2024-05-12 11:41:10,237 INFO  L231             Difference]: Finished difference. Result has 196 places, 287 transitions, 3375 flow
[2024-05-12 11:41:10,237 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=2805, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3375, PETRI_PLACES=196, PETRI_TRANSITIONS=287}
[2024-05-12 11:41:10,238 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 142 predicate places.
[2024-05-12 11:41:10,238 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 287 transitions, 3375 flow
[2024-05-12 11:41:10,238 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:41:10,238 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:10,238 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:10,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-05-12 11:41:10,239 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:10,239 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:10,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253111240, now seen corresponding path program 3 times
[2024-05-12 11:41:10,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:10,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39191714]
[2024-05-12 11:41:10,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:10,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:10,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:20,788 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:20,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:20,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39191714]
[2024-05-12 11:41:20,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39191714] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:20,789 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:20,789 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:41:20,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162679891]
[2024-05-12 11:41:20,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:20,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:41:20,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:20,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:41:20,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:41:20,988 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:41:20,989 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 287 transitions, 3375 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:20,989 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:20,989 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:41:20,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:24,456 INFO  L124   PetriNetUnfolderBase]: 6112/9153 cut-off events.
[2024-05-12 11:41:24,456 INFO  L125   PetriNetUnfolderBase]: For 299335/299379 co-relation queries the response was YES.
[2024-05-12 11:41:24,517 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63062 conditions, 9153 events. 6112/9153 cut-off events. For 299335/299379 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 53652 event pairs, 1226 based on Foata normal form. 15/9071 useless extension candidates. Maximal degree in co-relation 62969. Up to 8106 conditions per place. 
[2024-05-12 11:41:24,558 INFO  L140   encePairwiseOnDemand]: 37/48 looper letters, 254 selfloop transitions, 41 changer transitions 0/345 dead transitions.
[2024-05-12 11:41:24,558 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 345 transitions, 4207 flow
[2024-05-12 11:41:24,559 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:41:24,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:41:24,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions.
[2024-05-12 11:41:24,561 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5023148148148148
[2024-05-12 11:41:24,561 INFO  L175             Difference]: Start difference. First operand has 196 places, 287 transitions, 3375 flow. Second operand 9 states and 217 transitions.
[2024-05-12 11:41:24,562 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 345 transitions, 4207 flow
[2024-05-12 11:41:25,130 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 345 transitions, 4009 flow, removed 82 selfloop flow, removed 3 redundant places.
[2024-05-12 11:41:25,134 INFO  L231             Difference]: Finished difference. Result has 202 places, 289 transitions, 3329 flow
[2024-05-12 11:41:25,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3219, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3329, PETRI_PLACES=202, PETRI_TRANSITIONS=289}
[2024-05-12 11:41:25,135 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 148 predicate places.
[2024-05-12 11:41:25,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 289 transitions, 3329 flow
[2024-05-12 11:41:25,135 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:25,135 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:25,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:25,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-05-12 11:41:25,136 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:25,136 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:25,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 1368402410, now seen corresponding path program 4 times
[2024-05-12 11:41:25,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:25,136 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281858172]
[2024-05-12 11:41:25,136 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:25,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:25,201 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:36,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:36,542 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:36,542 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281858172]
[2024-05-12 11:41:36,542 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281858172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:36,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:36,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:41:36,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297447303]
[2024-05-12 11:41:36,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:36,543 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:41:36,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:36,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:41:36,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:41:36,759 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:41:36,759 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 289 transitions, 3329 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:36,759 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:36,760 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:41:36,760 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:40,207 INFO  L124   PetriNetUnfolderBase]: 6170/9508 cut-off events.
[2024-05-12 11:41:40,207 INFO  L125   PetriNetUnfolderBase]: For 311091/311161 co-relation queries the response was YES.
[2024-05-12 11:41:40,268 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63592 conditions, 9508 events. 6170/9508 cut-off events. For 311091/311161 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 58623 event pairs, 1452 based on Foata normal form. 38/9349 useless extension candidates. Maximal degree in co-relation 63498. Up to 8133 conditions per place. 
[2024-05-12 11:41:40,311 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 254 selfloop transitions, 39 changer transitions 0/343 dead transitions.
[2024-05-12 11:41:40,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 343 transitions, 4181 flow
[2024-05-12 11:41:40,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:41:40,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:41:40,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions.
[2024-05-12 11:41:40,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5023148148148148
[2024-05-12 11:41:40,313 INFO  L175             Difference]: Start difference. First operand has 202 places, 289 transitions, 3329 flow. Second operand 9 states and 217 transitions.
[2024-05-12 11:41:40,313 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 343 transitions, 4181 flow
[2024-05-12 11:41:40,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 343 transitions, 4097 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-05-12 11:41:40,673 INFO  L231             Difference]: Finished difference. Result has 204 places, 291 transitions, 3428 flow
[2024-05-12 11:41:40,674 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3245, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3428, PETRI_PLACES=204, PETRI_TRANSITIONS=291}
[2024-05-12 11:41:40,674 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 150 predicate places.
[2024-05-12 11:41:40,674 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 291 transitions, 3428 flow
[2024-05-12 11:41:40,674 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:41:40,675 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:40,675 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:40,675 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-05-12 11:41:40,675 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:40,675 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:40,675 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491488832, now seen corresponding path program 4 times
[2024-05-12 11:41:40,675 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:40,675 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885793703]
[2024-05-12 11:41:40,676 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:40,676 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:40,721 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:41:50,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:41:50,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:41:50,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885793703]
[2024-05-12 11:41:50,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885793703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:41:50,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:41:50,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:41:50,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980669598]
[2024-05-12 11:41:50,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:41:50,546 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:41:50,546 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:41:50,546 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:41:50,547 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:41:50,748 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:41:50,749 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 291 transitions, 3428 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:41:50,749 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:41:50,749 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:41:50,749 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:41:54,178 INFO  L124   PetriNetUnfolderBase]: 6791/9947 cut-off events.
[2024-05-12 11:41:54,178 INFO  L125   PetriNetUnfolderBase]: For 353450/353452 co-relation queries the response was YES.
[2024-05-12 11:41:54,249 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69806 conditions, 9947 events. 6791/9947 cut-off events. For 353450/353452 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 56847 event pairs, 1203 based on Foata normal form. 6/9875 useless extension candidates. Maximal degree in co-relation 69711. Up to 7703 conditions per place. 
[2024-05-12 11:41:54,301 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 246 selfloop transitions, 127 changer transitions 0/381 dead transitions.
[2024-05-12 11:41:54,301 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 381 transitions, 5560 flow
[2024-05-12 11:41:54,302 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:41:54,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:41:54,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 234 transitions.
[2024-05-12 11:41:54,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5416666666666666
[2024-05-12 11:41:54,303 INFO  L175             Difference]: Start difference. First operand has 204 places, 291 transitions, 3428 flow. Second operand 9 states and 234 transitions.
[2024-05-12 11:41:54,303 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 381 transitions, 5560 flow
[2024-05-12 11:41:54,783 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 381 transitions, 5395 flow, removed 45 selfloop flow, removed 7 redundant places.
[2024-05-12 11:41:54,788 INFO  L231             Difference]: Finished difference. Result has 208 places, 308 transitions, 3921 flow
[2024-05-12 11:41:54,788 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3263, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3921, PETRI_PLACES=208, PETRI_TRANSITIONS=308}
[2024-05-12 11:41:54,788 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 154 predicate places.
[2024-05-12 11:41:54,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 308 transitions, 3921 flow
[2024-05-12 11:41:54,789 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:41:54,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:41:54,789 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:41:54,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-05-12 11:41:54,789 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:41:54,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:41:54,789 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491493482, now seen corresponding path program 5 times
[2024-05-12 11:41:54,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:41:54,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683129668]
[2024-05-12 11:41:54,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:41:54,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:41:54,847 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:03,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:03,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:03,556 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683129668]
[2024-05-12 11:42:03,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683129668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:03,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:03,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:42:03,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530962533]
[2024-05-12 11:42:03,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:03,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:42:03,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:03,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:42:03,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:42:03,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:42:03,783 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 308 transitions, 3921 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:42:03,783 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:03,783 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:42:03,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:07,363 INFO  L124   PetriNetUnfolderBase]: 6895/10091 cut-off events.
[2024-05-12 11:42:07,363 INFO  L125   PetriNetUnfolderBase]: For 386813/386815 co-relation queries the response was YES.
[2024-05-12 11:42:07,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74445 conditions, 10091 events. 6895/10091 cut-off events. For 386813/386815 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 57758 event pairs, 1194 based on Foata normal form. 6/10019 useless extension candidates. Maximal degree in co-relation 74347. Up to 8018 conditions per place. 
[2024-05-12 11:42:07,479 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 249 selfloop transitions, 129 changer transitions 0/386 dead transitions.
[2024-05-12 11:42:07,480 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 386 transitions, 5793 flow
[2024-05-12 11:42:07,481 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:42:07,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:42:07,481 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 231 transitions.
[2024-05-12 11:42:07,482 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5347222222222222
[2024-05-12 11:42:07,482 INFO  L175             Difference]: Start difference. First operand has 208 places, 308 transitions, 3921 flow. Second operand 9 states and 231 transitions.
[2024-05-12 11:42:07,482 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 386 transitions, 5793 flow
[2024-05-12 11:42:08,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 386 transitions, 5537 flow, removed 114 selfloop flow, removed 2 redundant places.
[2024-05-12 11:42:08,102 INFO  L231             Difference]: Finished difference. Result has 217 places, 317 transitions, 4249 flow
[2024-05-12 11:42:08,103 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3711, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4249, PETRI_PLACES=217, PETRI_TRANSITIONS=317}
[2024-05-12 11:42:08,103 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 163 predicate places.
[2024-05-12 11:42:08,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 217 places, 317 transitions, 4249 flow
[2024-05-12 11:42:08,103 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:42:08,103 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:08,103 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:08,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-05-12 11:42:08,104 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:08,104 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:08,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 1491673406, now seen corresponding path program 1 times
[2024-05-12 11:42:08,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:08,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226426317]
[2024-05-12 11:42:08,104 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:08,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:08,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:18,084 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:18,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:18,085 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226426317]
[2024-05-12 11:42:18,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226426317] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:18,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:18,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:42:18,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682903987]
[2024-05-12 11:42:18,085 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:18,085 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:42:18,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:18,086 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:42:18,086 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:42:18,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:42:18,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 317 transitions, 4249 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:42:18,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:18,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:42:18,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:21,979 INFO  L124   PetriNetUnfolderBase]: 6963/10440 cut-off events.
[2024-05-12 11:42:21,980 INFO  L125   PetriNetUnfolderBase]: For 410210/410217 co-relation queries the response was YES.
[2024-05-12 11:42:22,044 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75826 conditions, 10440 events. 6963/10440 cut-off events. For 410210/410217 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 62648 event pairs, 1502 based on Foata normal form. 12/10281 useless extension candidates. Maximal degree in co-relation 75724. Up to 9341 conditions per place. 
[2024-05-12 11:42:22,093 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 311 selfloop transitions, 51 changer transitions 0/370 dead transitions.
[2024-05-12 11:42:22,093 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 370 transitions, 5453 flow
[2024-05-12 11:42:22,093 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:42:22,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:42:22,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 199 transitions.
[2024-05-12 11:42:22,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5182291666666666
[2024-05-12 11:42:22,094 INFO  L175             Difference]: Start difference. First operand has 217 places, 317 transitions, 4249 flow. Second operand 8 states and 199 transitions.
[2024-05-12 11:42:22,094 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 370 transitions, 5453 flow
[2024-05-12 11:42:22,688 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 370 transitions, 5045 flow, removed 83 selfloop flow, removed 6 redundant places.
[2024-05-12 11:42:22,693 INFO  L231             Difference]: Finished difference. Result has 219 places, 320 transitions, 4053 flow
[2024-05-12 11:42:22,693 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3841, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4053, PETRI_PLACES=219, PETRI_TRANSITIONS=320}
[2024-05-12 11:42:22,694 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 165 predicate places.
[2024-05-12 11:42:22,694 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 320 transitions, 4053 flow
[2024-05-12 11:42:22,694 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:42:22,694 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:22,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:22,694 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-05-12 11:42:22,694 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:22,695 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:22,695 INFO  L85        PathProgramCache]: Analyzing trace with hash 1368580164, now seen corresponding path program 6 times
[2024-05-12 11:42:22,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:22,695 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304238708]
[2024-05-12 11:42:22,695 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:22,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:22,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:33,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:33,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:33,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304238708]
[2024-05-12 11:42:33,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304238708] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:33,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:33,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:42:33,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973846419]
[2024-05-12 11:42:33,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:33,241 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:42:33,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:33,242 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:42:33,242 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:42:33,452 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:42:33,452 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 320 transitions, 4053 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:42:33,452 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:33,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:42:33,453 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:36,995 INFO  L124   PetriNetUnfolderBase]: 7021/10271 cut-off events.
[2024-05-12 11:42:36,995 INFO  L125   PetriNetUnfolderBase]: For 407216/407218 co-relation queries the response was YES.
[2024-05-12 11:42:37,070 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75034 conditions, 10271 events. 7021/10271 cut-off events. For 407216/407218 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 58834 event pairs, 1171 based on Foata normal form. 6/10199 useless extension candidates. Maximal degree in co-relation 74931. Up to 8182 conditions per place. 
[2024-05-12 11:42:37,124 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 245 selfloop transitions, 149 changer transitions 0/402 dead transitions.
[2024-05-12 11:42:37,124 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 402 transitions, 5950 flow
[2024-05-12 11:42:37,125 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:42:37,125 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:42:37,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 230 transitions.
[2024-05-12 11:42:37,139 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5324074074074074
[2024-05-12 11:42:37,139 INFO  L175             Difference]: Start difference. First operand has 219 places, 320 transitions, 4053 flow. Second operand 9 states and 230 transitions.
[2024-05-12 11:42:37,139 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 402 transitions, 5950 flow
[2024-05-12 11:42:37,992 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 402 transitions, 5762 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-05-12 11:42:37,998 INFO  L231             Difference]: Finished difference. Result has 225 places, 336 transitions, 4704 flow
[2024-05-12 11:42:37,998 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=3865, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4704, PETRI_PLACES=225, PETRI_TRANSITIONS=336}
[2024-05-12 11:42:37,998 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 171 predicate places.
[2024-05-12 11:42:37,998 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 336 transitions, 4704 flow
[2024-05-12 11:42:37,999 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:42:37,999 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:37,999 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:37,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-05-12 11:42:37,999 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:38,000 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:38,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -1785513572, now seen corresponding path program 1 times
[2024-05-12 11:42:38,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:38,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337979063]
[2024-05-12 11:42:38,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:38,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:38,044 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:42:49,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:42:49,530 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:42:49,530 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337979063]
[2024-05-12 11:42:49,530 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337979063] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:42:49,530 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:42:49,530 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:42:49,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974268735]
[2024-05-12 11:42:49,530 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:42:49,530 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:42:49,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:42:49,530 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:42:49,531 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:42:49,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:42:49,653 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 336 transitions, 4704 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:49,653 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:42:49,653 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:42:49,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:42:52,954 INFO  L124   PetriNetUnfolderBase]: 6639/10113 cut-off events.
[2024-05-12 11:42:52,954 INFO  L125   PetriNetUnfolderBase]: For 437775/437895 co-relation queries the response was YES.
[2024-05-12 11:42:53,022 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74705 conditions, 10113 events. 6639/10113 cut-off events. For 437775/437895 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 62229 event pairs, 1611 based on Foata normal form. 67/9927 useless extension candidates. Maximal degree in co-relation 74598. Up to 9156 conditions per place. 
[2024-05-12 11:42:53,070 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 306 selfloop transitions, 33 changer transitions 0/366 dead transitions.
[2024-05-12 11:42:53,070 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 366 transitions, 5653 flow
[2024-05-12 11:42:53,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:42:53,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:42:53,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions.
[2024-05-12 11:42:53,072 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4965277777777778
[2024-05-12 11:42:53,072 INFO  L175             Difference]: Start difference. First operand has 225 places, 336 transitions, 4704 flow. Second operand 6 states and 143 transitions.
[2024-05-12 11:42:53,072 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 366 transitions, 5653 flow
[2024-05-12 11:42:53,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 366 transitions, 5191 flow, removed 132 selfloop flow, removed 4 redundant places.
[2024-05-12 11:42:53,760 INFO  L231             Difference]: Finished difference. Result has 227 places, 341 transitions, 4435 flow
[2024-05-12 11:42:53,761 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4250, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4435, PETRI_PLACES=227, PETRI_TRANSITIONS=341}
[2024-05-12 11:42:53,761 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 173 predicate places.
[2024-05-12 11:42:53,761 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 341 transitions, 4435 flow
[2024-05-12 11:42:53,761 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:42:53,762 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:42:53,762 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:42:53,762 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-05-12 11:42:53,762 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:42:53,762 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:42:53,763 INFO  L85        PathProgramCache]: Analyzing trace with hash -1124847436, now seen corresponding path program 2 times
[2024-05-12 11:42:53,763 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:42:53,763 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704096310]
[2024-05-12 11:42:53,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:42:53,763 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:42:53,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:03,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:03,887 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:03,887 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704096310]
[2024-05-12 11:43:03,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704096310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:03,887 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:03,888 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-12 11:43:03,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35300884]
[2024-05-12 11:43:03,888 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:03,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-12 11:43:03,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:03,889 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-12 11:43:03,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-05-12 11:43:03,993 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:43:03,994 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 341 transitions, 4435 flow. Second operand  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-05-12 11:43:03,994 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:03,994 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:43:03,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:07,844 INFO  L124   PetriNetUnfolderBase]: 7117/10773 cut-off events.
[2024-05-12 11:43:07,846 INFO  L125   PetriNetUnfolderBase]: For 434442/434442 co-relation queries the response was YES.
[2024-05-12 11:43:07,913 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 76572 conditions, 10773 events. 7117/10773 cut-off events. For 434442/434442 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 65836 event pairs, 1992 based on Foata normal form. 6/10609 useless extension candidates. Maximal degree in co-relation 76464. Up to 9758 conditions per place. 
[2024-05-12 11:43:07,964 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 343 selfloop transitions, 36 changer transitions 0/387 dead transitions.
[2024-05-12 11:43:07,964 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 387 transitions, 5593 flow
[2024-05-12 11:43:07,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:43:07,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:43:07,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions.
[2024-05-12 11:43:07,966 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4947916666666667
[2024-05-12 11:43:07,967 INFO  L175             Difference]: Start difference. First operand has 227 places, 341 transitions, 4435 flow. Second operand 8 states and 190 transitions.
[2024-05-12 11:43:07,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 387 transitions, 5593 flow
[2024-05-12 11:43:08,496 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 387 transitions, 5503 flow, removed 26 selfloop flow, removed 3 redundant places.
[2024-05-12 11:43:08,501 INFO  L231             Difference]: Finished difference. Result has 232 places, 344 transitions, 4539 flow
[2024-05-12 11:43:08,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4347, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4539, PETRI_PLACES=232, PETRI_TRANSITIONS=344}
[2024-05-12 11:43:08,502 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 178 predicate places.
[2024-05-12 11:43:08,502 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 344 transitions, 4539 flow
[2024-05-12 11:43:08,502 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 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-05-12 11:43:08,502 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:08,502 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:08,503 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-05-12 11:43:08,503 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:08,503 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:08,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -1124854380, now seen corresponding path program 7 times
[2024-05-12 11:43:08,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:08,503 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745052829]
[2024-05-12 11:43:08,503 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:08,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:08,613 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:18,382 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:18,382 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:18,382 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745052829]
[2024-05-12 11:43:18,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745052829] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:18,382 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:18,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:43:18,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435152299]
[2024-05-12 11:43:18,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:18,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:43:18,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:18,383 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:43:18,383 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:43:18,582 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:43:18,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 344 transitions, 4539 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:43:18,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:18,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:43:18,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:22,385 INFO  L124   PetriNetUnfolderBase]: 7261/10975 cut-off events.
[2024-05-12 11:43:22,386 INFO  L125   PetriNetUnfolderBase]: For 463776/463776 co-relation queries the response was YES.
[2024-05-12 11:43:22,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 79547 conditions, 10975 events. 7261/10975 cut-off events. For 463776/463776 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 67142 event pairs, 1926 based on Foata normal form. 6/10811 useless extension candidates. Maximal degree in co-relation 79438. Up to 9354 conditions per place. 
[2024-05-12 11:43:22,531 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 328 selfloop transitions, 80 changer transitions 0/416 dead transitions.
[2024-05-12 11:43:22,531 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 416 transitions, 6291 flow
[2024-05-12 11:43:22,532 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:43:22,532 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:43:22,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 221 transitions.
[2024-05-12 11:43:22,533 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5115740740740741
[2024-05-12 11:43:22,533 INFO  L175             Difference]: Start difference. First operand has 232 places, 344 transitions, 4539 flow. Second operand 9 states and 221 transitions.
[2024-05-12 11:43:22,533 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 416 transitions, 6291 flow
[2024-05-12 11:43:23,146 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 416 transitions, 6123 flow, removed 50 selfloop flow, removed 6 redundant places.
[2024-05-12 11:43:23,158 INFO  L231             Difference]: Finished difference. Result has 237 places, 359 transitions, 5114 flow
[2024-05-12 11:43:23,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4371, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5114, PETRI_PLACES=237, PETRI_TRANSITIONS=359}
[2024-05-12 11:43:23,159 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 183 predicate places.
[2024-05-12 11:43:23,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 359 transitions, 5114 flow
[2024-05-12 11:43:23,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:43:23,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:23,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:23,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-05-12 11:43:23,160 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:23,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:23,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -1125027360, now seen corresponding path program 8 times
[2024-05-12 11:43:23,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:23,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661322373]
[2024-05-12 11:43:23,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:23,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:23,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:33,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:33,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:33,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661322373]
[2024-05-12 11:43:33,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661322373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:33,342 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:33,342 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:43:33,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594951872]
[2024-05-12 11:43:33,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:33,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:43:33,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:33,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:43:33,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:43:33,570 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:43:33,570 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 359 transitions, 5114 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:43:33,570 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:33,570 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:43:33,570 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:37,497 INFO  L124   PetriNetUnfolderBase]: 7345/11119 cut-off events.
[2024-05-12 11:43:37,498 INFO  L125   PetriNetUnfolderBase]: For 495263/495263 co-relation queries the response was YES.
[2024-05-12 11:43:37,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82842 conditions, 11119 events. 7345/11119 cut-off events. For 495263/495263 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 68327 event pairs, 1992 based on Foata normal form. 6/10945 useless extension candidates. Maximal degree in co-relation 82730. Up to 9747 conditions per place. 
[2024-05-12 11:43:37,671 INFO  L140   encePairwiseOnDemand]: 33/48 looper letters, 358 selfloop transitions, 50 changer transitions 0/416 dead transitions.
[2024-05-12 11:43:37,671 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 416 transitions, 6486 flow
[2024-05-12 11:43:37,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:43:37,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:43:37,672 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 217 transitions.
[2024-05-12 11:43:37,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5023148148148148
[2024-05-12 11:43:37,672 INFO  L175             Difference]: Start difference. First operand has 237 places, 359 transitions, 5114 flow. Second operand 9 states and 217 transitions.
[2024-05-12 11:43:37,672 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 416 transitions, 6486 flow
[2024-05-12 11:43:38,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 416 transitions, 6007 flow, removed 185 selfloop flow, removed 4 redundant places.
[2024-05-12 11:43:38,716 INFO  L231             Difference]: Finished difference. Result has 242 places, 363 transitions, 4888 flow
[2024-05-12 11:43:38,717 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4635, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4888, PETRI_PLACES=242, PETRI_TRANSITIONS=363}
[2024-05-12 11:43:38,717 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 188 predicate places.
[2024-05-12 11:43:38,717 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 363 transitions, 4888 flow
[2024-05-12 11:43:38,720 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:43:38,721 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:38,721 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:38,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-05-12 11:43:38,721 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:38,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:38,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -1125032010, now seen corresponding path program 9 times
[2024-05-12 11:43:38,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:38,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214786956]
[2024-05-12 11:43:38,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:38,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:38,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:43:48,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:43:48,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:43:48,343 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214786956]
[2024-05-12 11:43:48,343 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214786956] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:43:48,343 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:43:48,343 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:43:48,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077945233]
[2024-05-12 11:43:48,344 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:43:48,344 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:43:48,344 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:43:48,344 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:43:48,344 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:43:48,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:43:48,535 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 363 transitions, 4888 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:43:48,535 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:43:48,535 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:43:48,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:43:52,746 INFO  L124   PetriNetUnfolderBase]: 7454/11206 cut-off events.
[2024-05-12 11:43:52,747 INFO  L125   PetriNetUnfolderBase]: For 506197/506197 co-relation queries the response was YES.
[2024-05-12 11:43:52,829 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84263 conditions, 11206 events. 7454/11206 cut-off events. For 506197/506197 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 68127 event pairs, 1884 based on Foata normal form. 6/11051 useless extension candidates. Maximal degree in co-relation 84149. Up to 9273 conditions per place. 
[2024-05-12 11:43:52,885 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 341 selfloop transitions, 90 changer transitions 0/439 dead transitions.
[2024-05-12 11:43:52,885 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 439 transitions, 6928 flow
[2024-05-12 11:43:52,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:43:52,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:43:52,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions.
[2024-05-12 11:43:52,886 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5185185185185185
[2024-05-12 11:43:52,886 INFO  L175             Difference]: Start difference. First operand has 242 places, 363 transitions, 4888 flow. Second operand 9 states and 224 transitions.
[2024-05-12 11:43:52,887 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 439 transitions, 6928 flow
[2024-05-12 11:43:53,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 439 transitions, 6705 flow, removed 64 selfloop flow, removed 7 redundant places.
[2024-05-12 11:43:53,644 INFO  L231             Difference]: Finished difference. Result has 246 places, 376 transitions, 5231 flow
[2024-05-12 11:43:53,644 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=4665, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5231, PETRI_PLACES=246, PETRI_TRANSITIONS=376}
[2024-05-12 11:43:53,644 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 192 predicate places.
[2024-05-12 11:43:53,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 376 transitions, 5231 flow
[2024-05-12 11:43:53,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:43:53,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:43:53,645 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:43:53,645 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-05-12 11:43:53,645 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:43:53,645 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:43:53,646 INFO  L85        PathProgramCache]: Analyzing trace with hash 1507282474, now seen corresponding path program 5 times
[2024-05-12 11:43:53,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:43:53,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193636077]
[2024-05-12 11:43:53,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:43:53,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:43:53,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:04,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:04,596 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:04,596 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193636077]
[2024-05-12 11:44:04,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193636077] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:04,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:04,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:44:04,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964626820]
[2024-05-12 11:44:04,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:04,596 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:44:04,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:04,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:44:04,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:44:04,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:44:04,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 376 transitions, 5231 flow. Second operand  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:04,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:04,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:44:04,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:44:08,853 INFO  L124   PetriNetUnfolderBase]: 7043/10886 cut-off events.
[2024-05-12 11:44:08,853 INFO  L125   PetriNetUnfolderBase]: For 520999/521101 co-relation queries the response was YES.
[2024-05-12 11:44:08,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82794 conditions, 10886 events. 7043/10886 cut-off events. For 520999/521101 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 69057 event pairs, 1930 based on Foata normal form. 48/10716 useless extension candidates. Maximal degree in co-relation 82677. Up to 9404 conditions per place. 
[2024-05-12 11:44:08,999 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 333 selfloop transitions, 22 changer transitions 0/428 dead transitions.
[2024-05-12 11:44:09,000 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 428 transitions, 6231 flow
[2024-05-12 11:44:09,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:44:09,000 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:44:09,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions.
[2024-05-12 11:44:09,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4837962962962963
[2024-05-12 11:44:09,006 INFO  L175             Difference]: Start difference. First operand has 246 places, 376 transitions, 5231 flow. Second operand 9 states and 209 transitions.
[2024-05-12 11:44:09,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 428 transitions, 6231 flow
[2024-05-12 11:44:09,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 428 transitions, 6001 flow, removed 97 selfloop flow, removed 3 redundant places.
[2024-05-12 11:44:09,816 INFO  L231             Difference]: Finished difference. Result has 253 places, 381 transitions, 5208 flow
[2024-05-12 11:44:09,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5001, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5208, PETRI_PLACES=253, PETRI_TRANSITIONS=381}
[2024-05-12 11:44:09,817 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 199 predicate places.
[2024-05-12 11:44:09,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 381 transitions, 5208 flow
[2024-05-12 11:44:09,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 13.4) internal successors, (134), 10 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:44:09,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:44:09,817 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:44:09,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-05-12 11:44:09,818 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:44:09,818 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:44:09,818 INFO  L85        PathProgramCache]: Analyzing trace with hash -860072964, now seen corresponding path program 1 times
[2024-05-12 11:44:09,818 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:44:09,818 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896214326]
[2024-05-12 11:44:09,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:44:09,818 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:44:09,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:19,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:19,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:19,355 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896214326]
[2024-05-12 11:44:19,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896214326] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:19,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:19,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:44:19,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949499204]
[2024-05-12 11:44:19,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:19,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:44:19,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:19,356 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:44:19,356 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:44:19,561 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:44:19,562 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 381 transitions, 5208 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:44:19,562 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:19,562 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:44:19,562 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:44:23,893 INFO  L124   PetriNetUnfolderBase]: 7478/11287 cut-off events.
[2024-05-12 11:44:23,894 INFO  L125   PetriNetUnfolderBase]: For 527925/527925 co-relation queries the response was YES.
[2024-05-12 11:44:23,968 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 85044 conditions, 11287 events. 7478/11287 cut-off events. For 527925/527925 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 69166 event pairs, 2087 based on Foata normal form. 3/11117 useless extension candidates. Maximal degree in co-relation 84924. Up to 10292 conditions per place. 
[2024-05-12 11:44:24,020 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 370 selfloop transitions, 46 changer transitions 0/424 dead transitions.
[2024-05-12 11:44:24,021 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 424 transitions, 6355 flow
[2024-05-12 11:44:24,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:44:24,021 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:44:24,022 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions.
[2024-05-12 11:44:24,022 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4921875
[2024-05-12 11:44:24,022 INFO  L175             Difference]: Start difference. First operand has 253 places, 381 transitions, 5208 flow. Second operand 8 states and 189 transitions.
[2024-05-12 11:44:24,022 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 424 transitions, 6355 flow
[2024-05-12 11:44:24,786 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 424 transitions, 6207 flow, removed 58 selfloop flow, removed 5 redundant places.
[2024-05-12 11:44:24,791 INFO  L231             Difference]: Finished difference. Result has 256 places, 385 transitions, 5285 flow
[2024-05-12 11:44:24,791 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5060, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5285, PETRI_PLACES=256, PETRI_TRANSITIONS=385}
[2024-05-12 11:44:24,792 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 202 predicate places.
[2024-05-12 11:44:24,792 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 385 transitions, 5285 flow
[2024-05-12 11:44:24,792 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:44:24,792 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:44:24,792 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:44:24,792 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-05-12 11:44:24,792 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:44:24,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:44:24,793 INFO  L85        PathProgramCache]: Analyzing trace with hash -860072716, now seen corresponding path program 3 times
[2024-05-12 11:44:24,793 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:44:24,793 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419589445]
[2024-05-12 11:44:24,793 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:44:24,793 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:44:24,845 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:34,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:34,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:34,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419589445]
[2024-05-12 11:44:34,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419589445] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:34,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:34,298 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:44:34,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140244660]
[2024-05-12 11:44:34,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:34,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:44:34,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:34,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:44:34,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:44:34,474 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:44:34,474 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 385 transitions, 5285 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:44:34,474 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:34,474 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:44:34,474 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:44:38,667 INFO  L124   PetriNetUnfolderBase]: 7546/11407 cut-off events.
[2024-05-12 11:44:38,668 INFO  L125   PetriNetUnfolderBase]: For 543674/543674 co-relation queries the response was YES.
[2024-05-12 11:44:38,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 86115 conditions, 11407 events. 7546/11407 cut-off events. For 543674/543674 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 70125 event pairs, 2119 based on Foata normal form. 6/11235 useless extension candidates. Maximal degree in co-relation 85994. Up to 10421 conditions per place. 
[2024-05-12 11:44:38,815 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 378 selfloop transitions, 41 changer transitions 0/427 dead transitions.
[2024-05-12 11:44:38,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 427 transitions, 6455 flow
[2024-05-12 11:44:38,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:44:38,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:44:38,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions.
[2024-05-12 11:44:38,816 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4895833333333333
[2024-05-12 11:44:38,816 INFO  L175             Difference]: Start difference. First operand has 256 places, 385 transitions, 5285 flow. Second operand 8 states and 188 transitions.
[2024-05-12 11:44:38,816 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 427 transitions, 6455 flow
[2024-05-12 11:44:39,705 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 427 transitions, 6297 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-05-12 11:44:39,710 INFO  L231             Difference]: Finished difference. Result has 258 places, 388 transitions, 5352 flow
[2024-05-12 11:44:39,710 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5127, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5352, PETRI_PLACES=258, PETRI_TRANSITIONS=388}
[2024-05-12 11:44:39,711 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 204 predicate places.
[2024-05-12 11:44:39,711 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 388 transitions, 5352 flow
[2024-05-12 11:44:39,711 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:44:39,711 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:44:39,718 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:44:39,718 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-05-12 11:44:39,718 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:44:39,718 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:44:39,718 INFO  L85        PathProgramCache]: Analyzing trace with hash -869247600, now seen corresponding path program 10 times
[2024-05-12 11:44:39,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:44:39,718 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505465992]
[2024-05-12 11:44:39,719 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:44:39,719 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:44:39,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:44:49,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:44:49,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:44:49,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505465992]
[2024-05-12 11:44:49,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505465992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:44:49,680 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:44:49,680 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:44:49,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813334431]
[2024-05-12 11:44:49,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:44:49,696 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:44:49,696 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:44:49,696 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:44:49,697 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:44:49,981 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:44:49,982 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 388 transitions, 5352 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:44:49,982 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:44:49,982 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:44:49,982 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:44:54,305 INFO  L124   PetriNetUnfolderBase]: 7604/11500 cut-off events.
[2024-05-12 11:44:54,306 INFO  L125   PetriNetUnfolderBase]: For 560473/560473 co-relation queries the response was YES.
[2024-05-12 11:44:54,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87231 conditions, 11500 events. 7604/11500 cut-off events. For 560473/560473 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 70908 event pairs, 2020 based on Foata normal form. 6/11324 useless extension candidates. Maximal degree in co-relation 87109. Up to 10300 conditions per place. 
[2024-05-12 11:44:54,465 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 378 selfloop transitions, 66 changer transitions 0/452 dead transitions.
[2024-05-12 11:44:54,465 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 452 transitions, 6795 flow
[2024-05-12 11:44:54,465 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-05-12 11:44:54,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-05-12 11:44:54,466 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 216 transitions.
[2024-05-12 11:44:54,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-05-12 11:44:54,466 INFO  L175             Difference]: Start difference. First operand has 258 places, 388 transitions, 5352 flow. Second operand 9 states and 216 transitions.
[2024-05-12 11:44:54,466 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 452 transitions, 6795 flow
[2024-05-12 11:44:55,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 452 transitions, 6596 flow, removed 61 selfloop flow, removed 6 redundant places.
[2024-05-12 11:44:55,472 INFO  L231             Difference]: Finished difference. Result has 263 places, 399 transitions, 5647 flow
[2024-05-12 11:44:55,473 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5153, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5647, PETRI_PLACES=263, PETRI_TRANSITIONS=399}
[2024-05-12 11:44:55,473 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 209 predicate places.
[2024-05-12 11:44:55,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 399 transitions, 5647 flow
[2024-05-12 11:44:55,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:44:55,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:44:55,473 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:44:55,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-05-12 11:44:55,474 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:44:55,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:44:55,474 INFO  L85        PathProgramCache]: Analyzing trace with hash -859747216, now seen corresponding path program 4 times
[2024-05-12 11:44:55,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:44:55,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241310638]
[2024-05-12 11:44:55,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:44:55,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:44:55,530 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:45:05,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:45:05,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:45:05,777 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241310638]
[2024-05-12 11:45:05,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241310638] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:45:05,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:45:05,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:45:05,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807732711]
[2024-05-12 11:45:05,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:45:05,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:45:05,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:45:05,792 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:45:05,792 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:45:05,984 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:45:05,984 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 399 transitions, 5647 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:45:05,984 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:45:05,985 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:45:05,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:45:10,262 INFO  L124   PetriNetUnfolderBase]: 7635/11560 cut-off events.
[2024-05-12 11:45:10,262 INFO  L125   PetriNetUnfolderBase]: For 569649/569649 co-relation queries the response was YES.
[2024-05-12 11:45:10,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 87746 conditions, 11560 events. 7635/11560 cut-off events. For 569649/569649 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 71380 event pairs, 2107 based on Foata normal form. 6/11381 useless extension candidates. Maximal degree in co-relation 87621. Up to 10591 conditions per place. 
[2024-05-12 11:45:10,401 INFO  L140   encePairwiseOnDemand]: 36/48 looper letters, 398 selfloop transitions, 37 changer transitions 0/443 dead transitions.
[2024-05-12 11:45:10,402 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 443 transitions, 6869 flow
[2024-05-12 11:45:10,402 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-05-12 11:45:10,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-05-12 11:45:10,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions.
[2024-05-12 11:45:10,403 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.484375
[2024-05-12 11:45:10,403 INFO  L175             Difference]: Start difference. First operand has 263 places, 399 transitions, 5647 flow. Second operand 8 states and 186 transitions.
[2024-05-12 11:45:10,403 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 443 transitions, 6869 flow
[2024-05-12 11:45:11,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 443 transitions, 6510 flow, removed 132 selfloop flow, removed 5 redundant places.
[2024-05-12 11:45:11,473 INFO  L231             Difference]: Finished difference. Result has 267 places, 406 transitions, 5549 flow
[2024-05-12 11:45:11,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5288, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5549, PETRI_PLACES=267, PETRI_TRANSITIONS=406}
[2024-05-12 11:45:11,474 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 213 predicate places.
[2024-05-12 11:45:11,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 267 places, 406 transitions, 5549 flow
[2024-05-12 11:45:11,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:45:11,474 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:45:11,474 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:45:11,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-05-12 11:45:11,475 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:45:11,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:45:11,475 INFO  L85        PathProgramCache]: Analyzing trace with hash -607536596, now seen corresponding path program 2 times
[2024-05-12 11:45:11,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:45:11,475 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111608559]
[2024-05-12 11:45:11,475 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:45:11,475 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:45:11,522 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:45:23,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-05-12 11:45:23,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:45:23,454 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111608559]
[2024-05-12 11:45:23,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111608559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:45:23,455 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:45:23,455 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:45:23,455 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078557966]
[2024-05-12 11:45:23,455 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:45:23,455 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:45:23,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:45:23,456 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:45:23,456 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:45:23,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 48
[2024-05-12 11:45:23,609 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 406 transitions, 5549 flow. Second operand  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:23,609 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:45:23,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 48
[2024-05-12 11:45:23,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:45:27,272 INFO  L124   PetriNetUnfolderBase]: 7150/10917 cut-off events.
[2024-05-12 11:45:27,273 INFO  L125   PetriNetUnfolderBase]: For 558705/558888 co-relation queries the response was YES.
[2024-05-12 11:45:27,373 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 82796 conditions, 10917 events. 7150/10917 cut-off events. For 558705/558888 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 68413 event pairs, 2045 based on Foata normal form. 110/10775 useless extension candidates. Maximal degree in co-relation 82669. Up to 9936 conditions per place. 
[2024-05-12 11:45:27,429 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 373 selfloop transitions, 16 changer transitions 0/422 dead transitions.
[2024-05-12 11:45:27,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 422 transitions, 6375 flow
[2024-05-12 11:45:27,430 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:45:27,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:45:27,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-05-12 11:45:27,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4618055555555556
[2024-05-12 11:45:27,431 INFO  L175             Difference]: Start difference. First operand has 267 places, 406 transitions, 5549 flow. Second operand 6 states and 133 transitions.
[2024-05-12 11:45:27,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 422 transitions, 6375 flow
[2024-05-12 11:45:28,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 422 transitions, 6116 flow, removed 97 selfloop flow, removed 5 redundant places.
[2024-05-12 11:45:28,839 INFO  L231             Difference]: Finished difference. Result has 268 places, 406 transitions, 5330 flow
[2024-05-12 11:45:28,840 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5290, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5330, PETRI_PLACES=268, PETRI_TRANSITIONS=406}
[2024-05-12 11:45:28,840 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 214 predicate places.
[2024-05-12 11:45:28,840 INFO  L495      AbstractCegarLoop]: Abstraction has has 268 places, 406 transitions, 5330 flow
[2024-05-12 11:45:28,840 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:45:28,840 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:45:28,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:45:28,841 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-05-12 11:45:28,841 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:45:28,841 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:45:28,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -138354228, now seen corresponding path program 11 times
[2024-05-12 11:45:28,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:45:28,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757881136]
[2024-05-12 11:45:28,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:45:28,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:45:28,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:45:42,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:45:42,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:45:42,711 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757881136]
[2024-05-12 11:45:42,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757881136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:45:42,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:45:42,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:45:42,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268897660]
[2024-05-12 11:45:42,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:45:42,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:45:42,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:45:42,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:45:42,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:45:42,959 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:45:42,959 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 406 transitions, 5330 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:45:42,959 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:45:42,959 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:45:42,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:45:47,993 INFO  L124   PetriNetUnfolderBase]: 8509/13520 cut-off events.
[2024-05-12 11:45:47,993 INFO  L125   PetriNetUnfolderBase]: For 619551/619556 co-relation queries the response was YES.
[2024-05-12 11:45:48,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 98581 conditions, 13520 events. 8509/13520 cut-off events. For 619551/619556 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 89994 event pairs, 2051 based on Foata normal form. 10/13151 useless extension candidates. Maximal degree in co-relation 98453. Up to 11144 conditions per place. 
[2024-05-12 11:45:48,203 INFO  L140   encePairwiseOnDemand]: 30/48 looper letters, 479 selfloop transitions, 109 changer transitions 0/596 dead transitions.
[2024-05-12 11:45:48,203 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 596 transitions, 9191 flow
[2024-05-12 11:45:48,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-05-12 11:45:48,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-05-12 11:45:48,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 289 transitions.
[2024-05-12 11:45:48,205 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5017361111111112
[2024-05-12 11:45:48,205 INFO  L175             Difference]: Start difference. First operand has 268 places, 406 transitions, 5330 flow. Second operand 12 states and 289 transitions.
[2024-05-12 11:45:48,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 596 transitions, 9191 flow
[2024-05-12 11:45:49,384 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 596 transitions, 9099 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-05-12 11:45:49,391 INFO  L231             Difference]: Finished difference. Result has 281 places, 505 transitions, 7534 flow
[2024-05-12 11:45:49,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=5281, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7534, PETRI_PLACES=281, PETRI_TRANSITIONS=505}
[2024-05-12 11:45:49,392 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 227 predicate places.
[2024-05-12 11:45:49,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 281 places, 505 transitions, 7534 flow
[2024-05-12 11:45:49,398 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:45:49,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:45:49,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:45:49,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-05-12 11:45:49,398 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:45:49,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:45:49,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 1955055850, now seen corresponding path program 12 times
[2024-05-12 11:45:49,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:45:49,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471505298]
[2024-05-12 11:45:49,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:45:49,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:45:49,438 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:45:58,837 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:45:58,837 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:45:58,837 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471505298]
[2024-05-12 11:45:58,837 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471505298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:45:58,837 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:45:58,837 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-12 11:45:58,838 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711267118]
[2024-05-12 11:45:58,838 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:45:58,838 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-05-12 11:45:58,838 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:45:58,838 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-05-12 11:45:58,838 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-05-12 11:45:58,948 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:45:58,949 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 505 transitions, 7534 flow. Second operand  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:45:58,949 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:45:58,949 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:45:58,949 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:46:04,615 INFO  L124   PetriNetUnfolderBase]: 9371/14634 cut-off events.
[2024-05-12 11:46:04,615 INFO  L125   PetriNetUnfolderBase]: For 690053/690055 co-relation queries the response was YES.
[2024-05-12 11:46:04,749 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116167 conditions, 14634 events. 9371/14634 cut-off events. For 690053/690055 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 97794 event pairs, 2228 based on Foata normal form. 8/14282 useless extension candidates. Maximal degree in co-relation 116033. Up to 12054 conditions per place. 
[2024-05-12 11:46:04,828 INFO  L140   encePairwiseOnDemand]: 31/48 looper letters, 491 selfloop transitions, 185 changer transitions 0/684 dead transitions.
[2024-05-12 11:46:04,828 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 684 transitions, 11697 flow
[2024-05-12 11:46:04,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-05-12 11:46:04,829 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-05-12 11:46:04,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 242 transitions.
[2024-05-12 11:46:04,829 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5041666666666667
[2024-05-12 11:46:04,829 INFO  L175             Difference]: Start difference. First operand has 281 places, 505 transitions, 7534 flow. Second operand 10 states and 242 transitions.
[2024-05-12 11:46:04,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 684 transitions, 11697 flow
[2024-05-12 11:46:06,482 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 684 transitions, 11390 flow, removed 148 selfloop flow, removed 2 redundant places.
[2024-05-12 11:46:06,490 INFO  L231             Difference]: Finished difference. Result has 294 places, 612 transitions, 10314 flow
[2024-05-12 11:46:06,491 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=7381, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10314, PETRI_PLACES=294, PETRI_TRANSITIONS=612}
[2024-05-12 11:46:06,491 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 240 predicate places.
[2024-05-12 11:46:06,491 INFO  L495      AbstractCegarLoop]: Abstraction has has 294 places, 612 transitions, 10314 flow
[2024-05-12 11:46:06,491 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 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-05-12 11:46:06,491 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:46:06,491 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:46:06,491 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-05-12 11:46:06,492 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:46:06,492 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:46:06,492 INFO  L85        PathProgramCache]: Analyzing trace with hash -930997979, now seen corresponding path program 1 times
[2024-05-12 11:46:06,492 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:46:06,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102096982]
[2024-05-12 11:46:06,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:46:06,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:46:06,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:46:21,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:46:21,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:46:21,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102096982]
[2024-05-12 11:46:21,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102096982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:46:21,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:46:21,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:46:21,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942820077]
[2024-05-12 11:46:21,664 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:46:21,664 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:46:21,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:46:21,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:46:21,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:46:21,817 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:46:21,817 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 612 transitions, 10314 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:46:21,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:46:21,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:46:21,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:46:27,318 INFO  L124   PetriNetUnfolderBase]: 9382/14563 cut-off events.
[2024-05-12 11:46:27,318 INFO  L125   PetriNetUnfolderBase]: For 695996/695996 co-relation queries the response was YES.
[2024-05-12 11:46:27,434 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 118993 conditions, 14563 events. 9382/14563 cut-off events. For 695996/695996 co-relation queries the response was YES. Maximal size of possible extension queue 638. Compared 96875 event pairs, 2527 based on Foata normal form. 3/14220 useless extension candidates. Maximal degree in co-relation 118852. Up to 13034 conditions per place. 
[2024-05-12 11:46:27,507 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 592 selfloop transitions, 42 changer transitions 0/642 dead transitions.
[2024-05-12 11:46:27,508 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 642 transitions, 11879 flow
[2024-05-12 11:46:27,508 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:46:27,508 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:46:27,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions.
[2024-05-12 11:46:27,509 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4861111111111111
[2024-05-12 11:46:27,509 INFO  L175             Difference]: Start difference. First operand has 294 places, 612 transitions, 10314 flow. Second operand 6 states and 140 transitions.
[2024-05-12 11:46:27,509 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 642 transitions, 11879 flow
[2024-05-12 11:46:28,966 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 642 transitions, 11396 flow, removed 54 selfloop flow, removed 6 redundant places.
[2024-05-12 11:46:28,975 INFO  L231             Difference]: Finished difference. Result has 294 places, 618 transitions, 10028 flow
[2024-05-12 11:46:28,975 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9831, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10028, PETRI_PLACES=294, PETRI_TRANSITIONS=618}
[2024-05-12 11:46:28,976 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 240 predicate places.
[2024-05-12 11:46:28,976 INFO  L495      AbstractCegarLoop]: Abstraction has has 294 places, 618 transitions, 10028 flow
[2024-05-12 11:46:28,976 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:46:28,976 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:46:28,976 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:46:28,976 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-05-12 11:46:28,976 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:46:28,977 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:46:28,977 INFO  L85        PathProgramCache]: Analyzing trace with hash -606232333, now seen corresponding path program 2 times
[2024-05-12 11:46:28,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:46:28,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348454924]
[2024-05-12 11:46:28,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:46:28,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:46:29,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:46: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-05-12 11:46:43,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:46:43,718 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348454924]
[2024-05-12 11:46:43,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348454924] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:46:43,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:46:43,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-12 11:46:43,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021129086]
[2024-05-12 11:46:43,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:46:43,719 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-12 11:46:43,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:46:43,720 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-12 11:46:43,720 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-05-12 11:46:43,806 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:46:43,807 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 618 transitions, 10028 flow. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:46:43,807 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:46:43,807 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:46:43,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:46:49,060 INFO  L124   PetriNetUnfolderBase]: 9350/14508 cut-off events.
[2024-05-12 11:46:49,060 INFO  L125   PetriNetUnfolderBase]: For 681862/681864 co-relation queries the response was YES.
[2024-05-12 11:46:49,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 116927 conditions, 14508 events. 9350/14508 cut-off events. For 681862/681864 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 96489 event pairs, 2528 based on Foata normal form. 1/14167 useless extension candidates. Maximal degree in co-relation 116785. Up to 12988 conditions per place. 
[2024-05-12 11:46:49,318 INFO  L140   encePairwiseOnDemand]: 39/48 looper letters, 586 selfloop transitions, 44 changer transitions 0/638 dead transitions.
[2024-05-12 11:46:49,318 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 638 transitions, 11373 flow
[2024-05-12 11:46:49,319 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-05-12 11:46:49,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-05-12 11:46:49,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions.
[2024-05-12 11:46:49,320 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4756944444444444
[2024-05-12 11:46:49,320 INFO  L175             Difference]: Start difference. First operand has 294 places, 618 transitions, 10028 flow. Second operand 6 states and 137 transitions.
[2024-05-12 11:46:49,320 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 638 transitions, 11373 flow
[2024-05-12 11:46:50,909 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 638 transitions, 11309 flow, removed 10 selfloop flow, removed 3 redundant places.
[2024-05-12 11:46:50,919 INFO  L231             Difference]: Finished difference. Result has 297 places, 618 transitions, 10062 flow
[2024-05-12 11:46:50,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9964, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=10062, PETRI_PLACES=297, PETRI_TRANSITIONS=618}
[2024-05-12 11:46:50,920 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 243 predicate places.
[2024-05-12 11:46:50,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 297 places, 618 transitions, 10062 flow
[2024-05-12 11:46:50,920 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 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-05-12 11:46:50,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:46:50,920 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:46:50,920 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-05-12 11:46:50,921 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:46:50,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:46:50,921 INFO  L85        PathProgramCache]: Analyzing trace with hash 103177891, now seen corresponding path program 1 times
[2024-05-12 11:46:50,921 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:46:50,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437145569]
[2024-05-12 11:46:50,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:46:50,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:46:50,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:47:02,744 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:47:02,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:47:02,744 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437145569]
[2024-05-12 11:47:02,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437145569] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:47:02,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:47:02,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 11:47:02,745 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561209990]
[2024-05-12 11:47:02,745 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:47:02,745 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 11:47:02,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:47:02,745 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 11:47:02,745 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-05-12 11:47:03,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:47:03,025 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 618 transitions, 10062 flow. Second operand  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:03,025 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:47:03,025 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:47:03,025 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:47:09,248 INFO  L124   PetriNetUnfolderBase]: 10128/16041 cut-off events.
[2024-05-12 11:47:09,248 INFO  L125   PetriNetUnfolderBase]: For 880610/880612 co-relation queries the response was YES.
[2024-05-12 11:47:09,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 132921 conditions, 16041 events. 10128/16041 cut-off events. For 880610/880612 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 109600 event pairs, 2008 based on Foata normal form. 26/15643 useless extension candidates. Maximal degree in co-relation 132778. Up to 9842 conditions per place. 
[2024-05-12 11:47:09,502 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 439 selfloop transitions, 278 changer transitions 0/725 dead transitions.
[2024-05-12 11:47:09,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 725 transitions, 13196 flow
[2024-05-12 11:47:09,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:47:09,502 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:47:09,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 284 transitions.
[2024-05-12 11:47:09,503 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5378787878787878
[2024-05-12 11:47:09,503 INFO  L175             Difference]: Start difference. First operand has 297 places, 618 transitions, 10062 flow. Second operand 11 states and 284 transitions.
[2024-05-12 11:47:09,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 725 transitions, 13196 flow
[2024-05-12 11:47:11,960 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 725 transitions, 13052 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-05-12 11:47:11,970 INFO  L231             Difference]: Finished difference. Result has 305 places, 627 transitions, 10980 flow
[2024-05-12 11:47:11,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=9918, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=10980, PETRI_PLACES=305, PETRI_TRANSITIONS=627}
[2024-05-12 11:47:11,971 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 251 predicate places.
[2024-05-12 11:47:11,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 627 transitions, 10980 flow
[2024-05-12 11:47:11,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:11,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:47:11,971 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:47:11,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-05-12 11:47:11,972 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:47:11,972 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:47:11,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 105055561, now seen corresponding path program 2 times
[2024-05-12 11:47:11,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:47:11,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850743521]
[2024-05-12 11:47:11,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:47:11,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:47:12,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:47:22,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:47:22,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:47:22,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850743521]
[2024-05-12 11:47:22,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850743521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:47:22,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:47:22,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 11:47:22,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402791773]
[2024-05-12 11:47:22,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:47:22,957 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 11:47:22,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:47:22,957 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 11:47:22,957 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-05-12 11:47:23,168 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:47:23,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 627 transitions, 10980 flow. Second operand  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:23,169 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:47:23,169 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:47:23,169 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:47:29,747 INFO  L124   PetriNetUnfolderBase]: 10446/16427 cut-off events.
[2024-05-12 11:47:29,748 INFO  L125   PetriNetUnfolderBase]: For 1029855/1029857 co-relation queries the response was YES.
[2024-05-12 11:47:29,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 143994 conditions, 16427 events. 10446/16427 cut-off events. For 1029855/1029857 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 112696 event pairs, 2571 based on Foata normal form. 32/16060 useless extension candidates. Maximal degree in co-relation 143847. Up to 11699 conditions per place. 
[2024-05-12 11:47:30,040 INFO  L140   encePairwiseOnDemand]: 35/48 looper letters, 431 selfloop transitions, 286 changer transitions 0/725 dead transitions.
[2024-05-12 11:47:30,040 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 725 transitions, 13822 flow
[2024-05-12 11:47:30,041 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:47:30,041 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:47:30,041 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 278 transitions.
[2024-05-12 11:47:30,042 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5265151515151515
[2024-05-12 11:47:30,042 INFO  L175             Difference]: Start difference. First operand has 305 places, 627 transitions, 10980 flow. Second operand 11 states and 278 transitions.
[2024-05-12 11:47:30,042 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 725 transitions, 13822 flow
[2024-05-12 11:47:33,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 725 transitions, 13366 flow, removed 94 selfloop flow, removed 5 redundant places.
[2024-05-12 11:47:33,202 INFO  L231             Difference]: Finished difference. Result has 314 places, 638 transitions, 11716 flow
[2024-05-12 11:47:33,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10560, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11716, PETRI_PLACES=314, PETRI_TRANSITIONS=638}
[2024-05-12 11:47:33,203 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 260 predicate places.
[2024-05-12 11:47:33,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 314 places, 638 transitions, 11716 flow
[2024-05-12 11:47:33,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:33,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:47:33,204 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:47:33,204 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-05-12 11:47:33,204 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:47:33,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:47:33,204 INFO  L85        PathProgramCache]: Analyzing trace with hash 105051841, now seen corresponding path program 3 times
[2024-05-12 11:47:33,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:47:33,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604985978]
[2024-05-12 11:47:33,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:47:33,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:47:33,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:47:44,852 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:47:44,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:47:44,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604985978]
[2024-05-12 11:47:44,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604985978] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:47:44,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:47:44,853 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 11:47:44,853 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775629947]
[2024-05-12 11:47:44,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:47:44,854 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 11:47:44,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:47:44,854 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 11:47:44,854 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-05-12 11:47:45,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:47:45,237 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 638 transitions, 11716 flow. Second operand  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:45,237 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:47:45,237 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:47:45,237 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-05-12 11:47:53,182 INFO  L124   PetriNetUnfolderBase]: 11122/17367 cut-off events.
[2024-05-12 11:47:53,182 INFO  L125   PetriNetUnfolderBase]: For 1216002/1216004 co-relation queries the response was YES.
[2024-05-12 11:47:53,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 159938 conditions, 17367 events. 11122/17367 cut-off events. For 1216002/1216004 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 119419 event pairs, 2716 based on Foata normal form. 26/17017 useless extension candidates. Maximal degree in co-relation 159786. Up to 10924 conditions per place. 
[2024-05-12 11:47:53,477 INFO  L140   encePairwiseOnDemand]: 34/48 looper letters, 481 selfloop transitions, 248 changer transitions 0/737 dead transitions.
[2024-05-12 11:47:53,478 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 737 transitions, 14743 flow
[2024-05-12 11:47:53,478 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-12 11:47:53,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-05-12 11:47:53,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 279 transitions.
[2024-05-12 11:47:53,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5284090909090909
[2024-05-12 11:47:53,479 INFO  L175             Difference]: Start difference. First operand has 314 places, 638 transitions, 11716 flow. Second operand 11 states and 279 transitions.
[2024-05-12 11:47:53,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 737 transitions, 14743 flow
[2024-05-12 11:47:57,041 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 737 transitions, 13835 flow, removed 179 selfloop flow, removed 7 redundant places.
[2024-05-12 11:47:57,051 INFO  L231             Difference]: Finished difference. Result has 319 places, 645 transitions, 11748 flow
[2024-05-12 11:47:57,051 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=10904, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11748, PETRI_PLACES=319, PETRI_TRANSITIONS=645}
[2024-05-12 11:47:57,052 INFO  L281   CegarLoopForPetriNet]: 54 programPoint places, 265 predicate places.
[2024-05-12 11:47:57,052 INFO  L495      AbstractCegarLoop]: Abstraction has has 319 places, 645 transitions, 11748 flow
[2024-05-12 11:47:57,052 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:47:57,052 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-05-12 11:47:57,052 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-12 11:47:57,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-05-12 11:47:57,053 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] ===
[2024-05-12 11:47:57,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-12 11:47:57,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 231794359, now seen corresponding path program 4 times
[2024-05-12 11:47:57,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-12 11:47:57,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241483805]
[2024-05-12 11:47:57,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-12 11:47:57,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-12 11:47:57,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-12 11:48:08,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-12 11:48:08,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-12 11:48:08,605 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241483805]
[2024-05-12 11:48:08,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241483805] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-12 11:48:08,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-12 11:48:08,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-05-12 11:48:08,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392245927]
[2024-05-12 11:48:08,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-12 11:48:08,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-05-12 11:48:08,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-12 11:48:08,607 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-05-12 11:48:08,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2024-05-12 11:48:08,870 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 48
[2024-05-12 11:48:08,871 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 645 transitions, 11748 flow. Second operand  has 11 states, 11 states have (on average 12.363636363636363) internal successors, (136), 11 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-12 11:48:08,871 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-05-12 11:48:08,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 48
[2024-05-12 11:48:08,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand