./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix032.opt.yml/witness.yml --architecture 32bit


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


Checking for ERROR reachability
Using default analysis
Version bcb38a6f
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix032.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 21:46:18,022 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 21:46:18,099 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 21:46:18,103 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 21:46:18,104 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 21:46:18,126 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 21:46:18,127 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 21:46:18,128 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 21:46:18,129 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 21:46:18,133 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 21:46:18,133 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 21:46:18,133 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 21:46:18,134 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 21:46:18,135 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 21:46:18,135 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 21:46:18,136 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 21:46:18,136 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 21:46:18,136 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 21:46:18,137 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 21:46:18,137 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 21:46:18,138 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 21:46:18,138 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 21:46:18,139 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 21:46:18,139 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 21:46:18,139 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 21:46:18,139 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 21:46:18,139 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 21:46:18,140 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 21:46:18,140 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 21:46:18,140 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 21:46:18,141 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 21:46:18,141 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 21:46:18,141 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:46:18,142 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 21:46:18,142 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 21:46:18,142 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 21:46:18,142 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 21:46:18,142 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 21:46:18,143 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 21:46:18,143 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 21:46:18,143 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 21:46:18,143 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 21:46:18,143 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 21:46:18,144 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-03 21:46:18,349 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 21:46:18,373 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 21:46:18,374 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 21:46:18,375 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 21:46:18,376 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 21:46:18,377 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix032.opt.yml/witness.yml
[2024-06-03 21:46:18,542 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 21:46:18,542 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 21:46:18,543 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032.opt.i
[2024-06-03 21:46:19,575 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 21:46:19,783 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 21:46:19,783 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032.opt.i
[2024-06-03 21:46:19,796 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddaac5c3b/bc19c77cf66140668a1ff674311d0a89/FLAG3301be27e
[2024-06-03 21:46:19,806 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddaac5c3b/bc19c77cf66140668a1ff674311d0a89
[2024-06-03 21:46:19,807 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 21:46:19,809 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 21:46:19,810 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 21:46:19,810 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 21:46:19,815 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 21:46:19,815 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:18" (1/2) ...
[2024-06-03 21:46:19,816 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678ccfcb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:19, skipping insertion in model container
[2024-06-03 21:46:19,816 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:18" (1/2) ...
[2024-06-03 21:46:19,817 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6dc3067 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:46:19, skipping insertion in model container
[2024-06-03 21:46:19,817 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:19" (2/2) ...
[2024-06-03 21:46:19,818 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678ccfcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:19, skipping insertion in model container
[2024-06-03 21:46:19,818 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:46:19" (2/2) ...
[2024-06-03 21:46:19,818 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 21:46:19,906 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 21:46:19,908 INFO  L97    edCorrectnessWitness]: Location invariant before [L848-L848] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 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_thd1 >= 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$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 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_thd1 >= 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_buff1_thd0) + (long long )z$r_buff1_thd1 >= 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$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 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$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 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 )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_thd1 >= 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_thd1 >= 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_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 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_thd1 >= 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_thd1 >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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_thd1 >= 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_thd1 >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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_thd1 >= 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_thd1 >= 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 )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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 )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 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_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 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_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 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 )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! 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 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-06-03 21:46:19,908 INFO  L97    edCorrectnessWitness]: Location invariant before [L851-L851] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 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_thd1 >= 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$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 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_thd1 >= 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_buff1_thd0) + (long long )z$r_buff1_thd1 >= 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$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 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$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 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 )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_thd1 >= 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_thd1 >= 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_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 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_thd1 >= 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_thd1 >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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_thd1 >= 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_thd1 >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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_thd1 >= 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_thd1 >= 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 )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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 )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 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_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 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_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 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 )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! 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 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-06-03 21:46:19,909 INFO  L97    edCorrectnessWitness]: Location invariant before [L850-L850] (((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 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_thd1 >= 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$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 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_thd1 >= 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_buff1_thd0) + (long long )z$r_buff1_thd1 >= 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$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 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$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 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 )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_thd1 >= 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_thd1 >= 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_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b >= 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_thd1 >= 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_thd1 >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 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_thd1 >= 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_thd1 >= 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 )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 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_thd1 >= 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_thd1 >= 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 )a + (long long )b >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (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_thd1 >= 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_thd1 >= 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_thd1 >= 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_thd1 >= 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 )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 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_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 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_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (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_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 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 )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 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_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && x <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! 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 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-06-03 21:46:19,910 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 21:46:19,910 INFO  L106   edCorrectnessWitness]: ghost_update [L846-L846] multithreaded = 1;
[2024-06-03 21:46:19,951 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 21:46:20,282 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:46:20,292 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-03 21:46:20,566 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:46:20,593 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 21:46:20,593 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20 WrapperNode
[2024-06-03 21:46:20,593 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 21:46:20,594 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 21:46:20,594 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 21:46:20,594 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 21:46:20,600 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,637 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,807 INFO  L138                Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136
[2024-06-03 21:46:20,808 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 21:46:20,809 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 21:46:20,809 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 21:46:20,809 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 21:46:20,818 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,818 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,831 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,896 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-03 21:46:20,896 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,897 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,941 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,942 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,964 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:20,969 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:21,060 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 21:46:21,061 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 21:46:21,061 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 21:46:21,061 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 21:46:21,062 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (1/1) ...
[2024-06-03 21:46:21,066 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:46:21,073 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 21:46:21,085 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-03 21:46:21,089 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-03 21:46:21,117 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 21:46:21,118 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 21:46:21,118 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 21:46:21,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 21:46:21,118 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 21:46:21,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 21:46:21,119 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 21:46:21,119 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 21:46:21,119 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 21:46:21,119 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 21:46:21,119 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 21:46:21,120 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 21:46:21,121 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-03 21:46:21,258 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 21:46:21,261 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 21:46:22,781 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 21:46:22,783 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 21:46:23,064 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 21:46:23,064 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 21:46:23,065 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:23 BoogieIcfgContainer
[2024-06-03 21:46:23,065 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 21:46:23,067 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 21:46:23,067 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 21:46:23,069 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 21:46:23,069 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:46:18" (1/4) ...
[2024-06-03 21:46:23,070 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67517adc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:46:23, skipping insertion in model container
[2024-06-03 21:46:23,070 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:46:19" (2/4) ...
[2024-06-03 21:46:23,070 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67517adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:46:23, skipping insertion in model container
[2024-06-03 21:46:23,070 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:46:20" (3/4) ...
[2024-06-03 21:46:23,071 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67517adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:46:23, skipping insertion in model container
[2024-06-03 21:46:23,071 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:46:23" (4/4) ...
[2024-06-03 21:46:23,072 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix032.opt.i
[2024-06-03 21:46:23,085 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 21:46:23,085 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 21:46:23,085 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 21:46:23,197 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 21:46:23,220 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 102 flow
[2024-06-03 21:46:23,295 INFO  L124   PetriNetUnfolderBase]: 0/42 cut-off events.
[2024-06-03 21:46:23,296 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:46:23,299 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 21:46:23,299 INFO  L82        GeneralOperation]: Start removeDead. Operand has 55 places, 45 transitions, 102 flow
[2024-06-03 21:46:23,301 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 46 places, 36 transitions, 81 flow
[2024-06-03 21:46:23,307 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 21:46:23,311 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;@3396eae5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 21:46:23,312 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 21:46:23,318 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 21:46:23,318 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-03 21:46:23,319 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:46:23,319 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:23,319 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:23,320 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:46:23,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:23,323 INFO  L85        PathProgramCache]: Analyzing trace with hash -1332729451, now seen corresponding path program 1 times
[2024-06-03 21:46:23,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:23,330 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915877764]
[2024-06-03 21:46:23,330 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:23,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:23,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:31,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:46:31,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:31,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915877764]
[2024-06-03 21:46:31,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915877764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:31,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:31,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 21:46:31,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549526907]
[2024-06-03 21:46:31,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:31,247 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 21:46:31,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:31,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 21:46:31,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 21:46:31,375 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 15 out of 45
[2024-06-03 21:46:31,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 81 flow. Second operand  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:46:31,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:31,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 45
[2024-06-03 21:46:31,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:32,302 INFO  L124   PetriNetUnfolderBase]: 1059/1732 cut-off events.
[2024-06-03 21:46:32,302 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-06-03 21:46:32,307 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3398 conditions, 1732 events. 1059/1732 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9220 event pairs, 698 based on Foata normal form. 1/1654 useless extension candidates. Maximal degree in co-relation 3383. Up to 1593 conditions per place. 
[2024-06-03 21:46:32,314 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 33 selfloop transitions, 4 changer transitions 0/46 dead transitions.
[2024-06-03 21:46:32,314 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 181 flow
[2024-06-03 21:46:32,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 21:46:32,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 21:46:32,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions.
[2024-06-03 21:46:32,323 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6296296296296297
[2024-06-03 21:46:32,324 INFO  L175             Difference]: Start difference. First operand has 46 places, 36 transitions, 81 flow. Second operand 3 states and 85 transitions.
[2024-06-03 21:46:32,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 181 flow
[2024-06-03 21:46:32,326 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 21:46:32,328 INFO  L231             Difference]: Finished difference. Result has 46 places, 39 transitions, 108 flow
[2024-06-03 21:46:32,329 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2024-06-03 21:46:32,332 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places.
[2024-06-03 21:46:32,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 108 flow
[2024-06-03 21:46:32,332 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:46:32,332 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:32,333 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:32,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 21:46:32,333 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:46:32,333 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:32,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -852707724, now seen corresponding path program 1 times
[2024-06-03 21:46:32,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:32,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651582324]
[2024-06-03 21:46:32,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:32,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:32,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:39,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:46:39,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:39,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651582324]
[2024-06-03 21:46:39,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651582324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:39,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:39,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 21:46:39,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909772102]
[2024-06-03 21:46:39,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:39,028 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 21:46:39,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:39,029 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 21:46:39,030 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-06-03 21:46:39,134 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45
[2024-06-03 21:46:39,134 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 108 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-06-03 21:46:39,134 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:39,134 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45
[2024-06-03 21:46:39,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:40,187 INFO  L124   PetriNetUnfolderBase]: 1215/1931 cut-off events.
[2024-06-03 21:46:40,187 INFO  L125   PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES.
[2024-06-03 21:46:40,190 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4344 conditions, 1931 events. 1215/1931 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10125 event pairs, 648 based on Foata normal form. 3/1908 useless extension candidates. Maximal degree in co-relation 4329. Up to 1803 conditions per place. 
[2024-06-03 21:46:40,196 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2024-06-03 21:46:40,196 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 250 flow
[2024-06-03 21:46:40,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 21:46:40,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 21:46:40,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions.
[2024-06-03 21:46:40,198 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5944444444444444
[2024-06-03 21:46:40,198 INFO  L175             Difference]: Start difference. First operand has 46 places, 39 transitions, 108 flow. Second operand 4 states and 107 transitions.
[2024-06-03 21:46:40,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 250 flow
[2024-06-03 21:46:40,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 21:46:40,200 INFO  L231             Difference]: Finished difference. Result has 49 places, 42 transitions, 144 flow
[2024-06-03 21:46:40,200 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=42}
[2024-06-03 21:46:40,201 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places.
[2024-06-03 21:46:40,201 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 144 flow
[2024-06-03 21:46:40,201 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-06-03 21:46:40,201 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:40,201 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:40,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 21:46:40,202 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:46:40,202 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:40,202 INFO  L85        PathProgramCache]: Analyzing trace with hash 1717067897, now seen corresponding path program 1 times
[2024-06-03 21:46:40,202 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:40,203 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947116035]
[2024-06-03 21:46:40,203 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:40,203 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:40,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:46:47,124 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:46:47,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:46:47,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947116035]
[2024-06-03 21:46:47,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947116035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:46:47,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:46:47,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:46:47,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536689430]
[2024-06-03 21:46:47,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:46:47,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:46:47,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:46:47,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:46:47,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:46:47,275 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-03 21:46:47,275 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 144 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-06-03 21:46:47,276 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:46:47,276 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-03 21:46:47,276 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:46:48,566 INFO  L124   PetriNetUnfolderBase]: 1545/2414 cut-off events.
[2024-06-03 21:46:48,566 INFO  L125   PetriNetUnfolderBase]: For 1270/1270 co-relation queries the response was YES.
[2024-06-03 21:46:48,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5988 conditions, 2414 events. 1545/2414 cut-off events. For 1270/1270 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12353 event pairs, 575 based on Foata normal form. 6/2383 useless extension candidates. Maximal degree in co-relation 5971. Up to 2233 conditions per place. 
[2024-06-03 21:46:48,577 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 53 selfloop transitions, 12 changer transitions 0/72 dead transitions.
[2024-06-03 21:46:48,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 72 transitions, 362 flow
[2024-06-03 21:46:48,578 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:46:48,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:46:48,579 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions.
[2024-06-03 21:46:48,580 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5407407407407407
[2024-06-03 21:46:48,580 INFO  L175             Difference]: Start difference. First operand has 49 places, 42 transitions, 144 flow. Second operand 6 states and 146 transitions.
[2024-06-03 21:46:48,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 72 transitions, 362 flow
[2024-06-03 21:46:48,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 342 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-06-03 21:46:48,582 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 187 flow
[2024-06-03 21:46:48,582 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2024-06-03 21:46:48,583 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places.
[2024-06-03 21:46:48,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 187 flow
[2024-06-03 21:46:48,583 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-06-03 21:46:48,583 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:46:48,583 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:46:48,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 21:46:48,584 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:46:48,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:46:48,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 906904642, now seen corresponding path program 1 times
[2024-06-03 21:46:48,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:46:48,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915229667]
[2024-06-03 21:46:48,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:46:48,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:46:48,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:02,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:02,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:02,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915229667]
[2024-06-03 21:47:02,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915229667] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:02,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:02,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:47:02,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403821763]
[2024-06-03 21:47:02,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:02,525 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:47:02,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:02,526 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:47:02,526 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:47:02,705 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-03 21:47:02,706 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 187 flow. Second operand  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:02,706 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:02,706 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-03 21:47:02,706 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:03,842 INFO  L124   PetriNetUnfolderBase]: 1333/2160 cut-off events.
[2024-06-03 21:47:03,842 INFO  L125   PetriNetUnfolderBase]: For 2120/2120 co-relation queries the response was YES.
[2024-06-03 21:47:03,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5815 conditions, 2160 events. 1333/2160 cut-off events. For 2120/2120 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11329 event pairs, 592 based on Foata normal form. 2/2115 useless extension candidates. Maximal degree in co-relation 5796. Up to 1980 conditions per place. 
[2024-06-03 21:47:03,853 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 44 selfloop transitions, 8 changer transitions 0/60 dead transitions.
[2024-06-03 21:47:03,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 333 flow
[2024-06-03 21:47:03,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:47:03,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:47:03,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions.
[2024-06-03 21:47:03,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49333333333333335
[2024-06-03 21:47:03,857 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 187 flow. Second operand 5 states and 111 transitions.
[2024-06-03 21:47:03,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 333 flow
[2024-06-03 21:47:03,861 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 306 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-03 21:47:03,863 INFO  L231             Difference]: Finished difference. Result has 55 places, 49 transitions, 204 flow
[2024-06-03 21:47:03,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=55, PETRI_TRANSITIONS=49}
[2024-06-03 21:47:03,864 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places.
[2024-06-03 21:47:03,864 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 49 transitions, 204 flow
[2024-06-03 21:47:03,865 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:47:03,865 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:03,865 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:03,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 21:47:03,865 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:03,865 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:03,866 INFO  L85        PathProgramCache]: Analyzing trace with hash -1940001318, now seen corresponding path program 1 times
[2024-06-03 21:47:03,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:03,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753809982]
[2024-06-03 21:47:03,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:03,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:03,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:17,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:17,502 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:17,502 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753809982]
[2024-06-03 21:47:17,502 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753809982] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:17,503 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:17,503 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:47:17,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946253630]
[2024-06-03 21:47:17,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:17,503 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:47:17,503 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:17,504 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:47:17,504 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:47:17,720 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:47:17,721 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 49 transitions, 204 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-06-03 21:47:17,721 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:17,721 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:47:17,721 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:19,052 INFO  L124   PetriNetUnfolderBase]: 1571/2551 cut-off events.
[2024-06-03 21:47:19,052 INFO  L125   PetriNetUnfolderBase]: For 3658/3658 co-relation queries the response was YES.
[2024-06-03 21:47:19,055 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7295 conditions, 2551 events. 1571/2551 cut-off events. For 3658/3658 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13562 event pairs, 706 based on Foata normal form. 2/2528 useless extension candidates. Maximal degree in co-relation 7274. Up to 2317 conditions per place. 
[2024-06-03 21:47:19,064 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 49 selfloop transitions, 11 changer transitions 0/67 dead transitions.
[2024-06-03 21:47:19,064 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 380 flow
[2024-06-03 21:47:19,065 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:47:19,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:47:19,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions.
[2024-06-03 21:47:19,065 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-03 21:47:19,066 INFO  L175             Difference]: Start difference. First operand has 55 places, 49 transitions, 204 flow. Second operand 6 states and 126 transitions.
[2024-06-03 21:47:19,066 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 380 flow
[2024-06-03 21:47:19,068 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 360 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-03 21:47:19,069 INFO  L231             Difference]: Finished difference. Result has 58 places, 52 transitions, 238 flow
[2024-06-03 21:47:19,069 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=58, PETRI_TRANSITIONS=52}
[2024-06-03 21:47:19,069 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 12 predicate places.
[2024-06-03 21:47:19,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 238 flow
[2024-06-03 21:47:19,070 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-06-03 21:47:19,070 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:19,070 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:19,070 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 21:47:19,070 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:19,071 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:19,071 INFO  L85        PathProgramCache]: Analyzing trace with hash -5350537, now seen corresponding path program 1 times
[2024-06-03 21:47:19,071 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:19,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132259895]
[2024-06-03 21:47:19,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:19,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:19,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:34,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:34,781 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:34,781 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132259895]
[2024-06-03 21:47:34,781 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132259895] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:34,781 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:34,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:47:34,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652672702]
[2024-06-03 21:47:34,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:34,781 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:47:34,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:34,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:47:34,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:47:34,911 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:47:34,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 238 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-06-03 21:47:34,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:34,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:47:34,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:36,443 INFO  L124   PetriNetUnfolderBase]: 1718/2721 cut-off events.
[2024-06-03 21:47:36,444 INFO  L125   PetriNetUnfolderBase]: For 6155/6161 co-relation queries the response was YES.
[2024-06-03 21:47:36,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 2721 events. 1718/2721 cut-off events. For 6155/6161 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14253 event pairs, 749 based on Foata normal form. 6/2711 useless extension candidates. Maximal degree in co-relation 8504. Up to 2498 conditions per place. 
[2024-06-03 21:47:36,458 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 54 selfloop transitions, 16 changer transitions 0/78 dead transitions.
[2024-06-03 21:47:36,458 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 488 flow
[2024-06-03 21:47:36,459 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:47:36,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:47:36,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-06-03 21:47:36,459 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4925925925925926
[2024-06-03 21:47:36,459 INFO  L175             Difference]: Start difference. First operand has 58 places, 52 transitions, 238 flow. Second operand 6 states and 133 transitions.
[2024-06-03 21:47:36,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 488 flow
[2024-06-03 21:47:36,461 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 458 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-03 21:47:36,462 INFO  L231             Difference]: Finished difference. Result has 60 places, 58 transitions, 294 flow
[2024-06-03 21:47:36,463 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=60, PETRI_TRANSITIONS=58}
[2024-06-03 21:47:36,463 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places.
[2024-06-03 21:47:36,463 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 294 flow
[2024-06-03 21:47:36,463 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-06-03 21:47:36,464 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:36,464 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:36,464 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 21:47:36,464 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:36,464 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:36,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1112963, now seen corresponding path program 2 times
[2024-06-03 21:47:36,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:36,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034625281]
[2024-06-03 21:47:36,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:36,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:36,504 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:47:52,088 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:47:52,088 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:47:52,088 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034625281]
[2024-06-03 21:47:52,088 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034625281] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:47:52,089 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:47:52,089 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:47:52,089 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382414286]
[2024-06-03 21:47:52,089 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:47:52,089 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:47:52,089 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:47:52,090 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:47:52,090 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:47:52,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:47:52,213 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 294 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-06-03 21:47:52,213 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:47:52,213 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:47:52,213 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:47:53,701 INFO  L124   PetriNetUnfolderBase]: 1713/2715 cut-off events.
[2024-06-03 21:47:53,701 INFO  L125   PetriNetUnfolderBase]: For 8331/8336 co-relation queries the response was YES.
[2024-06-03 21:47:53,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9128 conditions, 2715 events. 1713/2715 cut-off events. For 8331/8336 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14252 event pairs, 752 based on Foata normal form. 6/2705 useless extension candidates. Maximal degree in co-relation 9105. Up to 2493 conditions per place. 
[2024-06-03 21:47:53,713 INFO  L140   encePairwiseOnDemand]: 36/45 looper letters, 49 selfloop transitions, 16 changer transitions 0/73 dead transitions.
[2024-06-03 21:47:53,713 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 462 flow
[2024-06-03 21:47:53,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:47:53,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:47:53,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions.
[2024-06-03 21:47:53,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4740740740740741
[2024-06-03 21:47:53,715 INFO  L175             Difference]: Start difference. First operand has 60 places, 58 transitions, 294 flow. Second operand 6 states and 128 transitions.
[2024-06-03 21:47:53,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 462 flow
[2024-06-03 21:47:53,719 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 428 flow, removed 13 selfloop flow, removed 2 redundant places.
[2024-06-03 21:47:53,720 INFO  L231             Difference]: Finished difference. Result has 64 places, 58 transitions, 300 flow
[2024-06-03 21:47:53,720 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=64, PETRI_TRANSITIONS=58}
[2024-06-03 21:47:53,720 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places.
[2024-06-03 21:47:53,720 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 300 flow
[2024-06-03 21:47:53,721 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-06-03 21:47:53,721 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:47:53,721 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:47:53,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 21:47:53,721 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:47:53,721 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:47:53,721 INFO  L85        PathProgramCache]: Analyzing trace with hash -342965151, now seen corresponding path program 1 times
[2024-06-03 21:47:53,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:47:53,721 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781513662]
[2024-06-03 21:47:53,721 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:47:53,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:47:53,752 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:10,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:10,644 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:10,644 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781513662]
[2024-06-03 21:48:10,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781513662] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:10,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:10,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:10,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937073412]
[2024-06-03 21:48:10,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:10,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:10,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:10,645 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:10,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:10,826 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:48:10,826 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 300 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-06-03 21:48:10,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:10,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:48:10,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:12,268 INFO  L124   PetriNetUnfolderBase]: 1567/2570 cut-off events.
[2024-06-03 21:48:12,268 INFO  L125   PetriNetUnfolderBase]: For 8128/8128 co-relation queries the response was YES.
[2024-06-03 21:48:12,271 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 2570 events. 1567/2570 cut-off events. For 8128/8128 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13792 event pairs, 652 based on Foata normal form. 4/2562 useless extension candidates. Maximal degree in co-relation 8501. Up to 2294 conditions per place. 
[2024-06-03 21:48:12,278 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 60 selfloop transitions, 14 changer transitions 0/81 dead transitions.
[2024-06-03 21:48:12,279 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 81 transitions, 522 flow
[2024-06-03 21:48:12,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:48:12,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:48:12,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions.
[2024-06-03 21:48:12,282 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634920634920635
[2024-06-03 21:48:12,283 INFO  L175             Difference]: Start difference. First operand has 64 places, 58 transitions, 300 flow. Second operand 7 states and 146 transitions.
[2024-06-03 21:48:12,288 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 81 transitions, 522 flow
[2024-06-03 21:48:12,292 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 81 transitions, 478 flow, removed 2 selfloop flow, removed 6 redundant places.
[2024-06-03 21:48:12,294 INFO  L231             Difference]: Finished difference. Result has 65 places, 61 transitions, 322 flow
[2024-06-03 21:48:12,294 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=65, PETRI_TRANSITIONS=61}
[2024-06-03 21:48:12,297 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 19 predicate places.
[2024-06-03 21:48:12,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 322 flow
[2024-06-03 21:48:12,297 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-06-03 21:48:12,297 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:12,297 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:12,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 21:48:12,298 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:12,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:12,298 INFO  L85        PathProgramCache]: Analyzing trace with hash 2075485607, now seen corresponding path program 1 times
[2024-06-03 21:48:12,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:12,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103481521]
[2024-06-03 21:48:12,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:12,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:12,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:28,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:28,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:28,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103481521]
[2024-06-03 21:48:28,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103481521] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:28,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:28,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:28,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247261858]
[2024-06-03 21:48:28,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:28,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:28,834 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:28,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:28,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:29,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:48:29,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 322 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-06-03 21:48:29,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:29,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:48:29,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:30,549 INFO  L124   PetriNetUnfolderBase]: 1714/2732 cut-off events.
[2024-06-03 21:48:30,549 INFO  L125   PetriNetUnfolderBase]: For 12078/12078 co-relation queries the response was YES.
[2024-06-03 21:48:30,553 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9855 conditions, 2732 events. 1714/2732 cut-off events. For 12078/12078 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14373 event pairs, 700 based on Foata normal form. 2/2721 useless extension candidates. Maximal degree in co-relation 9830. Up to 2498 conditions per place. 
[2024-06-03 21:48:30,560 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 67 selfloop transitions, 14 changer transitions 0/89 dead transitions.
[2024-06-03 21:48:30,560 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 89 transitions, 574 flow
[2024-06-03 21:48:30,568 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:48:30,568 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:48:30,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions.
[2024-06-03 21:48:30,569 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4793650793650794
[2024-06-03 21:48:30,569 INFO  L175             Difference]: Start difference. First operand has 65 places, 61 transitions, 322 flow. Second operand 7 states and 151 transitions.
[2024-06-03 21:48:30,569 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 89 transitions, 574 flow
[2024-06-03 21:48:30,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 532 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-03 21:48:30,574 INFO  L231             Difference]: Finished difference. Result has 67 places, 64 transitions, 348 flow
[2024-06-03 21:48:30,574 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=348, PETRI_PLACES=67, PETRI_TRANSITIONS=64}
[2024-06-03 21:48:30,575 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places.
[2024-06-03 21:48:30,575 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 348 flow
[2024-06-03 21:48:30,575 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-06-03 21:48:30,575 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:30,575 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:30,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 21:48:30,575 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:30,576 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:30,576 INFO  L85        PathProgramCache]: Analyzing trace with hash 2075605763, now seen corresponding path program 1 times
[2024-06-03 21:48:30,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:30,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006669891]
[2024-06-03 21:48:30,576 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:30,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:30,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:48:48,199 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:48:48,199 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:48:48,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006669891]
[2024-06-03 21:48:48,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006669891] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:48:48,200 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:48:48,200 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:48:48,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835319614]
[2024-06-03 21:48:48,200 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:48:48,201 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:48:48,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:48:48,201 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:48:48,201 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:48:48,361 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:48:48,361 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 348 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-06-03 21:48:48,361 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:48:48,361 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:48:48,361 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:48:49,969 INFO  L124   PetriNetUnfolderBase]: 1833/2856 cut-off events.
[2024-06-03 21:48:49,969 INFO  L125   PetriNetUnfolderBase]: For 14992/14998 co-relation queries the response was YES.
[2024-06-03 21:48:49,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10851 conditions, 2856 events. 1833/2856 cut-off events. For 14992/14998 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14573 event pairs, 748 based on Foata normal form. 6/2847 useless extension candidates. Maximal degree in co-relation 10825. Up to 2635 conditions per place. 
[2024-06-03 21:48:49,982 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 71 selfloop transitions, 25 changer transitions 0/102 dead transitions.
[2024-06-03 21:48:49,982 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 102 transitions, 708 flow
[2024-06-03 21:48:49,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:48:49,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:48:49,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-03 21:48:49,984 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44938271604938274
[2024-06-03 21:48:49,984 INFO  L175             Difference]: Start difference. First operand has 67 places, 64 transitions, 348 flow. Second operand 9 states and 182 transitions.
[2024-06-03 21:48:49,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 102 transitions, 708 flow
[2024-06-03 21:48:49,989 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 664 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-06-03 21:48:49,991 INFO  L231             Difference]: Finished difference. Result has 71 places, 70 transitions, 420 flow
[2024-06-03 21:48:49,991 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=420, PETRI_PLACES=71, PETRI_TRANSITIONS=70}
[2024-06-03 21:48:49,991 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places.
[2024-06-03 21:48:49,991 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 420 flow
[2024-06-03 21:48:49,992 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-06-03 21:48:49,992 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:48:49,992 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:48:49,992 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 21:48:49,992 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:48:49,992 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:48:49,992 INFO  L85        PathProgramCache]: Analyzing trace with hash -332099521, now seen corresponding path program 2 times
[2024-06-03 21:48:49,993 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:48:49,993 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101023899]
[2024-06-03 21:48:49,993 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:48:49,993 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:48:50,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:06,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:06,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:06,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101023899]
[2024-06-03 21:49:06,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101023899] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:06,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:06,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:06,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983918104]
[2024-06-03 21:49:06,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:06,403 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:06,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:06,403 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:06,403 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:06,600 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:49:06,601 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 420 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-06-03 21:49:06,601 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:06,601 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:49:06,601 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:08,245 INFO  L124   PetriNetUnfolderBase]: 1741/2778 cut-off events.
[2024-06-03 21:49:08,245 INFO  L125   PetriNetUnfolderBase]: For 18480/18483 co-relation queries the response was YES.
[2024-06-03 21:49:08,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11143 conditions, 2778 events. 1741/2778 cut-off events. For 18480/18483 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14655 event pairs, 696 based on Foata normal form. 4/2767 useless extension candidates. Maximal degree in co-relation 11116. Up to 2481 conditions per place. 
[2024-06-03 21:49:08,258 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 64 selfloop transitions, 26 changer transitions 0/100 dead transitions.
[2024-06-03 21:49:08,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 768 flow
[2024-06-03 21:49:08,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:08,259 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:08,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions.
[2024-06-03 21:49:08,260 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-06-03 21:49:08,260 INFO  L175             Difference]: Start difference. First operand has 71 places, 70 transitions, 420 flow. Second operand 7 states and 154 transitions.
[2024-06-03 21:49:08,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 768 flow
[2024-06-03 21:49:08,267 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 100 transitions, 720 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-06-03 21:49:08,268 INFO  L231             Difference]: Finished difference. Result has 73 places, 76 transitions, 506 flow
[2024-06-03 21:49:08,268 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=73, PETRI_TRANSITIONS=76}
[2024-06-03 21:49:08,269 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places.
[2024-06-03 21:49:08,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 506 flow
[2024-06-03 21:49:08,269 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-06-03 21:49:08,269 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:08,269 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:08,269 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 21:49:08,270 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:08,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:08,270 INFO  L85        PathProgramCache]: Analyzing trace with hash 34740095, now seen corresponding path program 2 times
[2024-06-03 21:49:08,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:08,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694363858]
[2024-06-03 21:49:08,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:08,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:08,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:25,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:25,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:25,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694363858]
[2024-06-03 21:49:25,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694363858] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:25,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:25,785 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:25,785 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589470958]
[2024-06-03 21:49:25,785 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:25,785 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:25,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:25,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:25,786 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:25,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:49:25,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 506 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-06-03 21:49:25,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:25,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:49:25,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:27,513 INFO  L124   PetriNetUnfolderBase]: 1855/2898 cut-off events.
[2024-06-03 21:49:27,513 INFO  L125   PetriNetUnfolderBase]: For 22603/22608 co-relation queries the response was YES.
[2024-06-03 21:49:27,518 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12287 conditions, 2898 events. 1855/2898 cut-off events. For 22603/22608 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14842 event pairs, 751 based on Foata normal form. 6/2889 useless extension candidates. Maximal degree in co-relation 12258. Up to 2663 conditions per place. 
[2024-06-03 21:49:27,525 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 67 selfloop transitions, 27 changer transitions 0/100 dead transitions.
[2024-06-03 21:49:27,526 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 100 transitions, 818 flow
[2024-06-03 21:49:27,526 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:27,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:27,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-03 21:49:27,527 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45714285714285713
[2024-06-03 21:49:27,527 INFO  L175             Difference]: Start difference. First operand has 73 places, 76 transitions, 506 flow. Second operand 7 states and 144 transitions.
[2024-06-03 21:49:27,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 100 transitions, 818 flow
[2024-06-03 21:49:27,534 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 100 transitions, 774 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-03 21:49:27,535 INFO  L231             Difference]: Finished difference. Result has 77 places, 79 transitions, 552 flow
[2024-06-03 21:49:27,536 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=552, PETRI_PLACES=77, PETRI_TRANSITIONS=79}
[2024-06-03 21:49:27,536 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 31 predicate places.
[2024-06-03 21:49:27,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 552 flow
[2024-06-03 21:49:27,536 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-06-03 21:49:27,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:27,537 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:27,537 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 21:49:27,537 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:27,537 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:27,537 INFO  L85        PathProgramCache]: Analyzing trace with hash -325670431, now seen corresponding path program 3 times
[2024-06-03 21:49:27,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:27,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083844741]
[2024-06-03 21:49:27,538 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:27,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:27,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:49:43,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:49:43,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:49:43,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083844741]
[2024-06-03 21:49:43,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083844741] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:49:43,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:49:43,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:49:43,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985291887]
[2024-06-03 21:49:43,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:49:43,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:49:43,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:49:43,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:49:43,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:49:43,780 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:49:43,780 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 552 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-06-03 21:49:43,780 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:49:43,781 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:49:43,781 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:49:45,372 INFO  L124   PetriNetUnfolderBase]: 1747/2785 cut-off events.
[2024-06-03 21:49:45,372 INFO  L125   PetriNetUnfolderBase]: For 25304/25306 co-relation queries the response was YES.
[2024-06-03 21:49:45,376 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12114 conditions, 2785 events. 1747/2785 cut-off events. For 25304/25306 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14670 event pairs, 706 based on Foata normal form. 2/2770 useless extension candidates. Maximal degree in co-relation 12083. Up to 2487 conditions per place. 
[2024-06-03 21:49:45,383 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 61 selfloop transitions, 26 changer transitions 0/98 dead transitions.
[2024-06-03 21:49:45,383 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 98 transitions, 774 flow
[2024-06-03 21:49:45,383 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:49:45,383 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:49:45,384 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions.
[2024-06-03 21:49:45,384 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.473015873015873
[2024-06-03 21:49:45,384 INFO  L175             Difference]: Start difference. First operand has 77 places, 79 transitions, 552 flow. Second operand 7 states and 149 transitions.
[2024-06-03 21:49:45,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 98 transitions, 774 flow
[2024-06-03 21:49:45,393 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 98 transitions, 702 flow, removed 17 selfloop flow, removed 4 redundant places.
[2024-06-03 21:49:45,394 INFO  L231             Difference]: Finished difference. Result has 80 places, 79 transitions, 540 flow
[2024-06-03 21:49:45,394 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=80, PETRI_TRANSITIONS=79}
[2024-06-03 21:49:45,395 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places.
[2024-06-03 21:49:45,395 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 540 flow
[2024-06-03 21:49:45,395 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-06-03 21:49:45,395 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:49:45,395 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:49:45,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 21:49:45,396 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:49:45,396 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:49:45,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -700090913, now seen corresponding path program 3 times
[2024-06-03 21:49:45,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:49:45,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868490464]
[2024-06-03 21:49:45,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:49:45,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:49:45,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:02,591 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:02,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:02,591 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868490464]
[2024-06-03 21:50:02,591 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868490464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:02,592 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:02,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:50:02,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231104251]
[2024-06-03 21:50:02,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:02,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:50:02,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:02,592 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:50:02,592 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:50:02,717 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:50:02,718 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 540 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-06-03 21:50:02,718 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:02,718 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:50:02,718 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:04,332 INFO  L124   PetriNetUnfolderBase]: 1845/2884 cut-off events.
[2024-06-03 21:50:04,332 INFO  L125   PetriNetUnfolderBase]: For 28254/28259 co-relation queries the response was YES.
[2024-06-03 21:50:04,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12733 conditions, 2884 events. 1845/2884 cut-off events. For 28254/28259 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14785 event pairs, 751 based on Foata normal form. 6/2875 useless extension candidates. Maximal degree in co-relation 12701. Up to 2651 conditions per place. 
[2024-06-03 21:50:04,347 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 72 selfloop transitions, 28 changer transitions 0/106 dead transitions.
[2024-06-03 21:50:04,347 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 106 transitions, 808 flow
[2024-06-03 21:50:04,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:50:04,348 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:50:04,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-03 21:50:04,348 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43950617283950616
[2024-06-03 21:50:04,348 INFO  L175             Difference]: Start difference. First operand has 80 places, 79 transitions, 540 flow. Second operand 9 states and 178 transitions.
[2024-06-03 21:50:04,349 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 106 transitions, 808 flow
[2024-06-03 21:50:04,359 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 106 transitions, 722 flow, removed 13 selfloop flow, removed 6 redundant places.
[2024-06-03 21:50:04,361 INFO  L231             Difference]: Finished difference. Result has 83 places, 79 transitions, 518 flow
[2024-06-03 21:50:04,361 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=83, PETRI_TRANSITIONS=79}
[2024-06-03 21:50:04,361 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 37 predicate places.
[2024-06-03 21:50:04,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 518 flow
[2024-06-03 21:50:04,362 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-06-03 21:50:04,362 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:04,362 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:04,362 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 21:50:04,362 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:04,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:04,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 1669889067, now seen corresponding path program 1 times
[2024-06-03 21:50:04,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:04,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093015476]
[2024-06-03 21:50:04,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:04,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:04,414 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:21,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:21,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:21,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093015476]
[2024-06-03 21:50:21,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093015476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:21,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:21,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:50:21,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250302093]
[2024-06-03 21:50:21,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:21,095 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:50:21,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:21,095 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:50:21,095 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:50:21,301 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45
[2024-06-03 21:50:21,301 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 518 flow. Second operand  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:50:21,301 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:21,301 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45
[2024-06-03 21:50:21,301 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:22,338 INFO  L124   PetriNetUnfolderBase]: 1386/2408 cut-off events.
[2024-06-03 21:50:22,338 INFO  L125   PetriNetUnfolderBase]: For 26005/26005 co-relation queries the response was YES.
[2024-06-03 21:50:22,344 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10597 conditions, 2408 events. 1386/2408 cut-off events. For 26005/26005 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13720 event pairs, 588 based on Foata normal form. 1/2395 useless extension candidates. Maximal degree in co-relation 10564. Up to 2045 conditions per place. 
[2024-06-03 21:50:22,351 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 63 selfloop transitions, 8 changer transitions 0/90 dead transitions.
[2024-06-03 21:50:22,351 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 90 transitions, 700 flow
[2024-06-03 21:50:22,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:50:22,351 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:50:22,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions.
[2024-06-03 21:50:22,352 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49333333333333335
[2024-06-03 21:50:22,352 INFO  L175             Difference]: Start difference. First operand has 83 places, 79 transitions, 518 flow. Second operand 5 states and 111 transitions.
[2024-06-03 21:50:22,352 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 90 transitions, 700 flow
[2024-06-03 21:50:22,362 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 90 transitions, 628 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-03 21:50:22,363 INFO  L231             Difference]: Finished difference. Result has 79 places, 82 transitions, 494 flow
[2024-06-03 21:50:22,363 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=79, PETRI_TRANSITIONS=82}
[2024-06-03 21:50:22,365 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places.
[2024-06-03 21:50:22,365 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 494 flow
[2024-06-03 21:50:22,365 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:50:22,365 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:22,365 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:22,367 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 21:50:22,367 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:22,367 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:22,367 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088580945, now seen corresponding path program 1 times
[2024-06-03 21:50:22,367 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:22,367 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749583122]
[2024-06-03 21:50:22,367 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:22,367 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:22,411 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:40,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-06-03 21:50:40,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:40,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749583122]
[2024-06-03 21:50:40,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749583122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:40,124 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:40,124 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:40,124 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941272792]
[2024-06-03 21:50:40,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:40,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:40,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:40,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:40,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:40,347 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:50:40,348 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 494 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-06-03 21:50:40,348 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:40,348 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:50:40,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:50:42,019 INFO  L124   PetriNetUnfolderBase]: 1853/2889 cut-off events.
[2024-06-03 21:50:42,019 INFO  L125   PetriNetUnfolderBase]: For 34402/34402 co-relation queries the response was YES.
[2024-06-03 21:50:42,025 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13472 conditions, 2889 events. 1853/2889 cut-off events. For 34402/34402 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14721 event pairs, 722 based on Foata normal form. 2/2889 useless extension candidates. Maximal degree in co-relation 13438. Up to 2693 conditions per place. 
[2024-06-03 21:50:42,033 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 91 selfloop transitions, 17 changer transitions 0/114 dead transitions.
[2024-06-03 21:50:42,033 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 820 flow
[2024-06-03 21:50:42,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:50:42,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:50:42,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-03 21:50:42,034 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4527777777777778
[2024-06-03 21:50:42,034 INFO  L175             Difference]: Start difference. First operand has 79 places, 82 transitions, 494 flow. Second operand 8 states and 163 transitions.
[2024-06-03 21:50:42,034 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 820 flow
[2024-06-03 21:50:42,049 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 114 transitions, 794 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-06-03 21:50:42,051 INFO  L231             Difference]: Finished difference. Result has 84 places, 85 transitions, 552 flow
[2024-06-03 21:50:42,051 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=552, PETRI_PLACES=84, PETRI_TRANSITIONS=85}
[2024-06-03 21:50:42,051 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 38 predicate places.
[2024-06-03 21:50:42,052 INFO  L495      AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 552 flow
[2024-06-03 21:50:42,052 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-06-03 21:50:42,052 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:50:42,052 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:50:42,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 21:50:42,052 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:50:42,053 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:50:42,053 INFO  L85        PathProgramCache]: Analyzing trace with hash -846869583, now seen corresponding path program 2 times
[2024-06-03 21:50:42,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:50:42,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392610648]
[2024-06-03 21:50:42,053 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:50:42,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:50:42,090 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:50:59,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:50:59,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:50:59,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392610648]
[2024-06-03 21:50:59,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392610648] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:50:59,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:50:59,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:50:59,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780271177]
[2024-06-03 21:50:59,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:50:59,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:50:59,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:50:59,600 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:50:59,600 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:50:59,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:50:59,767 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 552 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-06-03 21:50:59,767 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:50:59,767 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:50:59,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:01,562 INFO  L124   PetriNetUnfolderBase]: 1880/2943 cut-off events.
[2024-06-03 21:51:01,562 INFO  L125   PetriNetUnfolderBase]: For 40103/40106 co-relation queries the response was YES.
[2024-06-03 21:51:01,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14384 conditions, 2943 events. 1880/2943 cut-off events. For 40103/40106 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15128 event pairs, 726 based on Foata normal form. 4/2944 useless extension candidates. Maximal degree in co-relation 14349. Up to 2610 conditions per place. 
[2024-06-03 21:51:01,575 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 86 selfloop transitions, 48 changer transitions 0/140 dead transitions.
[2024-06-03 21:51:01,575 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 140 transitions, 1184 flow
[2024-06-03 21:51:01,575 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 21:51:01,575 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 21:51:01,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 242 transitions.
[2024-06-03 21:51:01,576 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44814814814814813
[2024-06-03 21:51:01,576 INFO  L175             Difference]: Start difference. First operand has 84 places, 85 transitions, 552 flow. Second operand 12 states and 242 transitions.
[2024-06-03 21:51:01,576 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 140 transitions, 1184 flow
[2024-06-03 21:51:01,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 140 transitions, 1124 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 21:51:01,592 INFO  L231             Difference]: Finished difference. Result has 90 places, 94 transitions, 728 flow
[2024-06-03 21:51:01,592 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=728, PETRI_PLACES=90, PETRI_TRANSITIONS=94}
[2024-06-03 21:51:01,592 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 44 predicate places.
[2024-06-03 21:51:01,592 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 728 flow
[2024-06-03 21:51:01,593 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-06-03 21:51:01,593 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:01,593 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:01,593 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 21:51:01,593 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:01,593 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:01,593 INFO  L85        PathProgramCache]: Analyzing trace with hash -2088431215, now seen corresponding path program 3 times
[2024-06-03 21:51:01,594 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:01,594 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510074682]
[2024-06-03 21:51:01,594 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:01,594 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:01,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:18,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:18,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:18,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510074682]
[2024-06-03 21:51:18,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510074682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:18,789 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:18,789 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:18,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086440782]
[2024-06-03 21:51:18,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:18,789 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:18,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:18,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:18,790 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:19,030 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:51:19,031 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 728 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-06-03 21:51:19,031 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:19,031 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:51:19,031 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:20,694 INFO  L124   PetriNetUnfolderBase]: 1875/2936 cut-off events.
[2024-06-03 21:51:20,694 INFO  L125   PetriNetUnfolderBase]: For 45667/45670 co-relation queries the response was YES.
[2024-06-03 21:51:20,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14987 conditions, 2936 events. 1875/2936 cut-off events. For 45667/45670 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15107 event pairs, 726 based on Foata normal form. 4/2937 useless extension candidates. Maximal degree in co-relation 14951. Up to 2605 conditions per place. 
[2024-06-03 21:51:20,708 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 77 selfloop transitions, 47 changer transitions 0/130 dead transitions.
[2024-06-03 21:51:20,708 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 130 transitions, 1132 flow
[2024-06-03 21:51:20,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:51:20,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:51:20,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 204 transitions.
[2024-06-03 21:51:20,710 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4533333333333333
[2024-06-03 21:51:20,710 INFO  L175             Difference]: Start difference. First operand has 90 places, 94 transitions, 728 flow. Second operand 10 states and 204 transitions.
[2024-06-03 21:51:20,710 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 130 transitions, 1132 flow
[2024-06-03 21:51:20,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 130 transitions, 1010 flow, removed 39 selfloop flow, removed 7 redundant places.
[2024-06-03 21:51:20,727 INFO  L231             Difference]: Finished difference. Result has 93 places, 94 transitions, 708 flow
[2024-06-03 21:51:20,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=708, PETRI_PLACES=93, PETRI_TRANSITIONS=94}
[2024-06-03 21:51:20,728 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 47 predicate places.
[2024-06-03 21:51:20,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 94 transitions, 708 flow
[2024-06-03 21:51:20,728 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-06-03 21:51:20,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:20,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:20,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 21:51:20,728 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:20,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:20,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -80729664, now seen corresponding path program 1 times
[2024-06-03 21:51:20,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:20,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190078011]
[2024-06-03 21:51:20,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:20,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:20,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:38,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:38,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:38,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190078011]
[2024-06-03 21:51:38,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190078011] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:38,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:38,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:38,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415549866]
[2024-06-03 21:51:38,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:38,430 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:38,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:38,431 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:38,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:38,603 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:51:38,603 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 94 transitions, 708 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-06-03 21:51:38,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:38,603 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:51:38,603 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:51:40,362 INFO  L124   PetriNetUnfolderBase]: 1897/2971 cut-off events.
[2024-06-03 21:51:40,362 INFO  L125   PetriNetUnfolderBase]: For 50304/50307 co-relation queries the response was YES.
[2024-06-03 21:51:40,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15415 conditions, 2971 events. 1897/2971 cut-off events. For 50304/50307 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15260 event pairs, 668 based on Foata normal form. 6/2974 useless extension candidates. Maximal degree in co-relation 15377. Up to 2652 conditions per place. 
[2024-06-03 21:51:40,378 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 99 selfloop transitions, 34 changer transitions 0/139 dead transitions.
[2024-06-03 21:51:40,378 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 139 transitions, 1212 flow
[2024-06-03 21:51:40,379 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:51:40,379 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:51:40,380 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-03 21:51:40,381 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45555555555555555
[2024-06-03 21:51:40,381 INFO  L175             Difference]: Start difference. First operand has 93 places, 94 transitions, 708 flow. Second operand 10 states and 205 transitions.
[2024-06-03 21:51:40,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 139 transitions, 1212 flow
[2024-06-03 21:51:40,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 139 transitions, 1118 flow, removed 0 selfloop flow, removed 9 redundant places.
[2024-06-03 21:51:40,399 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 768 flow
[2024-06-03 21:51:40,399 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=94, PETRI_TRANSITIONS=100}
[2024-06-03 21:51:40,399 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places.
[2024-06-03 21:51:40,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 768 flow
[2024-06-03 21:51:40,400 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-06-03 21:51:40,400 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:51:40,400 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:51:40,400 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 21:51:40,400 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:51:40,400 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:51:40,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 1076943851, now seen corresponding path program 4 times
[2024-06-03 21:51:40,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:51:40,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501273245]
[2024-06-03 21:51:40,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:51:40,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:51:40,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:51:58,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:51:58,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:51:58,460 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501273245]
[2024-06-03 21:51:58,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501273245] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:51:58,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:51:58,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:51:58,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764752665]
[2024-06-03 21:51:58,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:51:58,461 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:51:58,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:51:58,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:51:58,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:51:58,658 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:51:58,659 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 768 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-06-03 21:51:58,659 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:51:58,659 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:51:58,659 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:00,290 INFO  L124   PetriNetUnfolderBase]: 1908/2985 cut-off events.
[2024-06-03 21:52:00,290 INFO  L125   PetriNetUnfolderBase]: For 55733/55735 co-relation queries the response was YES.
[2024-06-03 21:52:00,295 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16067 conditions, 2985 events. 1908/2985 cut-off events. For 55733/55735 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15307 event pairs, 714 based on Foata normal form. 2/2982 useless extension candidates. Maximal degree in co-relation 16028. Up to 2649 conditions per place. 
[2024-06-03 21:52:00,304 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 73 selfloop transitions, 49 changer transitions 0/128 dead transitions.
[2024-06-03 21:52:00,304 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 128 transitions, 1190 flow
[2024-06-03 21:52:00,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:52:00,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:52:00,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-03 21:52:00,305 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-03 21:52:00,305 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 768 flow. Second operand 8 states and 165 transitions.
[2024-06-03 21:52:00,305 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 128 transitions, 1190 flow
[2024-06-03 21:52:00,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1124 flow, removed 18 selfloop flow, removed 6 redundant places.
[2024-06-03 21:52:00,329 INFO  L231             Difference]: Finished difference. Result has 96 places, 103 transitions, 850 flow
[2024-06-03 21:52:00,329 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=850, PETRI_PLACES=96, PETRI_TRANSITIONS=103}
[2024-06-03 21:52:00,330 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 50 predicate places.
[2024-06-03 21:52:00,330 INFO  L495      AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 850 flow
[2024-06-03 21:52:00,330 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-06-03 21:52:00,330 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:00,330 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:00,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 21:52:00,331 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:00,331 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:00,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -1498490230, now seen corresponding path program 2 times
[2024-06-03 21:52:00,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:00,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86241833]
[2024-06-03 21:52:00,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:00,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:00,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:19,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:52:19,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:19,237 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86241833]
[2024-06-03 21:52:19,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86241833] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:19,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:19,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:19,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496671304]
[2024-06-03 21:52:19,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:19,238 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:19,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:19,239 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:19,239 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:19,454 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:52:19,454 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 850 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-06-03 21:52:19,454 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:19,454 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:52:19,454 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:21,091 INFO  L124   PetriNetUnfolderBase]: 1962/3071 cut-off events.
[2024-06-03 21:52:21,091 INFO  L125   PetriNetUnfolderBase]: For 62079/62084 co-relation queries the response was YES.
[2024-06-03 21:52:21,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16830 conditions, 3071 events. 1962/3071 cut-off events. For 62079/62084 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15764 event pairs, 671 based on Foata normal form. 8/3076 useless extension candidates. Maximal degree in co-relation 16789. Up to 2714 conditions per place. 
[2024-06-03 21:52:21,107 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 94 selfloop transitions, 39 changer transitions 0/139 dead transitions.
[2024-06-03 21:52:21,107 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 139 transitions, 1416 flow
[2024-06-03 21:52:21,108 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:52:21,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:52:21,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions.
[2024-06-03 21:52:21,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46944444444444444
[2024-06-03 21:52:21,108 INFO  L175             Difference]: Start difference. First operand has 96 places, 103 transitions, 850 flow. Second operand 8 states and 169 transitions.
[2024-06-03 21:52:21,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 139 transitions, 1416 flow
[2024-06-03 21:52:21,136 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 139 transitions, 1317 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-03 21:52:21,137 INFO  L231             Difference]: Finished difference. Result has 99 places, 109 transitions, 909 flow
[2024-06-03 21:52:21,137 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=909, PETRI_PLACES=99, PETRI_TRANSITIONS=109}
[2024-06-03 21:52:21,138 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places.
[2024-06-03 21:52:21,138 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 909 flow
[2024-06-03 21:52:21,138 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-06-03 21:52:21,138 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:21,138 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:21,138 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 21:52:21,138 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:21,138 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:21,138 INFO  L85        PathProgramCache]: Analyzing trace with hash -227986497, now seen corresponding path program 5 times
[2024-06-03 21:52:21,138 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:21,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167327862]
[2024-06-03 21:52:21,139 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:21,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:21,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:52:39,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:52:39,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:52:39,943 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167327862]
[2024-06-03 21:52:39,943 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167327862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:52:39,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:52:39,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:52:39,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195536543]
[2024-06-03 21:52:39,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:52:39,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:52:39,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:52:39,944 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:52:39,944 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:52:40,169 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:52:40,169 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 909 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-06-03 21:52:40,170 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:52:40,170 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:52:40,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:52:41,963 INFO  L124   PetriNetUnfolderBase]: 1973/3089 cut-off events.
[2024-06-03 21:52:41,964 INFO  L125   PetriNetUnfolderBase]: For 67149/67151 co-relation queries the response was YES.
[2024-06-03 21:52:41,970 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17200 conditions, 3089 events. 1973/3089 cut-off events. For 67149/67151 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15878 event pairs, 721 based on Foata normal form. 2/3086 useless extension candidates. Maximal degree in co-relation 17158. Up to 2739 conditions per place. 
[2024-06-03 21:52:41,979 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 88 selfloop transitions, 55 changer transitions 0/149 dead transitions.
[2024-06-03 21:52:41,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 149 transitions, 1414 flow
[2024-06-03 21:52:41,979 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:52:41,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:52:41,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 219 transitions.
[2024-06-03 21:52:41,980 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44242424242424244
[2024-06-03 21:52:41,980 INFO  L175             Difference]: Start difference. First operand has 99 places, 109 transitions, 909 flow. Second operand 11 states and 219 transitions.
[2024-06-03 21:52:41,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 149 transitions, 1414 flow
[2024-06-03 21:52:42,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 149 transitions, 1342 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-03 21:52:42,011 INFO  L231             Difference]: Finished difference. Result has 106 places, 112 transitions, 1000 flow
[2024-06-03 21:52:42,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1000, PETRI_PLACES=106, PETRI_TRANSITIONS=112}
[2024-06-03 21:52:42,012 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places.
[2024-06-03 21:52:42,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 1000 flow
[2024-06-03 21:52:42,012 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-06-03 21:52:42,012 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:52:42,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:52:42,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 21:52:42,013 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:52:42,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:52:42,013 INFO  L85        PathProgramCache]: Analyzing trace with hash -1498223320, now seen corresponding path program 3 times
[2024-06-03 21:52:42,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:52:42,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841816335]
[2024-06-03 21:52:42,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:52:42,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:52:42,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:00,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:00,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:00,805 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841816335]
[2024-06-03 21:53:00,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841816335] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:00,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:00,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:53:00,805 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591043689]
[2024-06-03 21:53:00,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:00,805 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:53:00,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:00,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:53:00,807 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:53:01,038 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:53:01,038 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 1000 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-06-03 21:53:01,038 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:01,038 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:53:01,038 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:02,714 INFO  L124   PetriNetUnfolderBase]: 1963/3078 cut-off events.
[2024-06-03 21:53:02,714 INFO  L125   PetriNetUnfolderBase]: For 71982/71987 co-relation queries the response was YES.
[2024-06-03 21:53:02,720 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17326 conditions, 3078 events. 1963/3078 cut-off events. For 71982/71987 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15839 event pairs, 671 based on Foata normal form. 8/3083 useless extension candidates. Maximal degree in co-relation 17283. Up to 2722 conditions per place. 
[2024-06-03 21:53:02,729 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 92 selfloop transitions, 41 changer transitions 0/139 dead transitions.
[2024-06-03 21:53:02,729 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 139 transitions, 1418 flow
[2024-06-03 21:53:02,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:53:02,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:53:02,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-03 21:53:02,730 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4583333333333333
[2024-06-03 21:53:02,730 INFO  L175             Difference]: Start difference. First operand has 106 places, 112 transitions, 1000 flow. Second operand 8 states and 165 transitions.
[2024-06-03 21:53:02,730 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 139 transitions, 1418 flow
[2024-06-03 21:53:02,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 139 transitions, 1252 flow, removed 26 selfloop flow, removed 9 redundant places.
[2024-06-03 21:53:02,768 INFO  L231             Difference]: Finished difference. Result has 105 places, 112 transitions, 924 flow
[2024-06-03 21:53:02,768 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=924, PETRI_PLACES=105, PETRI_TRANSITIONS=112}
[2024-06-03 21:53:02,768 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 59 predicate places.
[2024-06-03 21:53:02,768 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 112 transitions, 924 flow
[2024-06-03 21:53:02,768 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-06-03 21:53:02,769 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:02,769 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:53:02,769 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 21:53:02,769 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:53:02,769 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:02,769 INFO  L85        PathProgramCache]: Analyzing trace with hash -1505842097, now seen corresponding path program 6 times
[2024-06-03 21:53:02,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:02,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671422723]
[2024-06-03 21:53:02,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:02,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:02,799 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:20,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:20,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:20,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671422723]
[2024-06-03 21:53:20,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671422723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:20,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:20,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:53:20,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083742375]
[2024-06-03 21:53:20,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:20,752 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:53:20,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:20,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:53:20,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:53:20,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:53:20,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 112 transitions, 924 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-06-03 21:53:20,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:20,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:53:20,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:22,595 INFO  L124   PetriNetUnfolderBase]: 1958/3068 cut-off events.
[2024-06-03 21:53:22,595 INFO  L125   PetriNetUnfolderBase]: For 76454/76456 co-relation queries the response was YES.
[2024-06-03 21:53:22,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17404 conditions, 3068 events. 1958/3068 cut-off events. For 76454/76456 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15761 event pairs, 719 based on Foata normal form. 2/3065 useless extension candidates. Maximal degree in co-relation 17360. Up to 2720 conditions per place. 
[2024-06-03 21:53:22,611 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 84 selfloop transitions, 53 changer transitions 0/143 dead transitions.
[2024-06-03 21:53:22,611 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 143 transitions, 1276 flow
[2024-06-03 21:53:22,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:53:22,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:53:22,612 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 202 transitions.
[2024-06-03 21:53:22,612 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4488888888888889
[2024-06-03 21:53:22,612 INFO  L175             Difference]: Start difference. First operand has 105 places, 112 transitions, 924 flow. Second operand 10 states and 202 transitions.
[2024-06-03 21:53:22,612 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 143 transitions, 1276 flow
[2024-06-03 21:53:22,656 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 143 transitions, 1168 flow, removed 19 selfloop flow, removed 6 redundant places.
[2024-06-03 21:53:22,657 INFO  L231             Difference]: Finished difference. Result has 109 places, 112 transitions, 930 flow
[2024-06-03 21:53:22,657 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=930, PETRI_PLACES=109, PETRI_TRANSITIONS=112}
[2024-06-03 21:53:22,657 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places.
[2024-06-03 21:53:22,658 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 112 transitions, 930 flow
[2024-06-03 21:53:22,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-06-03 21:53:22,658 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:22,658 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:53:22,658 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 21:53:22,658 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:53:22,658 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:22,658 INFO  L85        PathProgramCache]: Analyzing trace with hash -1505841880, now seen corresponding path program 4 times
[2024-06-03 21:53:22,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:22,659 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083995780]
[2024-06-03 21:53:22,659 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:22,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:22,688 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:40,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:40,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:40,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083995780]
[2024-06-03 21:53:40,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083995780] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:40,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:40,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:53:40,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442235756]
[2024-06-03 21:53:40,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:40,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:53:40,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:40,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:53:40,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:53:40,586 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:53:40,587 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 112 transitions, 930 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-06-03 21:53:40,587 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:53:40,587 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:53:40,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:53:42,278 INFO  L124   PetriNetUnfolderBase]: 1948/3057 cut-off events.
[2024-06-03 21:53:42,278 INFO  L125   PetriNetUnfolderBase]: For 81510/81515 co-relation queries the response was YES.
[2024-06-03 21:53:42,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17457 conditions, 3057 events. 1948/3057 cut-off events. For 81510/81515 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15736 event pairs, 669 based on Foata normal form. 8/3062 useless extension candidates. Maximal degree in co-relation 17412. Up to 2707 conditions per place. 
[2024-06-03 21:53:42,294 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 100 selfloop transitions, 40 changer transitions 0/146 dead transitions.
[2024-06-03 21:53:42,294 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 146 transitions, 1294 flow
[2024-06-03 21:53:42,295 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:53:42,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:53:42,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 201 transitions.
[2024-06-03 21:53:42,295 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44666666666666666
[2024-06-03 21:53:42,295 INFO  L175             Difference]: Start difference. First operand has 109 places, 112 transitions, 930 flow. Second operand 10 states and 201 transitions.
[2024-06-03 21:53:42,295 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 146 transitions, 1294 flow
[2024-06-03 21:53:42,347 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 146 transitions, 1138 flow, removed 9 selfloop flow, removed 10 redundant places.
[2024-06-03 21:53:42,348 INFO  L231             Difference]: Finished difference. Result has 109 places, 112 transitions, 862 flow
[2024-06-03 21:53:42,349 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=862, PETRI_PLACES=109, PETRI_TRANSITIONS=112}
[2024-06-03 21:53:42,349 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places.
[2024-06-03 21:53:42,349 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 112 transitions, 862 flow
[2024-06-03 21:53:42,350 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-06-03 21:53:42,350 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:53:42,350 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:53:42,350 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 21:53:42,350 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:53:42,350 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:53:42,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 226955195, now seen corresponding path program 1 times
[2024-06-03 21:53:42,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:53:42,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266349824]
[2024-06-03 21:53:42,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:53:42,351 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:53:42,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:53:59,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:53:59,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:53:59,908 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266349824]
[2024-06-03 21:53:59,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266349824] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:53:59,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:53:59,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:53:59,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615342728]
[2024-06-03 21:53:59,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:53:59,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:53:59,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:53:59,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:53:59,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:54:00,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-03 21:54:00,103 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 112 transitions, 862 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:00,103 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:00,103 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-03 21:54:00,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:01,396 INFO  L124   PetriNetUnfolderBase]: 1678/2796 cut-off events.
[2024-06-03 21:54:01,396 INFO  L125   PetriNetUnfolderBase]: For 84563/84563 co-relation queries the response was YES.
[2024-06-03 21:54:01,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16194 conditions, 2796 events. 1678/2796 cut-off events. For 84563/84563 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15555 event pairs, 666 based on Foata normal form. 1/2795 useless extension candidates. Maximal degree in co-relation 16148. Up to 2442 conditions per place. 
[2024-06-03 21:54:01,416 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 85 selfloop transitions, 11 changer transitions 0/124 dead transitions.
[2024-06-03 21:54:01,417 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 124 transitions, 1100 flow
[2024-06-03 21:54:01,417 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:54:01,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:54:01,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions.
[2024-06-03 21:54:01,418 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45925925925925926
[2024-06-03 21:54:01,418 INFO  L175             Difference]: Start difference. First operand has 109 places, 112 transitions, 862 flow. Second operand 6 states and 124 transitions.
[2024-06-03 21:54:01,418 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 124 transitions, 1100 flow
[2024-06-03 21:54:01,466 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 124 transitions, 974 flow, removed 0 selfloop flow, removed 11 redundant places.
[2024-06-03 21:54:01,467 INFO  L231             Difference]: Finished difference. Result has 104 places, 115 transitions, 794 flow
[2024-06-03 21:54:01,467 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=794, PETRI_PLACES=104, PETRI_TRANSITIONS=115}
[2024-06-03 21:54:01,468 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 58 predicate places.
[2024-06-03 21:54:01,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 115 transitions, 794 flow
[2024-06-03 21:54:01,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:54:01,468 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:01,468 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:01,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 21:54:01,469 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:01,469 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:01,469 INFO  L85        PathProgramCache]: Analyzing trace with hash -435183172, now seen corresponding path program 1 times
[2024-06-03 21:54:01,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:01,469 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504696961]
[2024-06-03 21:54:01,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:01,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:01,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:20,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:20,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:20,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504696961]
[2024-06-03 21:54:20,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504696961] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:20,729 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:20,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:54:20,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717539898]
[2024-06-03 21:54:20,729 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:20,729 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:54:20,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:20,729 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:54:20,729 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:54:21,029 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:54:21,029 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 115 transitions, 794 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-06-03 21:54:21,029 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:21,029 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:54:21,029 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:22,895 INFO  L124   PetriNetUnfolderBase]: 1952/3095 cut-off events.
[2024-06-03 21:54:22,895 INFO  L125   PetriNetUnfolderBase]: For 107519/107519 co-relation queries the response was YES.
[2024-06-03 21:54:22,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19078 conditions, 3095 events. 1952/3095 cut-off events. For 107519/107519 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16392 event pairs, 501 based on Foata normal form. 4/3097 useless extension candidates. Maximal degree in co-relation 19031. Up to 2710 conditions per place. 
[2024-06-03 21:54:22,914 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 118 selfloop transitions, 20 changer transitions 0/156 dead transitions.
[2024-06-03 21:54:22,914 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 1338 flow
[2024-06-03 21:54:22,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:54:22,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:54:22,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-03 21:54:22,917 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4740740740740741
[2024-06-03 21:54:22,917 INFO  L175             Difference]: Start difference. First operand has 104 places, 115 transitions, 794 flow. Second operand 9 states and 192 transitions.
[2024-06-03 21:54:22,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 1338 flow
[2024-06-03 21:54:22,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 156 transitions, 1302 flow, removed 9 selfloop flow, removed 4 redundant places.
[2024-06-03 21:54:22,980 INFO  L231             Difference]: Finished difference. Result has 109 places, 119 transitions, 885 flow
[2024-06-03 21:54:22,981 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=885, PETRI_PLACES=109, PETRI_TRANSITIONS=119}
[2024-06-03 21:54:22,981 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 63 predicate places.
[2024-06-03 21:54:22,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 109 places, 119 transitions, 885 flow
[2024-06-03 21:54:22,981 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-06-03 21:54:22,981 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:22,981 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:22,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 21:54:22,982 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:22,982 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:22,982 INFO  L85        PathProgramCache]: Analyzing trace with hash -487625784, now seen corresponding path program 2 times
[2024-06-03 21:54:22,982 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:22,982 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169629403]
[2024-06-03 21:54:22,982 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:22,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:23,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:54:39,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:54:39,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:54:39,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169629403]
[2024-06-03 21:54:39,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169629403] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:54:39,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:54:39,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:54:39,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010372421]
[2024-06-03 21:54:39,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:54:39,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:54:39,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:54:39,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:54:39,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:54:40,052 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:54:40,052 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 119 transitions, 885 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-06-03 21:54:40,052 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:54:40,052 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:54:40,052 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:54:41,840 INFO  L124   PetriNetUnfolderBase]: 1944/3083 cut-off events.
[2024-06-03 21:54:41,840 INFO  L125   PetriNetUnfolderBase]: For 114726/114726 co-relation queries the response was YES.
[2024-06-03 21:54:41,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19430 conditions, 3083 events. 1944/3083 cut-off events. For 114726/114726 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16343 event pairs, 659 based on Foata normal form. 4/3085 useless extension candidates. Maximal degree in co-relation 19382. Up to 2757 conditions per place. 
[2024-06-03 21:54:41,857 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 115 selfloop transitions, 16 changer transitions 0/149 dead transitions.
[2024-06-03 21:54:41,858 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 149 transitions, 1223 flow
[2024-06-03 21:54:41,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:54:41,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:54:41,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions.
[2024-06-03 21:54:41,860 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4722222222222222
[2024-06-03 21:54:41,860 INFO  L175             Difference]: Start difference. First operand has 109 places, 119 transitions, 885 flow. Second operand 8 states and 170 transitions.
[2024-06-03 21:54:41,860 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 149 transitions, 1223 flow
[2024-06-03 21:54:41,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 149 transitions, 1139 flow, removed 33 selfloop flow, removed 5 redundant places.
[2024-06-03 21:54:41,911 INFO  L231             Difference]: Finished difference. Result has 112 places, 119 transitions, 840 flow
[2024-06-03 21:54:41,911 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=840, PETRI_PLACES=112, PETRI_TRANSITIONS=119}
[2024-06-03 21:54:41,912 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 66 predicate places.
[2024-06-03 21:54:41,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 119 transitions, 840 flow
[2024-06-03 21:54:41,912 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-06-03 21:54:41,912 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:54:41,912 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:54:41,912 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 21:54:41,913 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:54:41,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:54:41,913 INFO  L85        PathProgramCache]: Analyzing trace with hash 1676877958, now seen corresponding path program 1 times
[2024-06-03 21:54:41,913 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:54:41,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989140812]
[2024-06-03 21:54:41,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:54:41,913 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:54:41,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:01,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:01,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:01,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989140812]
[2024-06-03 21:55:01,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989140812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:01,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:01,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:01,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927447573]
[2024-06-03 21:55:01,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:01,629 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:01,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:01,629 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:01,629 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:01,915 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:55:01,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 119 transitions, 840 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-06-03 21:55:01,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:01,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:55:01,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:03,823 INFO  L124   PetriNetUnfolderBase]: 2072/3224 cut-off events.
[2024-06-03 21:55:03,823 INFO  L125   PetriNetUnfolderBase]: For 124154/124154 co-relation queries the response was YES.
[2024-06-03 21:55:03,830 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20380 conditions, 3224 events. 2072/3224 cut-off events. For 124154/124154 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16698 event pairs, 683 based on Foata normal form. 4/3223 useless extension candidates. Maximal degree in co-relation 20330. Up to 2968 conditions per place. 
[2024-06-03 21:55:03,841 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 129 selfloop transitions, 20 changer transitions 0/156 dead transitions.
[2024-06-03 21:55:03,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 156 transitions, 1272 flow
[2024-06-03 21:55:03,843 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:55:03,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:55:03,843 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-03 21:55:03,843 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44938271604938274
[2024-06-03 21:55:03,844 INFO  L175             Difference]: Start difference. First operand has 112 places, 119 transitions, 840 flow. Second operand 9 states and 182 transitions.
[2024-06-03 21:55:03,844 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 156 transitions, 1272 flow
[2024-06-03 21:55:03,891 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 156 transitions, 1235 flow, removed 1 selfloop flow, removed 7 redundant places.
[2024-06-03 21:55:03,893 INFO  L231             Difference]: Finished difference. Result has 114 places, 122 transitions, 905 flow
[2024-06-03 21:55:03,893 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=905, PETRI_PLACES=114, PETRI_TRANSITIONS=122}
[2024-06-03 21:55:03,893 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 68 predicate places.
[2024-06-03 21:55:03,894 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 122 transitions, 905 flow
[2024-06-03 21:55:03,894 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-06-03 21:55:03,894 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:03,894 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:03,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 21:55:03,894 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:55:03,894 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:03,895 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792164168, now seen corresponding path program 3 times
[2024-06-03 21:55:03,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:03,895 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566044014]
[2024-06-03 21:55:03,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:03,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:03,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:22,834 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:22,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:22,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566044014]
[2024-06-03 21:55:22,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566044014] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:22,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:22,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:55:22,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888210598]
[2024-06-03 21:55:22,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:22,835 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:55:22,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:22,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:55:22,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:55:22,994 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:55:22,995 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 122 transitions, 905 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-06-03 21:55:22,995 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:22,995 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:55:22,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:24,845 INFO  L124   PetriNetUnfolderBase]: 1980/3143 cut-off events.
[2024-06-03 21:55:24,845 INFO  L125   PetriNetUnfolderBase]: For 132684/132687 co-relation queries the response was YES.
[2024-06-03 21:55:24,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20580 conditions, 3143 events. 1980/3143 cut-off events. For 132684/132687 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16734 event pairs, 642 based on Foata normal form. 6/3146 useless extension candidates. Maximal degree in co-relation 20529. Up to 2768 conditions per place. 
[2024-06-03 21:55:24,861 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 105 selfloop transitions, 28 changer transitions 0/151 dead transitions.
[2024-06-03 21:55:24,862 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 151 transitions, 1283 flow
[2024-06-03 21:55:24,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:55:24,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:55:24,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-06-03 21:55:24,865 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.475
[2024-06-03 21:55:24,865 INFO  L175             Difference]: Start difference. First operand has 114 places, 122 transitions, 905 flow. Second operand 8 states and 171 transitions.
[2024-06-03 21:55:24,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 151 transitions, 1283 flow
[2024-06-03 21:55:24,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 151 transitions, 1205 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-03 21:55:24,920 INFO  L231             Difference]: Finished difference. Result has 115 places, 124 transitions, 938 flow
[2024-06-03 21:55:24,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=938, PETRI_PLACES=115, PETRI_TRANSITIONS=124}
[2024-06-03 21:55:24,921 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 69 predicate places.
[2024-06-03 21:55:24,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 124 transitions, 938 flow
[2024-06-03 21:55:24,921 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-06-03 21:55:24,921 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:24,921 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:24,921 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 21:55:24,921 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:55:24,922 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:24,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792169128, now seen corresponding path program 2 times
[2024-06-03 21:55:24,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:24,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195531388]
[2024-06-03 21:55:24,922 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:24,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:24,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:55:43,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:55:43,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:55:43,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195531388]
[2024-06-03 21:55:43,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195531388] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:55:43,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:55:43,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:55:43,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778180251]
[2024-06-03 21:55:43,874 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:55:43,874 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:55:43,874 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:55:43,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:55:43,875 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:55:44,028 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:55:44,028 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 124 transitions, 938 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-06-03 21:55:44,028 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:55:44,028 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:55:44,028 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:55:46,043 INFO  L124   PetriNetUnfolderBase]: 2143/3349 cut-off events.
[2024-06-03 21:55:46,044 INFO  L125   PetriNetUnfolderBase]: For 146047/146050 co-relation queries the response was YES.
[2024-06-03 21:55:46,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22199 conditions, 3349 events. 2143/3349 cut-off events. For 146047/146050 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17579 event pairs, 625 based on Foata normal form. 6/3352 useless extension candidates. Maximal degree in co-relation 22147. Up to 2736 conditions per place. 
[2024-06-03 21:55:46,062 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 112 selfloop transitions, 69 changer transitions 0/188 dead transitions.
[2024-06-03 21:55:46,062 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 188 transitions, 1834 flow
[2024-06-03 21:55:46,064 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-06-03 21:55:46,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-06-03 21:55:46,065 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 269 transitions.
[2024-06-03 21:55:46,065 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4598290598290598
[2024-06-03 21:55:46,065 INFO  L175             Difference]: Start difference. First operand has 115 places, 124 transitions, 938 flow. Second operand 13 states and 269 transitions.
[2024-06-03 21:55:46,065 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 188 transitions, 1834 flow
[2024-06-03 21:55:46,118 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 188 transitions, 1741 flow, removed 20 selfloop flow, removed 6 redundant places.
[2024-06-03 21:55:46,120 INFO  L231             Difference]: Finished difference. Result has 122 places, 133 transitions, 1165 flow
[2024-06-03 21:55:46,120 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1165, PETRI_PLACES=122, PETRI_TRANSITIONS=133}
[2024-06-03 21:55:46,120 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 76 predicate places.
[2024-06-03 21:55:46,120 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 133 transitions, 1165 flow
[2024-06-03 21:55:46,120 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-06-03 21:55:46,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:55:46,121 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:55:46,121 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 21:55:46,121 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:55:46,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:55:46,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -1319851822, now seen corresponding path program 3 times
[2024-06-03 21:55:46,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:55:46,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44214628]
[2024-06-03 21:55:46,121 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:55:46,121 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:55:46,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:04,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:04,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:04,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44214628]
[2024-06-03 21:56:04,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44214628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:04,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:04,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:04,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038313562]
[2024-06-03 21:56:04,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:04,821 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:04,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:04,821 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:04,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:05,019 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:56:05,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 133 transitions, 1165 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-06-03 21:56:05,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:05,019 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:56:05,019 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:07,072 INFO  L124   PetriNetUnfolderBase]: 2165/3386 cut-off events.
[2024-06-03 21:56:07,072 INFO  L125   PetriNetUnfolderBase]: For 157257/157260 co-relation queries the response was YES.
[2024-06-03 21:56:07,081 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23138 conditions, 3386 events. 2165/3386 cut-off events. For 157257/157260 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17775 event pairs, 618 based on Foata normal form. 6/3389 useless extension candidates. Maximal degree in co-relation 23085. Up to 2755 conditions per place. 
[2024-06-03 21:56:07,095 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 105 selfloop transitions, 71 changer transitions 0/183 dead transitions.
[2024-06-03 21:56:07,095 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 183 transitions, 1933 flow
[2024-06-03 21:56:07,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:56:07,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:56:07,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions.
[2024-06-03 21:56:07,098 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4707070707070707
[2024-06-03 21:56:07,098 INFO  L175             Difference]: Start difference. First operand has 122 places, 133 transitions, 1165 flow. Second operand 11 states and 233 transitions.
[2024-06-03 21:56:07,098 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 183 transitions, 1933 flow
[2024-06-03 21:56:07,163 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 183 transitions, 1793 flow, removed 43 selfloop flow, removed 8 redundant places.
[2024-06-03 21:56:07,165 INFO  L231             Difference]: Finished difference. Result has 125 places, 136 transitions, 1237 flow
[2024-06-03 21:56:07,165 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1237, PETRI_PLACES=125, PETRI_TRANSITIONS=136}
[2024-06-03 21:56:07,166 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 79 predicate places.
[2024-06-03 21:56:07,166 INFO  L495      AbstractCegarLoop]: Abstraction has has 125 places, 136 transitions, 1237 flow
[2024-06-03 21:56:07,166 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-06-03 21:56:07,166 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:07,166 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:07,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 21:56:07,166 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:07,167 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:07,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 1792348618, now seen corresponding path program 4 times
[2024-06-03 21:56:07,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:07,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962194936]
[2024-06-03 21:56:07,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:07,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:07,197 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:25,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:25,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:25,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962194936]
[2024-06-03 21:56:25,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962194936] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:25,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:25,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:56:25,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349644476]
[2024-06-03 21:56:25,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:25,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:56:25,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:25,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:56:25,342 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:56:25,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:56:25,554 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 136 transitions, 1237 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-06-03 21:56:25,554 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:25,554 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:56:25,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:27,473 INFO  L124   PetriNetUnfolderBase]: 2155/3372 cut-off events.
[2024-06-03 21:56:27,473 INFO  L125   PetriNetUnfolderBase]: For 162982/162985 co-relation queries the response was YES.
[2024-06-03 21:56:27,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23262 conditions, 3372 events. 2155/3372 cut-off events. For 162982/162985 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17644 event pairs, 618 based on Foata normal form. 6/3375 useless extension candidates. Maximal degree in co-relation 23207. Up to 2747 conditions per place. 
[2024-06-03 21:56:27,493 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 100 selfloop transitions, 73 changer transitions 0/180 dead transitions.
[2024-06-03 21:56:27,493 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 180 transitions, 1815 flow
[2024-06-03 21:56:27,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:56:27,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:56:27,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 229 transitions.
[2024-06-03 21:56:27,496 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4626262626262626
[2024-06-03 21:56:27,496 INFO  L175             Difference]: Start difference. First operand has 125 places, 136 transitions, 1237 flow. Second operand 11 states and 229 transitions.
[2024-06-03 21:56:27,496 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 180 transitions, 1815 flow
[2024-06-03 21:56:27,567 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 180 transitions, 1607 flow, removed 34 selfloop flow, removed 9 redundant places.
[2024-06-03 21:56:27,569 INFO  L231             Difference]: Finished difference. Result has 127 places, 136 transitions, 1183 flow
[2024-06-03 21:56:27,569 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1183, PETRI_PLACES=127, PETRI_TRANSITIONS=136}
[2024-06-03 21:56:27,570 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 81 predicate places.
[2024-06-03 21:56:27,570 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 136 transitions, 1183 flow
[2024-06-03 21:56:27,570 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-06-03 21:56:27,570 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:27,570 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:27,570 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 21:56:27,570 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:27,570 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:27,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -1567670198, now seen corresponding path program 1 times
[2024-06-03 21:56:27,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:27,570 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382080390]
[2024-06-03 21:56:27,570 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:27,571 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:27,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:56:43,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:56:43,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:56:43,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382080390]
[2024-06-03 21:56:43,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382080390] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:56:43,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:56:43,995 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:56:43,995 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359535734]
[2024-06-03 21:56:43,995 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:56:43,995 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:56:43,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:56:43,995 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:56:43,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:56:44,128 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-03 21:56:44,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 136 transitions, 1183 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:44,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:56:44,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-03 21:56:44,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:56:45,703 INFO  L124   PetriNetUnfolderBase]: 1896/3103 cut-off events.
[2024-06-03 21:56:45,703 INFO  L125   PetriNetUnfolderBase]: For 167667/167675 co-relation queries the response was YES.
[2024-06-03 21:56:45,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22058 conditions, 3103 events. 1896/3103 cut-off events. For 167667/167675 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17255 event pairs, 641 based on Foata normal form. 2/3095 useless extension candidates. Maximal degree in co-relation 22002. Up to 2706 conditions per place. 
[2024-06-03 21:56:45,722 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 112 selfloop transitions, 13 changer transitions 0/154 dead transitions.
[2024-06-03 21:56:45,723 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 154 transitions, 1503 flow
[2024-06-03 21:56:45,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:56:45,723 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:56:45,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions.
[2024-06-03 21:56:45,724 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-03 21:56:45,724 INFO  L175             Difference]: Start difference. First operand has 127 places, 136 transitions, 1183 flow. Second operand 6 states and 130 transitions.
[2024-06-03 21:56:45,724 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 154 transitions, 1503 flow
[2024-06-03 21:56:45,796 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 154 transitions, 1349 flow, removed 2 selfloop flow, removed 10 redundant places.
[2024-06-03 21:56:45,798 INFO  L231             Difference]: Finished difference. Result has 123 places, 139 transitions, 1100 flow
[2024-06-03 21:56:45,798 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1029, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1100, PETRI_PLACES=123, PETRI_TRANSITIONS=139}
[2024-06-03 21:56:45,798 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 77 predicate places.
[2024-06-03 21:56:45,798 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 139 transitions, 1100 flow
[2024-06-03 21:56:45,799 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:56:45,799 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:56:45,799 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:56:45,799 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 21:56:45,799 INFO  L420      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:56:45,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:56:45,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 216863048, now seen corresponding path program 4 times
[2024-06-03 21:56:45,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:56:45,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381382436]
[2024-06-03 21:56:45,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:56:45,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:56:45,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:03,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:03,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:03,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381382436]
[2024-06-03 21:57:03,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381382436] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:03,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:03,412 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:57:03,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862024683]
[2024-06-03 21:57:03,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:03,413 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:57:03,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:03,413 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:57:03,413 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:57:03,579 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 21:57:03,579 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 139 transitions, 1100 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-06-03 21:57:03,579 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:03,579 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 21:57:03,579 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:05,398 INFO  L124   PetriNetUnfolderBase]: 2073/3291 cut-off events.
[2024-06-03 21:57:05,399 INFO  L125   PetriNetUnfolderBase]: For 175997/175999 co-relation queries the response was YES.
[2024-06-03 21:57:05,408 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23112 conditions, 3291 events. 2073/3291 cut-off events. For 175997/175999 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17621 event pairs, 664 based on Foata normal form. 4/3290 useless extension candidates. Maximal degree in co-relation 23055. Up to 2885 conditions per place. 
[2024-06-03 21:57:05,418 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 119 selfloop transitions, 28 changer transitions 0/165 dead transitions.
[2024-06-03 21:57:05,418 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 165 transitions, 1504 flow
[2024-06-03 21:57:05,418 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:57:05,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:57:05,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions.
[2024-06-03 21:57:05,419 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-03 21:57:05,419 INFO  L175             Difference]: Start difference. First operand has 123 places, 139 transitions, 1100 flow. Second operand 8 states and 168 transitions.
[2024-06-03 21:57:05,419 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 165 transitions, 1504 flow
[2024-06-03 21:57:05,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 165 transitions, 1457 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-03 21:57:05,479 INFO  L231             Difference]: Finished difference. Result has 127 places, 141 transitions, 1170 flow
[2024-06-03 21:57:05,480 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1170, PETRI_PLACES=127, PETRI_TRANSITIONS=141}
[2024-06-03 21:57:05,480 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 81 predicate places.
[2024-06-03 21:57:05,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 141 transitions, 1170 flow
[2024-06-03 21:57:05,480 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-06-03 21:57:05,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:05,480 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:05,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 21:57:05,480 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:57:05,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:05,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 563542882, now seen corresponding path program 5 times
[2024-06-03 21:57:05,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:05,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372327112]
[2024-06-03 21:57:05,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:05,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:05,510 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:24,457 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:24,457 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:24,457 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372327112]
[2024-06-03 21:57:24,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372327112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:24,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:24,458 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:24,458 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530008190]
[2024-06-03 21:57:24,458 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:24,458 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:24,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:24,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:24,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:24,678 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:57:24,678 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 141 transitions, 1170 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-06-03 21:57:24,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:24,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:57:24,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:26,683 INFO  L124   PetriNetUnfolderBase]: 2237/3498 cut-off events.
[2024-06-03 21:57:26,684 INFO  L125   PetriNetUnfolderBase]: For 190976/190978 co-relation queries the response was YES.
[2024-06-03 21:57:26,693 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24829 conditions, 3498 events. 2237/3498 cut-off events. For 190976/190978 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18400 event pairs, 639 based on Foata normal form. 4/3497 useless extension candidates. Maximal degree in co-relation 24771. Up to 2821 conditions per place. 
[2024-06-03 21:57:26,706 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 105 selfloop transitions, 78 changer transitions 0/190 dead transitions.
[2024-06-03 21:57:26,706 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 190 transitions, 2016 flow
[2024-06-03 21:57:26,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:57:26,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:57:26,708 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions.
[2024-06-03 21:57:26,709 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-03 21:57:26,709 INFO  L175             Difference]: Start difference. First operand has 127 places, 141 transitions, 1170 flow. Second operand 11 states and 231 transitions.
[2024-06-03 21:57:26,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 190 transitions, 2016 flow
[2024-06-03 21:57:26,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 190 transitions, 1917 flow, removed 23 selfloop flow, removed 6 redundant places.
[2024-06-03 21:57:26,794 INFO  L231             Difference]: Finished difference. Result has 132 places, 147 transitions, 1343 flow
[2024-06-03 21:57:26,794 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1343, PETRI_PLACES=132, PETRI_TRANSITIONS=147}
[2024-06-03 21:57:26,794 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 86 predicate places.
[2024-06-03 21:57:26,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 147 transitions, 1343 flow
[2024-06-03 21:57:26,794 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-06-03 21:57:26,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:26,795 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:26,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 21:57:26,795 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:57:26,795 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:26,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 791444032, now seen corresponding path program 6 times
[2024-06-03 21:57:26,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:26,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691617740]
[2024-06-03 21:57:26,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:26,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:26,826 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:57:46,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:57:46,204 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:57:46,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691617740]
[2024-06-03 21:57:46,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691617740] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:57:46,204 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:57:46,204 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:57:46,204 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214298769]
[2024-06-03 21:57:46,204 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:57:46,204 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:57:46,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:57:46,205 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:57:46,205 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:57:46,448 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:57:46,448 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 147 transitions, 1343 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-06-03 21:57:46,448 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:57:46,448 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:57:46,448 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:57:48,299 INFO  L124   PetriNetUnfolderBase]: 2291/3591 cut-off events.
[2024-06-03 21:57:48,299 INFO  L125   PetriNetUnfolderBase]: For 204842/204844 co-relation queries the response was YES.
[2024-06-03 21:57:48,309 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25969 conditions, 3591 events. 2291/3591 cut-off events. For 204842/204844 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19006 event pairs, 639 based on Foata normal form. 4/3590 useless extension candidates. Maximal degree in co-relation 25910. Up to 2867 conditions per place. 
[2024-06-03 21:57:48,321 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 101 selfloop transitions, 82 changer transitions 0/190 dead transitions.
[2024-06-03 21:57:48,322 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 190 transitions, 2331 flow
[2024-06-03 21:57:48,324 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:57:48,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:57:48,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-03 21:57:48,324 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48148148148148145
[2024-06-03 21:57:48,325 INFO  L175             Difference]: Start difference. First operand has 132 places, 147 transitions, 1343 flow. Second operand 9 states and 195 transitions.
[2024-06-03 21:57:48,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 190 transitions, 2331 flow
[2024-06-03 21:57:48,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 190 transitions, 2113 flow, removed 24 selfloop flow, removed 8 redundant places.
[2024-06-03 21:57:48,416 INFO  L231             Difference]: Finished difference. Result has 133 places, 153 transitions, 1417 flow
[2024-06-03 21:57:48,416 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1417, PETRI_PLACES=133, PETRI_TRANSITIONS=153}
[2024-06-03 21:57:48,417 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 87 predicate places.
[2024-06-03 21:57:48,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 153 transitions, 1417 flow
[2024-06-03 21:57:48,417 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-06-03 21:57:48,417 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:57:48,417 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:57:48,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 21:57:48,417 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:57:48,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:57:48,418 INFO  L85        PathProgramCache]: Analyzing trace with hash 791437522, now seen corresponding path program 7 times
[2024-06-03 21:57:48,418 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:57:48,418 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832436228]
[2024-06-03 21:57:48,418 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:57:48,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:57:48,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:06,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-06-03 21:58:06,788 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:06,788 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832436228]
[2024-06-03 21:58:06,788 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832436228] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:06,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:06,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:06,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713425899]
[2024-06-03 21:58:06,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:06,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:06,789 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:06,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:06,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:07,126 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:58:07,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 153 transitions, 1417 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-06-03 21:58:07,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:07,128 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:58:07,128 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:08,979 INFO  L124   PetriNetUnfolderBase]: 2281/3577 cut-off events.
[2024-06-03 21:58:08,979 INFO  L125   PetriNetUnfolderBase]: For 211821/211823 co-relation queries the response was YES.
[2024-06-03 21:58:08,988 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25900 conditions, 3577 events. 2281/3577 cut-off events. For 211821/211823 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 18951 event pairs, 637 based on Foata normal form. 4/3576 useless extension candidates. Maximal degree in co-relation 25840. Up to 2859 conditions per place. 
[2024-06-03 21:58:09,000 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 98 selfloop transitions, 83 changer transitions 0/188 dead transitions.
[2024-06-03 21:58:09,001 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 188 transitions, 2147 flow
[2024-06-03 21:58:09,001 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:58:09,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:58:09,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-03 21:58:09,001 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4740740740740741
[2024-06-03 21:58:09,001 INFO  L175             Difference]: Start difference. First operand has 133 places, 153 transitions, 1417 flow. Second operand 9 states and 192 transitions.
[2024-06-03 21:58:09,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 188 transitions, 2147 flow
[2024-06-03 21:58:09,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 188 transitions, 1909 flow, removed 40 selfloop flow, removed 6 redundant places.
[2024-06-03 21:58:09,096 INFO  L231             Difference]: Finished difference. Result has 136 places, 153 transitions, 1353 flow
[2024-06-03 21:58:09,096 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1353, PETRI_PLACES=136, PETRI_TRANSITIONS=153}
[2024-06-03 21:58:09,096 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 90 predicate places.
[2024-06-03 21:58:09,096 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 153 transitions, 1353 flow
[2024-06-03 21:58:09,096 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-06-03 21:58:09,096 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:09,096 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:09,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 21:58:09,097 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:09,097 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:09,097 INFO  L85        PathProgramCache]: Analyzing trace with hash 563536372, now seen corresponding path program 8 times
[2024-06-03 21:58:09,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:09,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525376292]
[2024-06-03 21:58:09,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:09,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:09,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:28,400 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:58:28,400 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:28,400 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525376292]
[2024-06-03 21:58:28,400 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525376292] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:28,400 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:28,400 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:28,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931299997]
[2024-06-03 21:58:28,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:28,401 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:28,401 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:28,401 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:28,401 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:28,668 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:58:28,668 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 153 transitions, 1353 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-06-03 21:58:28,668 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:28,668 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:58:28,668 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:30,688 INFO  L124   PetriNetUnfolderBase]: 2303/3614 cut-off events.
[2024-06-03 21:58:30,688 INFO  L125   PetriNetUnfolderBase]: For 221624/221626 co-relation queries the response was YES.
[2024-06-03 21:58:30,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26218 conditions, 3614 events. 2303/3614 cut-off events. For 221624/221626 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19191 event pairs, 637 based on Foata normal form. 4/3613 useless extension candidates. Maximal degree in co-relation 26157. Up to 2878 conditions per place. 
[2024-06-03 21:58:30,712 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 107 selfloop transitions, 86 changer transitions 0/200 dead transitions.
[2024-06-03 21:58:30,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 200 transitions, 2191 flow
[2024-06-03 21:58:30,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:58:30,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:58:30,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 233 transitions.
[2024-06-03 21:58:30,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4707070707070707
[2024-06-03 21:58:30,715 INFO  L175             Difference]: Start difference. First operand has 136 places, 153 transitions, 1353 flow. Second operand 11 states and 233 transitions.
[2024-06-03 21:58:30,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 200 transitions, 2191 flow
[2024-06-03 21:58:30,805 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 200 transitions, 2017 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-03 21:58:30,808 INFO  L231             Difference]: Finished difference. Result has 140 places, 156 transitions, 1413 flow
[2024-06-03 21:58:30,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1413, PETRI_PLACES=140, PETRI_TRANSITIONS=156}
[2024-06-03 21:58:30,808 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 94 predicate places.
[2024-06-03 21:58:30,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 156 transitions, 1413 flow
[2024-06-03 21:58:30,808 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-06-03 21:58:30,808 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:30,808 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:30,808 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 21:58:30,809 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:30,809 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:30,809 INFO  L85        PathProgramCache]: Analyzing trace with hash 563363392, now seen corresponding path program 9 times
[2024-06-03 21:58:30,809 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:30,809 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624007512]
[2024-06-03 21:58:30,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:30,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:30,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:58:50,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:58:50,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:58:50,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624007512]
[2024-06-03 21:58:50,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624007512] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:58:50,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:58:50,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:58:50,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187683780]
[2024-06-03 21:58:50,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:58:50,192 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:58:50,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:58:50,193 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:58:50,193 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:58:50,377 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:58:50,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 156 transitions, 1413 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-06-03 21:58:50,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:58:50,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:58:50,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:58:52,510 INFO  L124   PetriNetUnfolderBase]: 2293/3600 cut-off events.
[2024-06-03 21:58:52,510 INFO  L125   PetriNetUnfolderBase]: For 229655/229657 co-relation queries the response was YES.
[2024-06-03 21:58:52,521 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26270 conditions, 3600 events. 2293/3600 cut-off events. For 229655/229657 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 19127 event pairs, 630 based on Foata normal form. 4/3599 useless extension candidates. Maximal degree in co-relation 26208. Up to 2870 conditions per place. 
[2024-06-03 21:58:52,535 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 104 selfloop transitions, 90 changer transitions 0/201 dead transitions.
[2024-06-03 21:58:52,535 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 201 transitions, 2061 flow
[2024-06-03 21:58:52,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2024-06-03 21:58:52,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-06-03 21:58:52,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 244 transitions.
[2024-06-03 21:58:52,538 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45185185185185184
[2024-06-03 21:58:52,539 INFO  L175             Difference]: Start difference. First operand has 140 places, 156 transitions, 1413 flow. Second operand 12 states and 244 transitions.
[2024-06-03 21:58:52,539 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 201 transitions, 2061 flow
[2024-06-03 21:58:52,635 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 201 transitions, 1837 flow, removed 34 selfloop flow, removed 8 redundant places.
[2024-06-03 21:58:52,637 INFO  L231             Difference]: Finished difference. Result has 144 places, 156 transitions, 1377 flow
[2024-06-03 21:58:52,637 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1377, PETRI_PLACES=144, PETRI_TRANSITIONS=156}
[2024-06-03 21:58:52,637 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 98 predicate places.
[2024-06-03 21:58:52,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 144 places, 156 transitions, 1377 flow
[2024-06-03 21:58:52,638 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-06-03 21:58:52,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:58:52,638 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:58:52,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 21:58:52,638 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:58:52,638 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:58:52,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 1529020548, now seen corresponding path program 10 times
[2024-06-03 21:58:52,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:58:52,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091236071]
[2024-06-03 21:58:52,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:58:52,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:58:52,667 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:12,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:59:12,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:12,074 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091236071]
[2024-06-03 21:59:12,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091236071] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:12,075 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:12,075 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:59:12,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816009703]
[2024-06-03 21:59:12,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:12,075 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:59:12,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:12,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:59:12,075 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:59:12,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 45
[2024-06-03 21:59:12,317 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 156 transitions, 1377 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-06-03 21:59:12,317 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:12,317 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 45
[2024-06-03 21:59:12,317 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:14,169 INFO  L124   PetriNetUnfolderBase]: 2283/3586 cut-off events.
[2024-06-03 21:59:14,169 INFO  L125   PetriNetUnfolderBase]: For 236636/236638 co-relation queries the response was YES.
[2024-06-03 21:59:14,180 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26181 conditions, 3586 events. 2283/3586 cut-off events. For 236636/236638 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 19082 event pairs, 640 based on Foata normal form. 4/3585 useless extension candidates. Maximal degree in co-relation 26118. Up to 2862 conditions per place. 
[2024-06-03 21:59:14,192 INFO  L140   encePairwiseOnDemand]: 33/45 looper letters, 87 selfloop transitions, 92 changer transitions 0/186 dead transitions.
[2024-06-03 21:59:14,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 186 transitions, 1809 flow
[2024-06-03 21:59:14,196 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:59:14,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:59:14,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions.
[2024-06-03 21:59:14,197 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45925925925925926
[2024-06-03 21:59:14,197 INFO  L175             Difference]: Start difference. First operand has 144 places, 156 transitions, 1377 flow. Second operand 9 states and 186 transitions.
[2024-06-03 21:59:14,197 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 186 transitions, 1809 flow
[2024-06-03 21:59:14,316 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 186 transitions, 1573 flow, removed 18 selfloop flow, removed 12 redundant places.
[2024-06-03 21:59:14,318 INFO  L231             Difference]: Finished difference. Result has 141 places, 156 transitions, 1333 flow
[2024-06-03 21:59:14,318 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1333, PETRI_PLACES=141, PETRI_TRANSITIONS=156}
[2024-06-03 21:59:14,319 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 95 predicate places.
[2024-06-03 21:59:14,319 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 156 transitions, 1333 flow
[2024-06-03 21:59:14,319 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-06-03 21:59:14,319 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:14,319 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:14,319 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 21:59:14,319 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:14,319 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:14,319 INFO  L85        PathProgramCache]: Analyzing trace with hash -1567282388, now seen corresponding path program 2 times
[2024-06-03 21:59:14,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:14,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828224391]
[2024-06-03 21:59:14,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:14,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:14,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:31,781 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:59:31,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:31,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828224391]
[2024-06-03 21:59:31,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828224391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:31,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:31,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:59:31,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736740231]
[2024-06-03 21:59:31,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:31,782 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:59:31,782 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:31,782 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:59:31,782 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:59:31,913 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-03 21:59:31,913 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 156 transitions, 1333 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:31,913 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:31,913 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-03 21:59:31,913 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:33,420 INFO  L124   PetriNetUnfolderBase]: 1948/3204 cut-off events.
[2024-06-03 21:59:33,421 INFO  L125   PetriNetUnfolderBase]: For 241130/241130 co-relation queries the response was YES.
[2024-06-03 21:59:33,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24552 conditions, 3204 events. 1948/3204 cut-off events. For 241130/241130 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18101 event pairs, 644 based on Foata normal form. 1/3178 useless extension candidates. Maximal degree in co-relation 24488. Up to 2783 conditions per place. 
[2024-06-03 21:59:33,442 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 121 selfloop transitions, 18 changer transitions 0/168 dead transitions.
[2024-06-03 21:59:33,442 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 168 transitions, 1671 flow
[2024-06-03 21:59:33,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:59:33,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:59:33,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions.
[2024-06-03 21:59:33,443 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4666666666666667
[2024-06-03 21:59:33,443 INFO  L175             Difference]: Start difference. First operand has 141 places, 156 transitions, 1333 flow. Second operand 6 states and 126 transitions.
[2024-06-03 21:59:33,443 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 168 transitions, 1671 flow
[2024-06-03 21:59:33,545 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 168 transitions, 1463 flow, removed 2 selfloop flow, removed 9 redundant places.
[2024-06-03 21:59:33,547 INFO  L231             Difference]: Finished difference. Result has 138 places, 159 transitions, 1211 flow
[2024-06-03 21:59:33,547 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1211, PETRI_PLACES=138, PETRI_TRANSITIONS=159}
[2024-06-03 21:59:33,547 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 92 predicate places.
[2024-06-03 21:59:33,547 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 159 transitions, 1211 flow
[2024-06-03 21:59:33,547 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:33,547 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:33,547 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:33,547 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 21:59:33,547 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:33,548 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:33,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -1561950326, now seen corresponding path program 1 times
[2024-06-03 21:59:33,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:33,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77186337]
[2024-06-03 21:59:33,548 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:33,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:33,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:59:50,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-06-03 21:59:50,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:59:50,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77186337]
[2024-06-03 21:59:50,558 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77186337] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:59:50,558 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:59:50,558 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:59:50,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855278866]
[2024-06-03 21:59:50,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:59:50,559 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:59:50,559 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:59:50,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:59:50,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:59:50,697 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 45
[2024-06-03 21:59:50,697 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 159 transitions, 1211 flow. Second operand  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:50,697 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:59:50,697 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 45
[2024-06-03 21:59:50,697 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:59:52,210 INFO  L124   PetriNetUnfolderBase]: 1931/3212 cut-off events.
[2024-06-03 21:59:52,210 INFO  L125   PetriNetUnfolderBase]: For 218008/218008 co-relation queries the response was YES.
[2024-06-03 21:59:52,221 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23112 conditions, 3212 events. 1931/3212 cut-off events. For 218008/218008 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 18088 event pairs, 564 based on Foata normal form. 1/3211 useless extension candidates. Maximal degree in co-relation 23047. Up to 2774 conditions per place. 
[2024-06-03 21:59:52,233 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 144 selfloop transitions, 11 changer transitions 0/174 dead transitions.
[2024-06-03 21:59:52,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 174 transitions, 1589 flow
[2024-06-03 21:59:52,234 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:59:52,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:59:52,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions.
[2024-06-03 21:59:52,234 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4703703703703704
[2024-06-03 21:59:52,234 INFO  L175             Difference]: Start difference. First operand has 138 places, 159 transitions, 1211 flow. Second operand 6 states and 127 transitions.
[2024-06-03 21:59:52,234 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 174 transitions, 1589 flow
[2024-06-03 21:59:52,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 174 transitions, 1525 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 21:59:52,352 INFO  L231             Difference]: Finished difference. Result has 140 places, 162 transitions, 1219 flow
[2024-06-03 21:59:52,352 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1219, PETRI_PLACES=140, PETRI_TRANSITIONS=162}
[2024-06-03 21:59:52,353 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 94 predicate places.
[2024-06-03 21:59:52,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 140 places, 162 transitions, 1219 flow
[2024-06-03 21:59:52,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 15.0) internal successors, (105), 7 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:59:52,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:59:52,353 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:59:52,353 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 21:59:52,353 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:59:52,353 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:59:52,354 INFO  L85        PathProgramCache]: Analyzing trace with hash 800026072, now seen corresponding path program 1 times
[2024-06-03 21:59:52,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:59:52,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785763918]
[2024-06-03 21:59:52,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:59:52,354 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:59:52,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 22:00:10,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 22:00:10,844 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 22:00:10,844 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785763918]
[2024-06-03 22:00:10,844 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785763918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 22:00:10,844 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 22:00:10,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 22:00:10,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298951798]
[2024-06-03 22:00:10,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 22:00:10,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 22:00:10,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 22:00:10,845 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 22:00:10,845 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-06-03 22:00:11,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 45
[2024-06-03 22:00:11,085 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 162 transitions, 1219 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-06-03 22:00:11,085 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 22:00:11,085 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 45
[2024-06-03 22:00:11,085 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 22:00:12,834 INFO  L124   PetriNetUnfolderBase]: 2031/3306 cut-off events.
[2024-06-03 22:00:12,834 INFO  L125   PetriNetUnfolderBase]: For 226820/226820 co-relation queries the response was YES.
[2024-06-03 22:00:12,845 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23875 conditions, 3306 events. 2031/3306 cut-off events. For 226820/226820 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18129 event pairs, 548 based on Foata normal form. 4/3308 useless extension candidates. Maximal degree in co-relation 23809. Up to 2916 conditions per place. 
[2024-06-03 22:00:12,857 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 168 selfloop transitions, 19 changer transitions 0/195 dead transitions.
[2024-06-03 22:00:12,857 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 195 transitions, 1731 flow
[2024-06-03 22:00:12,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 22:00:12,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 22:00:12,860 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 183 transitions.
[2024-06-03 22:00:12,860 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45185185185185184
[2024-06-03 22:00:12,860 INFO  L175             Difference]: Start difference. First operand has 140 places, 162 transitions, 1219 flow. Second operand 9 states and 183 transitions.
[2024-06-03 22:00:12,860 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 195 transitions, 1731 flow
[2024-06-03 22:00:12,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 195 transitions, 1681 flow, removed 16 selfloop flow, removed 4 redundant places.
[2024-06-03 22:00:12,989 INFO  L231             Difference]: Finished difference. Result has 146 places, 167 transitions, 1292 flow
[2024-06-03 22:00:12,989 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1292, PETRI_PLACES=146, PETRI_TRANSITIONS=167}
[2024-06-03 22:00:12,989 INFO  L281   CegarLoopForPetriNet]: 46 programPoint places, 100 predicate places.
[2024-06-03 22:00:12,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 146 places, 167 transitions, 1292 flow
[2024-06-03 22:00:12,990 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-06-03 22:00:12,990 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 22:00:12,990 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 22:00:12,990 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 22:00:12,990 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 22:00:12,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 22:00:12,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554331766, now seen corresponding path program 2 times
[2024-06-03 22:00:12,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 22:00:12,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743694242]
[2024-06-03 22:00:12,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 22:00:12,991 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 22:00:13,042 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15