./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix001.oepc.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/mix001.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix001.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m
[2024-06-03 21:04:21,610 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-03 21:04:21,680 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-03 21:04:21,684 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-03 21:04:21,685 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-03 21:04:21,707 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-03 21:04:21,713 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-03 21:04:21,714 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-03 21:04:21,714 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-03 21:04:21,719 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-03 21:04:21,719 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-03 21:04:21,719 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-03 21:04:21,720 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-03 21:04:21,721 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-03 21:04:21,721 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-03 21:04:21,722 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-03 21:04:21,722 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-03 21:04:21,722 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-03 21:04:21,722 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-03 21:04:21,722 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-03 21:04:21,723 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-03 21:04:21,723 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-03 21:04:21,723 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-03 21:04:21,723 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-03 21:04:21,724 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-03 21:04:21,724 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-03 21:04:21,724 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-03 21:04:21,724 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-03 21:04:21,725 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-03 21:04:21,725 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-03 21:04:21,726 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-03 21:04:21,726 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-03 21:04:21,726 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:04:21,726 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-03 21:04:21,726 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-03 21:04:21,727 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-03 21:04:21,727 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-03 21:04:21,727 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-03 21:04:21,727 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-03 21:04:21,727 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-03 21:04:21,727 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-03 21:04:21,728 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-03 21:04:21,728 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-03 21:04:21,728 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:04:22,006 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-03 21:04:22,030 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-03 21:04:22,032 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-03 21:04:22,033 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-03 21:04:22,033 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-03 21:04:22,034 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.oepc.i
[2024-06-03 21:04:23,191 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-03 21:04:23,438 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-03 21:04:23,442 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.oepc.i
[2024-06-03 21:04:23,465 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e428f48cb/d93accf561b5402bb27862b726dec04f/FLAG031c3382e
[2024-06-03 21:04:23,479 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e428f48cb/d93accf561b5402bb27862b726dec04f
[2024-06-03 21:04:23,481 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-03 21:04:23,482 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-03 21:04:23,483 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/mix001.oepc.yml/witness.yml
[2024-06-03 21:04:23,703 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-03 21:04:23,704 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-03 21:04:23,705 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-03 21:04:23,705 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-03 21:04:23,709 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-03 21:04:23,710 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:04:23" (1/2) ...
[2024-06-03 21:04:23,711 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bde4139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:04:23, skipping insertion in model container
[2024-06-03 21:04:23,711 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:04:23" (1/2) ...
[2024-06-03 21:04:23,712 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@532708c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:04:23, skipping insertion in model container
[2024-06-03 21:04:23,712 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:04:23" (2/2) ...
[2024-06-03 21:04:23,713 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bde4139 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:23, skipping insertion in model container
[2024-06-03 21:04:23,713 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:04:23" (2/2) ...
[2024-06-03 21:04:23,713 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-03 21:04:23,789 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-03 21:04:23,791 INFO  L97    edCorrectnessWitness]: Location invariant before [L869-L869] ((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 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_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 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)) && (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 || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-06-03 21:04:23,791 INFO  L97    edCorrectnessWitness]: Location invariant before [L867-L867] ((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 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_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 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)) && (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 || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-06-03 21:04:23,792 INFO  L97    edCorrectnessWitness]: Location invariant before [L870-L870] ((((((((((((((((((((((! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 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 )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 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_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 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)) && (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 || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)
[2024-06-03 21:04:23,792 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-03 21:04:23,792 INFO  L106   edCorrectnessWitness]: ghost_update [L865-L865] multithreaded = 1;
[2024-06-03 21:04:23,832 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-03 21:04:24,109 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:04:24,121 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:04:24,472 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-03 21:04:24,499 INFO  L206         MainTranslator]: Completed translation
[2024-06-03 21:04:24,499 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24 WrapperNode
[2024-06-03 21:04:24,500 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-03 21:04:24,500 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-03 21:04:24,501 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-03 21:04:24,501 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-03 21:04:24,506 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,535 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,638 INFO  L138                Inliner]: procedures = 175, calls = 49, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151
[2024-06-03 21:04:24,638 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-03 21:04:24,639 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-03 21:04:24,639 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-03 21:04:24,639 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-03 21:04:24,648 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,649 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,663 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,710 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:04:24,710 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,711 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,752 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,753 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,775 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,781 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,804 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-03 21:04:24,805 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-03 21:04:24,805 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-03 21:04:24,805 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-03 21:04:24,806 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (1/1) ...
[2024-06-03 21:04:24,810 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-03 21:04:24,817 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-03 21:04:24,829 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:04:24,842 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:04:24,863 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-03 21:04:24,863 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-03 21:04:24,863 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-03 21:04:24,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-03 21:04:24,864 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-03 21:04:24,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-03 21:04:24,864 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-03 21:04:24,864 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-03 21:04:24,864 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-03 21:04:24,864 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-03 21:04:24,864 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-03 21:04:24,865 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-03 21:04:24,866 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:04:24,971 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-03 21:04:24,972 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-03 21:04:26,347 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-03 21:04:26,349 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-03 21:04:26,662 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-03 21:04:26,662 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-03 21:04:26,663 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:04:26 BoogieIcfgContainer
[2024-06-03 21:04:26,663 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-03 21:04:26,666 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-03 21:04:26,666 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-03 21:04:26,668 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-03 21:04:26,668 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:04:23" (1/4) ...
[2024-06-03 21:04:26,670 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca1643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:04:26, skipping insertion in model container
[2024-06-03 21:04:26,670 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:04:23" (2/4) ...
[2024-06-03 21:04:26,670 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca1643 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:04:26, skipping insertion in model container
[2024-06-03 21:04:26,670 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:04:24" (3/4) ...
[2024-06-03 21:04:26,671 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aca1643 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:04:26, skipping insertion in model container
[2024-06-03 21:04:26,671 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:04:26" (4/4) ...
[2024-06-03 21:04:26,672 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix001.oepc.i
[2024-06-03 21:04:26,684 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-03 21:04:26,684 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-03 21:04:26,684 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-03 21:04:26,786 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-03 21:04:26,813 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow
[2024-06-03 21:04:26,886 INFO  L124   PetriNetUnfolderBase]: 0/41 cut-off events.
[2024-06-03 21:04:26,886 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:04:26,888 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-03 21:04:26,888 INFO  L82        GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow
[2024-06-03 21:04:26,891 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow
[2024-06-03 21:04:26,901 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-03 21:04:26,907 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;@53ca39c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-03 21:04:26,908 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-03 21:04:26,915 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-03 21:04:26,916 INFO  L124   PetriNetUnfolderBase]: 0/7 cut-off events.
[2024-06-03 21:04:26,916 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-03 21:04:26,916 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:04:26,917 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-03 21:04:26,917 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:04:26,921 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:04:26,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 154931612, now seen corresponding path program 1 times
[2024-06-03 21:04:26,931 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:04:26,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921234035]
[2024-06-03 21:04:26,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:04:26,932 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:04:27,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:04:33,178 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:04:33,179 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:04:33,179 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921234035]
[2024-06-03 21:04:33,180 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921234035] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:04:33,180 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:04:33,180 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-03 21:04:33,181 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43358957]
[2024-06-03 21:04:33,182 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:04:33,188 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-03 21:04:33,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:04:33,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-03 21:04:33,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-03 21:04:33,307 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-03 21:04:33,309 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:04:33,309 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:04:33,309 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-03 21:04:33,310 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:04:34,218 INFO  L124   PetriNetUnfolderBase]: 1363/2134 cut-off events.
[2024-06-03 21:04:34,218 INFO  L125   PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES.
[2024-06-03 21:04:34,223 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 2134 events. 1363/2134 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10821 event pairs, 964 based on Foata normal form. 1/2079 useless extension candidates. Maximal degree in co-relation 4245. Up to 2037 conditions per place. 
[2024-06-03 21:04:34,231 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions.
[2024-06-03 21:04:34,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 181 flow
[2024-06-03 21:04:34,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-03 21:04:34,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-03 21:04:34,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions.
[2024-06-03 21:04:34,240 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6060606060606061
[2024-06-03 21:04:34,241 INFO  L175             Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 80 transitions.
[2024-06-03 21:04:34,242 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 181 flow
[2024-06-03 21:04:34,243 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-03 21:04:34,245 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow
[2024-06-03 21:04:34,246 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-03 21:04:34,248 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places.
[2024-06-03 21:04:34,248 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow
[2024-06-03 21:04:34,249 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:04:34,249 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:04:34,249 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:04:34,249 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-03 21:04:34,249 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:04:34,250 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:04:34,250 INFO  L85        PathProgramCache]: Analyzing trace with hash -1434532229, now seen corresponding path program 1 times
[2024-06-03 21:04:34,250 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:04:34,250 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768844016]
[2024-06-03 21:04:34,250 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:04:34,250 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:04:34,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:04:38,954 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:04:38,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:04:38,955 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768844016]
[2024-06-03 21:04:38,955 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768844016] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:04:38,955 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:04:38,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-03 21:04:38,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454994705]
[2024-06-03 21:04:38,956 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:04:38,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-03 21:04:38,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:04:38,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-03 21:04:38,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-03 21:04:39,079 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-03 21:04:39,079 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:04:39,079 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:04:39,080 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-03 21:04:39,080 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:04:39,985 INFO  L124   PetriNetUnfolderBase]: 1357/2135 cut-off events.
[2024-06-03 21:04:39,986 INFO  L125   PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES.
[2024-06-03 21:04:39,989 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4804 conditions, 2135 events. 1357/2135 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10830 event pairs, 840 based on Foata normal form. 3/2122 useless extension candidates. Maximal degree in co-relation 4789. Up to 2013 conditions per place. 
[2024-06-03 21:04:39,998 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 41 selfloop transitions, 7 changer transitions 0/55 dead transitions.
[2024-06-03 21:04:39,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 248 flow
[2024-06-03 21:04:39,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-03 21:04:39,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-03 21:04:40,001 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions.
[2024-06-03 21:04:40,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5852272727272727
[2024-06-03 21:04:40,002 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 103 transitions.
[2024-06-03 21:04:40,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 248 flow
[2024-06-03 21:04:40,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-03 21:04:40,006 INFO  L231             Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow
[2024-06-03 21:04:40,007 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41}
[2024-06-03 21:04:40,007 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2024-06-03 21:04:40,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow
[2024-06-03 21:04:40,008 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:04:40,008 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:04:40,009 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:04:40,011 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-03 21:04:40,011 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:04:40,012 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:04:40,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -1520824703, now seen corresponding path program 1 times
[2024-06-03 21:04:40,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:04:40,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571841637]
[2024-06-03 21:04:40,020 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:04:40,020 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:04:40,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:04:46,310 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:04:46,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:04:46,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571841637]
[2024-06-03 21:04:46,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571841637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:04:46,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:04:46,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-03 21:04:46,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837227186]
[2024-06-03 21:04:46,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:04:46,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-03 21:04:46,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:04:46,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-03 21:04:46,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-06-03 21:04:46,437 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44
[2024-06-03 21:04:46,438 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand  has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:04:46,438 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:04:46,438 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44
[2024-06-03 21:04:46,438 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:04:47,481 INFO  L124   PetriNetUnfolderBase]: 1351/2142 cut-off events.
[2024-06-03 21:04:47,481 INFO  L125   PetriNetUnfolderBase]: For 1162/1162 co-relation queries the response was YES.
[2024-06-03 21:04:47,484 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 2142 events. 1351/2142 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10944 event pairs, 716 based on Foata normal form. 3/2135 useless extension candidates. Maximal degree in co-relation 5320. Up to 1989 conditions per place. 
[2024-06-03 21:04:47,493 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 48 selfloop transitions, 10 changer transitions 0/65 dead transitions.
[2024-06-03 21:04:47,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 326 flow
[2024-06-03 21:04:47,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:04:47,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:04:47,497 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions.
[2024-06-03 21:04:47,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5727272727272728
[2024-06-03 21:04:47,498 INFO  L175             Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 126 transitions.
[2024-06-03 21:04:47,499 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 326 flow
[2024-06-03 21:04:47,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-03 21:04:47,502 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 178 flow
[2024-06-03 21:04:47,502 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, 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=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2024-06-03 21:04:47,503 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places.
[2024-06-03 21:04:47,503 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 178 flow
[2024-06-03 21:04:47,503 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states 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:04:47,503 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:04:47,504 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:04:47,504 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-03 21:04:47,504 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:04:47,504 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:04:47,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -1223611968, now seen corresponding path program 1 times
[2024-06-03 21:04:47,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:04:47,505 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105813583]
[2024-06-03 21:04:47,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:04:47,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:04:47,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:04:54,268 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:04:54,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:04:54,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105813583]
[2024-06-03 21:04:54,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105813583] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:04:54,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:04:54,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:04:54,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203454866]
[2024-06-03 21:04:54,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:04:54,274 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:04:54,275 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:04:54,276 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:04:54,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:04:54,530 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-03 21:04:54,530 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 178 flow. Second operand  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:04:54,530 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:04:54,530 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-03 21:04:54,530 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:04:55,848 INFO  L124   PetriNetUnfolderBase]: 1586/2499 cut-off events.
[2024-06-03 21:04:55,848 INFO  L125   PetriNetUnfolderBase]: For 2479/2479 co-relation queries the response was YES.
[2024-06-03 21:04:55,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 2499 events. 1586/2499 cut-off events. For 2479/2479 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12821 event pairs, 667 based on Foata normal form. 3/2481 useless extension candidates. Maximal degree in co-relation 6755. Up to 2302 conditions per place. 
[2024-06-03 21:04:55,861 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 63 selfloop transitions, 16 changer transitions 0/85 dead transitions.
[2024-06-03 21:04:55,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 464 flow
[2024-06-03 21:04:55,862 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:04:55,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:04:55,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 166 transitions.
[2024-06-03 21:04:55,864 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.538961038961039
[2024-06-03 21:04:55,864 INFO  L175             Difference]: Start difference. First operand has 51 places, 44 transitions, 178 flow. Second operand 7 states and 166 transitions.
[2024-06-03 21:04:55,864 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 464 flow
[2024-06-03 21:04:55,868 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 430 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-03 21:04:55,869 INFO  L231             Difference]: Finished difference. Result has 56 places, 50 transitions, 236 flow
[2024-06-03 21:04:55,869 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=236, PETRI_PLACES=56, PETRI_TRANSITIONS=50}
[2024-06-03 21:04:55,871 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places.
[2024-06-03 21:04:55,871 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 236 flow
[2024-06-03 21:04:55,871 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:04:55,871 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:04:55,871 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:04:55,871 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-03 21:04:55,872 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:04:55,872 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:04:55,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -2087886214, now seen corresponding path program 1 times
[2024-06-03 21:04:55,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:04:55,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138752655]
[2024-06-03 21:04:55,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:04:55,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:04:55,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:05:07,169 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:05:07,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:05:07,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138752655]
[2024-06-03 21:05:07,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138752655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:05:07,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:05:07,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-03 21:05:07,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892965999]
[2024-06-03 21:05:07,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:05:07,170 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-03 21:05:07,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:05:07,170 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-03 21:05:07,170 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-03 21:05:07,292 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:05:07,293 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 236 flow. Second operand  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:05:07,293 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:05:07,293 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:05:07,293 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:05:08,658 INFO  L124   PetriNetUnfolderBase]: 1930/2978 cut-off events.
[2024-06-03 21:05:08,659 INFO  L125   PetriNetUnfolderBase]: For 4641/4641 co-relation queries the response was YES.
[2024-06-03 21:05:08,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8825 conditions, 2978 events. 1930/2978 cut-off events. For 4641/4641 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14843 event pairs, 825 based on Foata normal form. 2/2979 useless extension candidates. Maximal degree in co-relation 8805. Up to 2849 conditions per place. 
[2024-06-03 21:05:08,673 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 51 selfloop transitions, 8 changer transitions 0/64 dead transitions.
[2024-06-03 21:05:08,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 398 flow
[2024-06-03 21:05:08,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:05:08,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:05:08,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions.
[2024-06-03 21:05:08,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45
[2024-06-03 21:05:08,676 INFO  L175             Difference]: Start difference. First operand has 56 places, 50 transitions, 236 flow. Second operand 5 states and 99 transitions.
[2024-06-03 21:05:08,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 398 flow
[2024-06-03 21:05:08,684 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 360 flow, removed 6 selfloop flow, removed 4 redundant places.
[2024-06-03 21:05:08,685 INFO  L231             Difference]: Finished difference. Result has 57 places, 53 transitions, 244 flow
[2024-06-03 21:05:08,685 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=57, PETRI_TRANSITIONS=53}
[2024-06-03 21:05:08,687 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places.
[2024-06-03 21:05:08,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 244 flow
[2024-06-03 21:05:08,688 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:05:08,689 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:05:08,689 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:05:08,689 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-03 21:05:08,689 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:05:08,689 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:05:08,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024745175, now seen corresponding path program 1 times
[2024-06-03 21:05:08,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:05:08,690 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167048998]
[2024-06-03 21:05:08,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:05:08,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:05:08,749 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:05:15,435 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:05:15,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:05:15,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167048998]
[2024-06-03 21:05:15,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167048998] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:05:15,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:05:15,436 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:05:15,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936710857]
[2024-06-03 21:05:15,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:05:15,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:05:15,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:05:15,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:05:15,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:05:15,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44
[2024-06-03 21:05:15,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 244 flow. Second operand  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:05:15,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:05:15,623 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44
[2024-06-03 21:05:15,623 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:05:17,029 INFO  L124   PetriNetUnfolderBase]: 1797/2829 cut-off events.
[2024-06-03 21:05:17,029 INFO  L125   PetriNetUnfolderBase]: For 6559/6559 co-relation queries the response was YES.
[2024-06-03 21:05:17,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8943 conditions, 2829 events. 1797/2829 cut-off events. For 6559/6559 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14603 event pairs, 603 based on Foata normal form. 6/2824 useless extension candidates. Maximal degree in co-relation 8921. Up to 2550 conditions per place. 
[2024-06-03 21:05:17,042 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 63 selfloop transitions, 17 changer transitions 0/87 dead transitions.
[2024-06-03 21:05:17,042 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 500 flow
[2024-06-03 21:05:17,045 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:05:17,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:05:17,046 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-06-03 21:05:17,046 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5292207792207793
[2024-06-03 21:05:17,047 INFO  L175             Difference]: Start difference. First operand has 57 places, 53 transitions, 244 flow. Second operand 7 states and 163 transitions.
[2024-06-03 21:05:17,047 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 500 flow
[2024-06-03 21:05:17,056 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 478 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-06-03 21:05:17,059 INFO  L231             Difference]: Finished difference. Result has 60 places, 54 transitions, 279 flow
[2024-06-03 21:05:17,059 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=60, PETRI_TRANSITIONS=54}
[2024-06-03 21:05:17,061 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places.
[2024-06-03 21:05:17,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 54 transitions, 279 flow
[2024-06-03 21:05:17,062 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:05:17,062 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:05:17,062 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:05:17,062 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-03 21:05:17,062 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:05:17,063 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:05:17,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -310686871, now seen corresponding path program 1 times
[2024-06-03 21:05:17,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:05:17,067 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918781890]
[2024-06-03 21:05:17,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:05:17,067 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:05:17,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:05:29,653 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:05:29,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:05:29,654 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918781890]
[2024-06-03 21:05:29,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918781890] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:05:29,654 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:05:29,654 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:05:29,654 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127314084]
[2024-06-03 21:05:29,654 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:05:29,654 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:05:29,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:05:29,655 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:05:29,655 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:05:29,803 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:05:29,804 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 54 transitions, 279 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:05:29,804 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:05:29,804 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:05:29,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:05:31,153 INFO  L124   PetriNetUnfolderBase]: 1911/2947 cut-off events.
[2024-06-03 21:05:31,153 INFO  L125   PetriNetUnfolderBase]: For 8888/8888 co-relation queries the response was YES.
[2024-06-03 21:05:31,157 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9828 conditions, 2947 events. 1911/2947 cut-off events. For 8888/8888 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14701 event pairs, 750 based on Foata normal form. 4/2950 useless extension candidates. Maximal degree in co-relation 9806. Up to 2802 conditions per place. 
[2024-06-03 21:05:31,167 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 57 selfloop transitions, 11 changer transitions 0/73 dead transitions.
[2024-06-03 21:05:31,168 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 477 flow
[2024-06-03 21:05:31,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:05:31,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:05:31,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions.
[2024-06-03 21:05:31,169 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4393939393939394
[2024-06-03 21:05:31,169 INFO  L175             Difference]: Start difference. First operand has 60 places, 54 transitions, 279 flow. Second operand 6 states and 116 transitions.
[2024-06-03 21:05:31,169 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 477 flow
[2024-06-03 21:05:31,171 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 73 transitions, 428 flow, removed 9 selfloop flow, removed 5 redundant places.
[2024-06-03 21:05:31,172 INFO  L231             Difference]: Finished difference. Result has 61 places, 57 transitions, 288 flow
[2024-06-03 21:05:31,173 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=61, PETRI_TRANSITIONS=57}
[2024-06-03 21:05:31,173 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places.
[2024-06-03 21:05:31,173 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 288 flow
[2024-06-03 21:05:31,173 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:05:31,174 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:05:31,174 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:05:31,174 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-03 21:05:31,174 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:05:31,174 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:05:31,174 INFO  L85        PathProgramCache]: Analyzing trace with hash 641949573, now seen corresponding path program 1 times
[2024-06-03 21:05:31,174 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:05:31,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389745726]
[2024-06-03 21:05:31,175 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:05:31,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:05:31,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:05:40,760 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:05:40,760 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:05:40,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389745726]
[2024-06-03 21:05:40,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389745726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:05:40,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:05:40,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:05:40,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838575500]
[2024-06-03 21:05:40,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:05:40,762 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:05:40,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:05:40,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:05:40,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:05:40,928 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:05:40,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 288 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:05:40,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:05:40,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:05:40,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:05:42,168 INFO  L124   PetriNetUnfolderBase]: 1922/2987 cut-off events.
[2024-06-03 21:05:42,168 INFO  L125   PetriNetUnfolderBase]: For 11077/11081 co-relation queries the response was YES.
[2024-06-03 21:05:42,172 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10465 conditions, 2987 events. 1922/2987 cut-off events. For 11077/11081 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15026 event pairs, 751 based on Foata normal form. 6/2992 useless extension candidates. Maximal degree in co-relation 10441. Up to 2801 conditions per place. 
[2024-06-03 21:05:42,181 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 62 selfloop transitions, 16 changer transitions 0/83 dead transitions.
[2024-06-03 21:05:42,182 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 83 transitions, 570 flow
[2024-06-03 21:05:42,182 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:05:42,182 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:05:42,183 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions.
[2024-06-03 21:05:42,183 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4621212121212121
[2024-06-03 21:05:42,183 INFO  L175             Difference]: Start difference. First operand has 61 places, 57 transitions, 288 flow. Second operand 6 states and 122 transitions.
[2024-06-03 21:05:42,183 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 83 transitions, 570 flow
[2024-06-03 21:05:42,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 83 transitions, 536 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-06-03 21:05:42,187 INFO  L231             Difference]: Finished difference. Result has 63 places, 63 transitions, 348 flow
[2024-06-03 21:05:42,187 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=63, PETRI_TRANSITIONS=63}
[2024-06-03 21:05:42,188 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places.
[2024-06-03 21:05:42,188 INFO  L495      AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 348 flow
[2024-06-03 21:05:42,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:05:42,188 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:05:42,188 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:05:42,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-03 21:05:42,189 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:05:42,189 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:05:42,189 INFO  L85        PathProgramCache]: Analyzing trace with hash -697280173, now seen corresponding path program 2 times
[2024-06-03 21:05:42,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:05:42,189 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930158564]
[2024-06-03 21:05:42,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:05:42,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:05:42,221 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:05:52,724 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:05:52,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:05:52,724 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930158564]
[2024-06-03 21:05:52,724 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930158564] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:05:52,724 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:05:52,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:05:52,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090315641]
[2024-06-03 21:05:52,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:05:52,725 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:05:52,725 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:05:52,725 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:05:52,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:05:52,861 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:05:52,861 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 348 flow. Second operand  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:05:52,861 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:05:52,861 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:05:52,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:05:54,248 INFO  L124   PetriNetUnfolderBase]: 1917/2979 cut-off events.
[2024-06-03 21:05:54,248 INFO  L125   PetriNetUnfolderBase]: For 13729/13729 co-relation queries the response was YES.
[2024-06-03 21:05:54,252 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11037 conditions, 2979 events. 1917/2979 cut-off events. For 13729/13729 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14983 event pairs, 747 based on Foata normal form. 2/2980 useless extension candidates. Maximal degree in co-relation 11012. Up to 2820 conditions per place. 
[2024-06-03 21:05:54,262 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 62 selfloop transitions, 11 changer transitions 0/78 dead transitions.
[2024-06-03 21:05:54,262 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 532 flow
[2024-06-03 21:05:54,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:05:54,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:05:54,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions.
[2024-06-03 21:05:54,263 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4356060606060606
[2024-06-03 21:05:54,263 INFO  L175             Difference]: Start difference. First operand has 63 places, 63 transitions, 348 flow. Second operand 6 states and 115 transitions.
[2024-06-03 21:05:54,264 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 532 flow
[2024-06-03 21:05:54,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 78 transitions, 492 flow, removed 16 selfloop flow, removed 2 redundant places.
[2024-06-03 21:05:54,275 INFO  L231             Difference]: Finished difference. Result has 67 places, 63 transitions, 338 flow
[2024-06-03 21:05:54,275 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=67, PETRI_TRANSITIONS=63}
[2024-06-03 21:05:54,276 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places.
[2024-06-03 21:05:54,276 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 338 flow
[2024-06-03 21:05:54,277 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:05:54,277 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:05:54,277 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:05:54,277 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-03 21:05:54,277 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:05:54,277 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:05:54,278 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870727301, now seen corresponding path program 1 times
[2024-06-03 21:05:54,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:05:54,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933648637]
[2024-06-03 21:05:54,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:05:54,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:05:54,338 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:06:06,283 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:06:06,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:06:06,283 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933648637]
[2024-06-03 21:06:06,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933648637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:06:06,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:06:06,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:06:06,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568322687]
[2024-06-03 21:06:06,284 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:06:06,284 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:06:06,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:06:06,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:06:06,285 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:06:06,480 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:06:06,480 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 338 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:06,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:06:06,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:06:06,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:06:07,747 INFO  L124   PetriNetUnfolderBase]: 1928/2995 cut-off events.
[2024-06-03 21:06:07,747 INFO  L125   PetriNetUnfolderBase]: For 16086/16090 co-relation queries the response was YES.
[2024-06-03 21:06:07,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11386 conditions, 2995 events. 1928/2995 cut-off events. For 16086/16090 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15102 event pairs, 733 based on Foata normal form. 6/3000 useless extension candidates. Maximal degree in co-relation 11359. Up to 2772 conditions per place. 
[2024-06-03 21:06:07,761 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 67 selfloop transitions, 24 changer transitions 0/96 dead transitions.
[2024-06-03 21:06:07,761 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 96 transitions, 680 flow
[2024-06-03 21:06:07,761 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:06:07,762 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:06:07,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-03 21:06:07,763 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-03 21:06:07,763 INFO  L175             Difference]: Start difference. First operand has 67 places, 63 transitions, 338 flow. Second operand 7 states and 143 transitions.
[2024-06-03 21:06:07,763 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 96 transitions, 680 flow
[2024-06-03 21:06:07,769 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 96 transitions, 650 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-06-03 21:06:07,770 INFO  L231             Difference]: Finished difference. Result has 69 places, 69 transitions, 426 flow
[2024-06-03 21:06:07,771 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=426, PETRI_PLACES=69, PETRI_TRANSITIONS=69}
[2024-06-03 21:06:07,771 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places.
[2024-06-03 21:06:07,772 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 426 flow
[2024-06-03 21:06:07,772 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:07,772 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:06:07,772 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:06:07,772 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-03 21:06:07,773 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:06:07,773 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:06:07,773 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870733098, now seen corresponding path program 1 times
[2024-06-03 21:06:07,773 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:06:07,773 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87290073]
[2024-06-03 21:06:07,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:06:07,774 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:06:07,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:06:17,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:06:17,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:06:17,950 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87290073]
[2024-06-03 21:06:17,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87290073] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:06:17,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:06:17,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:06:17,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366775636]
[2024-06-03 21:06:17,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:06:17,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:06:17,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:06:17,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:06:17,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:06:18,142 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:06:18,142 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 426 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:18,142 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:06:18,142 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:06:18,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:06:19,467 INFO  L124   PetriNetUnfolderBase]: 1966/3052 cut-off events.
[2024-06-03 21:06:19,468 INFO  L125   PetriNetUnfolderBase]: For 20071/20075 co-relation queries the response was YES.
[2024-06-03 21:06:19,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12305 conditions, 3052 events. 1966/3052 cut-off events. For 20071/20075 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15356 event pairs, 688 based on Foata normal form. 5/3055 useless extension candidates. Maximal degree in co-relation 12277. Up to 2811 conditions per place. 
[2024-06-03 21:06:19,479 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 76 selfloop transitions, 23 changer transitions 0/104 dead transitions.
[2024-06-03 21:06:19,479 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 104 transitions, 798 flow
[2024-06-03 21:06:19,480 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:06:19,480 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:06:19,480 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions.
[2024-06-03 21:06:19,480 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4642857142857143
[2024-06-03 21:06:19,480 INFO  L175             Difference]: Start difference. First operand has 69 places, 69 transitions, 426 flow. Second operand 7 states and 143 transitions.
[2024-06-03 21:06:19,481 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 104 transitions, 798 flow
[2024-06-03 21:06:19,490 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 752 flow, removed 14 selfloop flow, removed 3 redundant places.
[2024-06-03 21:06:19,491 INFO  L231             Difference]: Finished difference. Result has 74 places, 78 transitions, 524 flow
[2024-06-03 21:06:19,491 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=74, PETRI_TRANSITIONS=78}
[2024-06-03 21:06:19,492 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places.
[2024-06-03 21:06:19,492 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 524 flow
[2024-06-03 21:06:19,492 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:19,492 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:06:19,492 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:06:19,492 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-03 21:06:19,492 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:06:19,493 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:06:19,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870732881, now seen corresponding path program 2 times
[2024-06-03 21:06:19,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:06:19,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056718904]
[2024-06-03 21:06:19,493 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:06:19,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:06:19,535 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:06:30,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:06:30,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:06:30,895 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056718904]
[2024-06-03 21:06:30,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056718904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:06:30,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:06:30,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:06:30,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187599436]
[2024-06-03 21:06:30,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:06:30,895 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:06:30,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:06:30,896 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:06:30,896 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:06:31,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:06:31,146 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 524 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:31,146 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:06:31,146 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:06:31,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:06:32,382 INFO  L124   PetriNetUnfolderBase]: 1977/3069 cut-off events.
[2024-06-03 21:06:32,383 INFO  L125   PetriNetUnfolderBase]: For 23880/23882 co-relation queries the response was YES.
[2024-06-03 21:06:32,387 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13142 conditions, 3069 events. 1977/3069 cut-off events. For 23880/23882 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15435 event pairs, 699 based on Foata normal form. 4/3072 useless extension candidates. Maximal degree in co-relation 13111. Up to 2874 conditions per place. 
[2024-06-03 21:06:32,395 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 79 selfloop transitions, 19 changer transitions 0/103 dead transitions.
[2024-06-03 21:06:32,395 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 103 transitions, 806 flow
[2024-06-03 21:06:32,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:06:32,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:06:32,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-03 21:06:32,396 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4448051948051948
[2024-06-03 21:06:32,396 INFO  L175             Difference]: Start difference. First operand has 74 places, 78 transitions, 524 flow. Second operand 7 states and 137 transitions.
[2024-06-03 21:06:32,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 103 transitions, 806 flow
[2024-06-03 21:06:32,407 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 103 transitions, 776 flow, removed 12 selfloop flow, removed 2 redundant places.
[2024-06-03 21:06:32,408 INFO  L231             Difference]: Finished difference. Result has 79 places, 81 transitions, 576 flow
[2024-06-03 21:06:32,408 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=79, PETRI_TRANSITIONS=81}
[2024-06-03 21:06:32,408 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places.
[2024-06-03 21:06:32,409 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 576 flow
[2024-06-03 21:06:32,409 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:32,409 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:06:32,409 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:06:32,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-03 21:06:32,409 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:06:32,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:06:32,410 INFO  L85        PathProgramCache]: Analyzing trace with hash -140848017, now seen corresponding path program 3 times
[2024-06-03 21:06:32,410 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:06:32,410 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747776338]
[2024-06-03 21:06:32,410 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:06:32,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:06:32,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:06:43,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:06:43,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:06:43,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747776338]
[2024-06-03 21:06:43,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747776338] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:06:43,542 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:06:43,542 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:06:43,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158440498]
[2024-06-03 21:06:43,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:06:43,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:06:43,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:06:43,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:06:43,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:06:43,816 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:06:43,816 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 576 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:43,817 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:06:43,817 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:06:43,817 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:06:45,177 INFO  L124   PetriNetUnfolderBase]: 1972/3056 cut-off events.
[2024-06-03 21:06:45,178 INFO  L125   PetriNetUnfolderBase]: For 26846/26846 co-relation queries the response was YES.
[2024-06-03 21:06:45,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13390 conditions, 3056 events. 1972/3056 cut-off events. For 26846/26846 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15302 event pairs, 695 based on Foata normal form. 2/3057 useless extension candidates. Maximal degree in co-relation 13356. Up to 2891 conditions per place. 
[2024-06-03 21:06:45,190 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 81 selfloop transitions, 14 changer transitions 0/100 dead transitions.
[2024-06-03 21:06:45,190 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 814 flow
[2024-06-03 21:06:45,191 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:06:45,191 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:06:45,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-03 21:06:45,192 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42857142857142855
[2024-06-03 21:06:45,192 INFO  L175             Difference]: Start difference. First operand has 79 places, 81 transitions, 576 flow. Second operand 7 states and 132 transitions.
[2024-06-03 21:06:45,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 814 flow
[2024-06-03 21:06:45,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 100 transitions, 748 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-03 21:06:45,229 INFO  L231             Difference]: Finished difference. Result has 81 places, 81 transitions, 546 flow
[2024-06-03 21:06:45,229 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=546, PETRI_PLACES=81, PETRI_TRANSITIONS=81}
[2024-06-03 21:06:45,230 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places.
[2024-06-03 21:06:45,230 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 546 flow
[2024-06-03 21:06:45,230 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:45,230 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:06:45,230 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:06:45,230 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-03 21:06:45,231 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:06:45,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:06:45,231 INFO  L85        PathProgramCache]: Analyzing trace with hash -500754080, now seen corresponding path program 2 times
[2024-06-03 21:06:45,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:06:45,231 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982358524]
[2024-06-03 21:06:45,231 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:06:45,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:06:45,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:06:55,258 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:06:55,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:06:55,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982358524]
[2024-06-03 21:06:55,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982358524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:06:55,258 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:06:55,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:06:55,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010200807]
[2024-06-03 21:06:55,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:06:55,259 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:06:55,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:06:55,260 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:06:55,260 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:06:55,444 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:06:55,445 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 546 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:55,445 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:06:55,445 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:06:55,445 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:06:56,833 INFO  L124   PetriNetUnfolderBase]: 1994/3093 cut-off events.
[2024-06-03 21:06:56,833 INFO  L125   PetriNetUnfolderBase]: For 30475/30475 co-relation queries the response was YES.
[2024-06-03 21:06:56,839 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13775 conditions, 3093 events. 1994/3093 cut-off events. For 30475/30475 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15517 event pairs, 695 based on Foata normal form. 4/3096 useless extension candidates. Maximal degree in co-relation 13740. Up to 2914 conditions per place. 
[2024-06-03 21:06:56,849 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 85 selfloop transitions, 14 changer transitions 0/104 dead transitions.
[2024-06-03 21:06:56,849 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 104 transitions, 832 flow
[2024-06-03 21:06:56,849 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:06:56,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:06:56,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-03 21:06:56,850 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2024-06-03 21:06:56,850 INFO  L175             Difference]: Start difference. First operand has 81 places, 81 transitions, 546 flow. Second operand 7 states and 133 transitions.
[2024-06-03 21:06:56,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 104 transitions, 832 flow
[2024-06-03 21:06:56,866 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 104 transitions, 782 flow, removed 5 selfloop flow, removed 7 redundant places.
[2024-06-03 21:06:56,867 INFO  L231             Difference]: Finished difference. Result has 81 places, 84 transitions, 574 flow
[2024-06-03 21:06:56,867 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=574, PETRI_PLACES=81, PETRI_TRANSITIONS=84}
[2024-06-03 21:06:56,868 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places.
[2024-06-03 21:06:56,868 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 84 transitions, 574 flow
[2024-06-03 21:06:56,868 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:06:56,868 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:06:56,868 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:06:56,868 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-03 21:06:56,869 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:06:56,869 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:06:56,869 INFO  L85        PathProgramCache]: Analyzing trace with hash -1236366884, now seen corresponding path program 3 times
[2024-06-03 21:06:56,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:06:56,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494833871]
[2024-06-03 21:06:56,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:06:56,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:06:56,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:07:07,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:07:07,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:07:07,030 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494833871]
[2024-06-03 21:07:07,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494833871] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:07:07,030 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:07:07,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:07:07,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854394892]
[2024-06-03 21:07:07,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:07:07,031 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:07:07,031 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:07:07,032 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:07:07,032 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:07:07,174 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:07:07,175 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 84 transitions, 574 flow. Second operand  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:07:07,175 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:07:07,175 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:07:07,175 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:07:08,524 INFO  L124   PetriNetUnfolderBase]: 1984/3079 cut-off events.
[2024-06-03 21:07:08,524 INFO  L125   PetriNetUnfolderBase]: For 33837/33837 co-relation queries the response was YES.
[2024-06-03 21:07:08,529 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 3079 events. 1984/3079 cut-off events. For 33837/33837 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 15451 event pairs, 693 based on Foata normal form. 4/3082 useless extension candidates. Maximal degree in co-relation 13888. Up to 2873 conditions per place. 
[2024-06-03 21:07:08,537 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 81 selfloop transitions, 19 changer transitions 0/105 dead transitions.
[2024-06-03 21:07:08,537 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 830 flow
[2024-06-03 21:07:08,538 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:07:08,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:07:08,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-03 21:07:08,538 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44155844155844154
[2024-06-03 21:07:08,539 INFO  L175             Difference]: Start difference. First operand has 81 places, 84 transitions, 574 flow. Second operand 7 states and 136 transitions.
[2024-06-03 21:07:08,539 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 830 flow
[2024-06-03 21:07:08,555 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 105 transitions, 764 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-03 21:07:08,557 INFO  L231             Difference]: Finished difference. Result has 83 places, 84 transitions, 554 flow
[2024-06-03 21:07:08,557 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=554, PETRI_PLACES=83, PETRI_TRANSITIONS=84}
[2024-06-03 21:07:08,558 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places.
[2024-06-03 21:07:08,558 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 554 flow
[2024-06-03 21:07:08,558 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:07:08,558 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:07:08,558 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:07:08,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-03 21:07:08,558 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:07:08,559 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:07:08,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547208780, now seen corresponding path program 1 times
[2024-06-03 21:07:08,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:07:08,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355594975]
[2024-06-03 21:07:08,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:07:08,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:07:08,591 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:07:23,706 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:07:23,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:07:23,708 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355594975]
[2024-06-03 21:07:23,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355594975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:07:23,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:07:23,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-03 21:07:23,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091412583]
[2024-06-03 21:07:23,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:07:23,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-03 21:07:23,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:07:23,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-03 21:07:23,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-03 21:07:23,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:07:23,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 554 flow. Second operand  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:07:23,875 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:07:23,875 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:07:23,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:07:25,445 INFO  L124   PetriNetUnfolderBase]: 2402/3673 cut-off events.
[2024-06-03 21:07:25,445 INFO  L125   PetriNetUnfolderBase]: For 47931/47931 co-relation queries the response was YES.
[2024-06-03 21:07:25,452 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17121 conditions, 3673 events. 2402/3673 cut-off events. For 47931/47931 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18189 event pairs, 959 based on Foata normal form. 1/3673 useless extension candidates. Maximal degree in co-relation 17086. Up to 3525 conditions per place. 
[2024-06-03 21:07:25,461 INFO  L140   encePairwiseOnDemand]: 37/44 looper letters, 72 selfloop transitions, 8 changer transitions 0/95 dead transitions.
[2024-06-03 21:07:25,461 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 756 flow
[2024-06-03 21:07:25,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-03 21:07:25,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-03 21:07:25,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions.
[2024-06-03 21:07:25,462 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42727272727272725
[2024-06-03 21:07:25,462 INFO  L175             Difference]: Start difference. First operand has 83 places, 84 transitions, 554 flow. Second operand 5 states and 94 transitions.
[2024-06-03 21:07:25,462 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 756 flow
[2024-06-03 21:07:25,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 95 transitions, 692 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-06-03 21:07:25,485 INFO  L231             Difference]: Finished difference. Result has 82 places, 87 transitions, 540 flow
[2024-06-03 21:07:25,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=540, PETRI_PLACES=82, PETRI_TRANSITIONS=87}
[2024-06-03 21:07:25,486 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places.
[2024-06-03 21:07:25,486 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 540 flow
[2024-06-03 21:07:25,486 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:07:25,486 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:07:25,486 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:07:25,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-03 21:07:25,488 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:07:25,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:07:25,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -1566484828, now seen corresponding path program 1 times
[2024-06-03 21:07:25,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:07:25,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046156790]
[2024-06-03 21:07:25,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:07:25,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:07:25,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:07:34,752 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:07:34,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:07:34,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046156790]
[2024-06-03 21:07:34,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046156790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:07:34,753 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:07:34,753 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:07:34,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479281361]
[2024-06-03 21:07:34,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:07:34,754 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:07:34,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:07:34,754 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:07:34,754 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:07:35,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:07:35,039 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 540 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:07:35,039 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:07:35,039 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:07:35,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:07:36,653 INFO  L124   PetriNetUnfolderBase]: 2104/3244 cut-off events.
[2024-06-03 21:07:36,654 INFO  L125   PetriNetUnfolderBase]: For 46849/46849 co-relation queries the response was YES.
[2024-06-03 21:07:36,661 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15865 conditions, 3244 events. 2104/3244 cut-off events. For 46849/46849 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16311 event pairs, 702 based on Foata normal form. 4/3247 useless extension candidates. Maximal degree in co-relation 15829. Up to 2983 conditions per place. 
[2024-06-03 21:07:36,672 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 98 selfloop transitions, 19 changer transitions 0/123 dead transitions.
[2024-06-03 21:07:36,672 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 123 transitions, 894 flow
[2024-06-03 21:07:36,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:07:36,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:07:36,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-03 21:07:36,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-03 21:07:36,676 INFO  L175             Difference]: Start difference. First operand has 82 places, 87 transitions, 540 flow. Second operand 8 states and 160 transitions.
[2024-06-03 21:07:36,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 123 transitions, 894 flow
[2024-06-03 21:07:36,706 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 123 transitions, 866 flow, removed 8 selfloop flow, removed 3 redundant places.
[2024-06-03 21:07:36,708 INFO  L231             Difference]: Finished difference. Result has 87 places, 90 transitions, 599 flow
[2024-06-03 21:07:36,709 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=599, PETRI_PLACES=87, PETRI_TRANSITIONS=90}
[2024-06-03 21:07:36,709 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places.
[2024-06-03 21:07:36,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 599 flow
[2024-06-03 21:07:36,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:07:36,710 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:07:36,710 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:07:36,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-03 21:07:36,710 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:07:36,710 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:07:36,711 INFO  L85        PathProgramCache]: Analyzing trace with hash -1566364858, now seen corresponding path program 2 times
[2024-06-03 21:07:36,711 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:07:36,711 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630513628]
[2024-06-03 21:07:36,711 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:07:36,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:07:36,761 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:07:47,998 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:07:47,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:07:47,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630513628]
[2024-06-03 21:07:47,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630513628] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:07:47,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:07:47,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:07:47,999 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898958119]
[2024-06-03 21:07:47,999 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:07:47,999 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:07:47,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:07:48,000 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:07:48,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:07:48,251 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:07:48,251 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 599 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:07:48,251 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:07:48,251 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:07:48,251 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:07:49,734 INFO  L124   PetriNetUnfolderBase]: 2115/3263 cut-off events.
[2024-06-03 21:07:49,734 INFO  L125   PetriNetUnfolderBase]: For 52489/52491 co-relation queries the response was YES.
[2024-06-03 21:07:49,740 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16681 conditions, 3263 events. 2115/3263 cut-off events. For 52489/52491 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16410 event pairs, 704 based on Foata normal form. 4/3266 useless extension candidates. Maximal degree in co-relation 16644. Up to 2949 conditions per place. 
[2024-06-03 21:07:49,764 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 88 selfloop transitions, 36 changer transitions 0/130 dead transitions.
[2024-06-03 21:07:49,764 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 130 transitions, 1107 flow
[2024-06-03 21:07:49,769 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:07:49,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:07:49,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 162 transitions.
[2024-06-03 21:07:49,769 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4602272727272727
[2024-06-03 21:07:49,769 INFO  L175             Difference]: Start difference. First operand has 87 places, 90 transitions, 599 flow. Second operand 8 states and 162 transitions.
[2024-06-03 21:07:49,770 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 130 transitions, 1107 flow
[2024-06-03 21:07:49,793 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 130 transitions, 1022 flow, removed 25 selfloop flow, removed 6 redundant places.
[2024-06-03 21:07:49,803 INFO  L231             Difference]: Finished difference. Result has 90 places, 99 transitions, 728 flow
[2024-06-03 21:07:49,803 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=90, PETRI_TRANSITIONS=99}
[2024-06-03 21:07:49,803 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 45 predicate places.
[2024-06-03 21:07:49,804 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 99 transitions, 728 flow
[2024-06-03 21:07:49,804 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:07:49,804 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:07:49,804 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:07:49,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-03 21:07:49,804 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:07:49,805 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:07:49,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 1419544074, now seen corresponding path program 1 times
[2024-06-03 21:07:49,805 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:07:49,805 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072582002]
[2024-06-03 21:07:49,805 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:07:49,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:07:49,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:08:01,021 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:08:01,021 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:08:01,021 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072582002]
[2024-06-03 21:08:01,021 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072582002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:08:01,021 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:08:01,021 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:08:01,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902379624]
[2024-06-03 21:08:01,022 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:08:01,023 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:08:01,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:08:01,024 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:08:01,024 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:08:01,208 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:08:01,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 99 transitions, 728 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:01,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:08:01,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:08:01,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:08:02,718 INFO  L124   PetriNetUnfolderBase]: 2160/3323 cut-off events.
[2024-06-03 21:08:02,719 INFO  L125   PetriNetUnfolderBase]: For 60548/60550 co-relation queries the response was YES.
[2024-06-03 21:08:02,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17664 conditions, 3323 events. 2160/3323 cut-off events. For 60548/60550 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16666 event pairs, 671 based on Foata normal form. 4/3323 useless extension candidates. Maximal degree in co-relation 17625. Up to 2920 conditions per place. 
[2024-06-03 21:08:02,739 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 93 selfloop transitions, 40 changer transitions 0/139 dead transitions.
[2024-06-03 21:08:02,739 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 139 transitions, 1226 flow
[2024-06-03 21:08:02,741 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:08:02,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:08:02,743 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-03 21:08:02,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715909090909091
[2024-06-03 21:08:02,744 INFO  L175             Difference]: Start difference. First operand has 90 places, 99 transitions, 728 flow. Second operand 8 states and 166 transitions.
[2024-06-03 21:08:02,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 139 transitions, 1226 flow
[2024-06-03 21:08:02,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1166 flow, removed 21 selfloop flow, removed 3 redundant places.
[2024-06-03 21:08:02,782 INFO  L231             Difference]: Finished difference. Result has 95 places, 105 transitions, 834 flow
[2024-06-03 21:08:02,782 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=834, PETRI_PLACES=95, PETRI_TRANSITIONS=105}
[2024-06-03 21:08:02,783 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places.
[2024-06-03 21:08:02,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 834 flow
[2024-06-03 21:08:02,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:02,783 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:08:02,783 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:08:02,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-03 21:08:02,784 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:08:02,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:08:02,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -1561723042, now seen corresponding path program 2 times
[2024-06-03 21:08:02,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:08:02,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585431904]
[2024-06-03 21:08:02,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:08:02,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:08:02,853 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:08:14,856 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:08:14,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:08:14,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585431904]
[2024-06-03 21:08:14,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585431904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:08:14,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:08:14,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:08:14,857 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89739077]
[2024-06-03 21:08:14,857 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:08:14,857 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:08:14,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:08:14,858 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:08:14,858 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:08:15,062 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:08:15,063 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 834 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:15,063 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:08:15,063 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:08:15,063 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:08:16,627 INFO  L124   PetriNetUnfolderBase]: 2214/3406 cut-off events.
[2024-06-03 21:08:16,628 INFO  L125   PetriNetUnfolderBase]: For 68779/68781 co-relation queries the response was YES.
[2024-06-03 21:08:16,634 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18930 conditions, 3406 events. 2214/3406 cut-off events. For 68779/68781 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17174 event pairs, 687 based on Foata normal form. 4/3406 useless extension candidates. Maximal degree in co-relation 18889. Up to 3061 conditions per place. 
[2024-06-03 21:08:16,644 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 103 selfloop transitions, 34 changer transitions 0/143 dead transitions.
[2024-06-03 21:08:16,644 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 143 transitions, 1352 flow
[2024-06-03 21:08:16,646 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:08:16,646 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:08:16,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-03 21:08:16,648 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4659090909090909
[2024-06-03 21:08:16,648 INFO  L175             Difference]: Start difference. First operand has 95 places, 105 transitions, 834 flow. Second operand 8 states and 164 transitions.
[2024-06-03 21:08:16,648 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 143 transitions, 1352 flow
[2024-06-03 21:08:16,685 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 1270 flow, removed 25 selfloop flow, removed 4 redundant places.
[2024-06-03 21:08:16,686 INFO  L231             Difference]: Finished difference. Result has 99 places, 111 transitions, 918 flow
[2024-06-03 21:08:16,687 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=918, PETRI_PLACES=99, PETRI_TRANSITIONS=111}
[2024-06-03 21:08:16,687 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places.
[2024-06-03 21:08:16,687 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 918 flow
[2024-06-03 21:08:16,687 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:16,687 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:08:16,688 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:08:16,688 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-03 21:08:16,688 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:08:16,689 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:08:16,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136821936, now seen corresponding path program 3 times
[2024-06-03 21:08:16,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:08:16,689 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739435200]
[2024-06-03 21:08:16,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:08:16,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:08:16,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:08:28,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:08:28,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:08:28,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739435200]
[2024-06-03 21:08:28,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739435200] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:08:28,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:08:28,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:08:28,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525512394]
[2024-06-03 21:08:28,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:08:28,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:08:28,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:08:28,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:08:28,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:08:28,623 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:08:28,623 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 918 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:28,623 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:08:28,624 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:08:28,624 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:08:30,214 INFO  L124   PetriNetUnfolderBase]: 2236/3439 cut-off events.
[2024-06-03 21:08:30,214 INFO  L125   PetriNetUnfolderBase]: For 75042/75044 co-relation queries the response was YES.
[2024-06-03 21:08:30,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19502 conditions, 3439 events. 2236/3439 cut-off events. For 75042/75044 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17355 event pairs, 706 based on Foata normal form. 6/3442 useless extension candidates. Maximal degree in co-relation 19459. Up to 3185 conditions per place. 
[2024-06-03 21:08:30,234 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 113 selfloop transitions, 24 changer transitions 0/143 dead transitions.
[2024-06-03 21:08:30,234 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 143 transitions, 1342 flow
[2024-06-03 21:08:30,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:08:30,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:08:30,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-03 21:08:30,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4403409090909091
[2024-06-03 21:08:30,237 INFO  L175             Difference]: Start difference. First operand has 99 places, 111 transitions, 918 flow. Second operand 8 states and 155 transitions.
[2024-06-03 21:08:30,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 143 transitions, 1342 flow
[2024-06-03 21:08:30,281 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 143 transitions, 1288 flow, removed 12 selfloop flow, removed 4 redundant places.
[2024-06-03 21:08:30,283 INFO  L231             Difference]: Finished difference. Result has 103 places, 116 transitions, 1010 flow
[2024-06-03 21:08:30,283 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1010, PETRI_PLACES=103, PETRI_TRANSITIONS=116}
[2024-06-03 21:08:30,283 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places.
[2024-06-03 21:08:30,284 INFO  L495      AbstractCegarLoop]: Abstraction has has 103 places, 116 transitions, 1010 flow
[2024-06-03 21:08:30,284 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:30,284 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:08:30,284 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:08:30,284 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-03 21:08:30,284 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:08:30,285 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:08:30,285 INFO  L85        PathProgramCache]: Analyzing trace with hash -253427046, now seen corresponding path program 3 times
[2024-06-03 21:08:30,285 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:08:30,285 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169630866]
[2024-06-03 21:08:30,285 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:08:30,285 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:08:30,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:08:42,322 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:08:42,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:08:42,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169630866]
[2024-06-03 21:08:42,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169630866] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:08:42,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:08:42,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:08:42,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072553083]
[2024-06-03 21:08:42,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:08:42,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:08:42,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:08:42,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:08:42,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:08:42,535 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:08:42,536 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 116 transitions, 1010 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:42,536 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:08:42,536 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:08:42,536 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:08:44,080 INFO  L124   PetriNetUnfolderBase]: 2226/3419 cut-off events.
[2024-06-03 21:08:44,080 INFO  L125   PetriNetUnfolderBase]: For 81395/81397 co-relation queries the response was YES.
[2024-06-03 21:08:44,089 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20041 conditions, 3419 events. 2226/3419 cut-off events. For 81395/81397 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17241 event pairs, 685 based on Foata normal form. 4/3419 useless extension candidates. Maximal degree in co-relation 19996. Up to 3112 conditions per place. 
[2024-06-03 21:08:44,100 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 110 selfloop transitions, 29 changer transitions 0/145 dead transitions.
[2024-06-03 21:08:44,101 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 1366 flow
[2024-06-03 21:08:44,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:08:44,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:08:44,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-03 21:08:44,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45170454545454547
[2024-06-03 21:08:44,104 INFO  L175             Difference]: Start difference. First operand has 103 places, 116 transitions, 1010 flow. Second operand 8 states and 159 transitions.
[2024-06-03 21:08:44,104 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 1366 flow
[2024-06-03 21:08:44,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 145 transitions, 1250 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-03 21:08:44,151 INFO  L231             Difference]: Finished difference. Result has 105 places, 116 transitions, 960 flow
[2024-06-03 21:08:44,152 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=960, PETRI_PLACES=105, PETRI_TRANSITIONS=116}
[2024-06-03 21:08:44,152 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places.
[2024-06-03 21:08:44,152 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 116 transitions, 960 flow
[2024-06-03 21:08:44,152 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:44,152 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:08:44,152 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:08:44,153 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-03 21:08:44,153 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:08:44,153 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:08:44,153 INFO  L85        PathProgramCache]: Analyzing trace with hash -63039428, now seen corresponding path program 4 times
[2024-06-03 21:08:44,153 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:08:44,153 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106290887]
[2024-06-03 21:08:44,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:08:44,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:08:44,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:08:55,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:08:55,602 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:08:55,602 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106290887]
[2024-06-03 21:08:55,602 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106290887] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:08:55,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:08:55,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:08:55,603 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77544923]
[2024-06-03 21:08:55,603 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:08:55,605 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:08:55,605 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:08:55,605 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:08:55,605 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:08:55,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:08:55,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 960 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:55,877 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:08:55,878 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:08:55,878 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:08:57,476 INFO  L124   PetriNetUnfolderBase]: 2248/3451 cut-off events.
[2024-06-03 21:08:57,476 INFO  L125   PetriNetUnfolderBase]: For 87748/87748 co-relation queries the response was YES.
[2024-06-03 21:08:57,484 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20470 conditions, 3451 events. 2248/3451 cut-off events. For 87748/87748 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17383 event pairs, 705 based on Foata normal form. 4/3452 useless extension candidates. Maximal degree in co-relation 20424. Up to 3213 conditions per place. 
[2024-06-03 21:08:57,497 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 121 selfloop transitions, 17 changer transitions 0/144 dead transitions.
[2024-06-03 21:08:57,497 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 144 transitions, 1344 flow
[2024-06-03 21:08:57,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:08:57,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:08:57,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-03 21:08:57,500 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4289772727272727
[2024-06-03 21:08:57,500 INFO  L175             Difference]: Start difference. First operand has 105 places, 116 transitions, 960 flow. Second operand 8 states and 151 transitions.
[2024-06-03 21:08:57,500 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 144 transitions, 1344 flow
[2024-06-03 21:08:57,550 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 144 transitions, 1276 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-03 21:08:57,552 INFO  L231             Difference]: Finished difference. Result has 106 places, 119 transitions, 982 flow
[2024-06-03 21:08:57,552 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=982, PETRI_PLACES=106, PETRI_TRANSITIONS=119}
[2024-06-03 21:08:57,553 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 61 predicate places.
[2024-06-03 21:08:57,553 INFO  L495      AbstractCegarLoop]: Abstraction has has 106 places, 119 transitions, 982 flow
[2024-06-03 21:08:57,553 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:08:57,553 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:08:57,553 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:08:57,553 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-03 21:08:57,554 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:08:57,568 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:08:57,568 INFO  L85        PathProgramCache]: Analyzing trace with hash -25525896, now seen corresponding path program 5 times
[2024-06-03 21:08:57,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:08:57,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506076485]
[2024-06-03 21:08:57,569 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:08:57,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:08:57,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:09:08,838 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:09:08,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:09:08,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506076485]
[2024-06-03 21:09:08,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506076485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:09:08,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:09:08,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:09:08,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614220449]
[2024-06-03 21:09:08,839 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:09:08,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:09:08,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:09:08,840 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:09:08,840 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:09:09,061 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:09:09,062 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 119 transitions, 982 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:09:09,062 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:09:09,062 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:09:09,062 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:09:10,677 INFO  L124   PetriNetUnfolderBase]: 2270/3488 cut-off events.
[2024-06-03 21:09:10,677 INFO  L125   PetriNetUnfolderBase]: For 95175/95175 co-relation queries the response was YES.
[2024-06-03 21:09:10,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20933 conditions, 3488 events. 2270/3488 cut-off events. For 95175/95175 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17637 event pairs, 700 based on Foata normal form. 4/3489 useless extension candidates. Maximal degree in co-relation 20886. Up to 3218 conditions per place. 
[2024-06-03 21:09:10,695 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 120 selfloop transitions, 22 changer transitions 0/148 dead transitions.
[2024-06-03 21:09:10,696 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 148 transitions, 1384 flow
[2024-06-03 21:09:10,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:09:10,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:09:10,698 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-03 21:09:10,698 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4375
[2024-06-03 21:09:10,698 INFO  L175             Difference]: Start difference. First operand has 106 places, 119 transitions, 982 flow. Second operand 8 states and 154 transitions.
[2024-06-03 21:09:10,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 148 transitions, 1384 flow
[2024-06-03 21:09:10,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 148 transitions, 1324 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-03 21:09:10,759 INFO  L231             Difference]: Finished difference. Result has 108 places, 122 transitions, 1028 flow
[2024-06-03 21:09:10,760 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1028, PETRI_PLACES=108, PETRI_TRANSITIONS=122}
[2024-06-03 21:09:10,760 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places.
[2024-06-03 21:09:10,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 122 transitions, 1028 flow
[2024-06-03 21:09:10,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:09:10,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:09:10,761 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:09:10,761 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-03 21:09:10,761 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:09:10,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:09:10,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -25532592, now seen corresponding path program 4 times
[2024-06-03 21:09:10,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:09:10,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121468460]
[2024-06-03 21:09:10,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:09:10,762 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:09:10,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:09:22,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:09:22,244 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:09:22,244 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121468460]
[2024-06-03 21:09:22,244 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121468460] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:09:22,244 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:09:22,244 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:09:22,244 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280396698]
[2024-06-03 21:09:22,244 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:09:22,245 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:09:22,245 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:09:22,245 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:09:22,246 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:09:22,429 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:09:22,429 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 122 transitions, 1028 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:09:22,429 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:09:22,429 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:09:22,429 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:09:24,009 INFO  L124   PetriNetUnfolderBase]: 2265/3481 cut-off events.
[2024-06-03 21:09:24,010 INFO  L125   PetriNetUnfolderBase]: For 101237/101237 co-relation queries the response was YES.
[2024-06-03 21:09:24,019 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21167 conditions, 3481 events. 2265/3481 cut-off events. For 101237/101237 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17585 event pairs, 710 based on Foata normal form. 2/3480 useless extension candidates. Maximal degree in co-relation 21119. Up to 3261 conditions per place. 
[2024-06-03 21:09:24,031 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 123 selfloop transitions, 17 changer transitions 0/146 dead transitions.
[2024-06-03 21:09:24,032 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 146 transitions, 1372 flow
[2024-06-03 21:09:24,034 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:09:24,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:09:24,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-03 21:09:24,034 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42329545454545453
[2024-06-03 21:09:24,034 INFO  L175             Difference]: Start difference. First operand has 108 places, 122 transitions, 1028 flow. Second operand 8 states and 149 transitions.
[2024-06-03 21:09:24,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 146 transitions, 1372 flow
[2024-06-03 21:09:24,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 146 transitions, 1278 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-03 21:09:24,124 INFO  L231             Difference]: Finished difference. Result has 110 places, 123 transitions, 984 flow
[2024-06-03 21:09:24,125 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=984, PETRI_PLACES=110, PETRI_TRANSITIONS=123}
[2024-06-03 21:09:24,125 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 65 predicate places.
[2024-06-03 21:09:24,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 984 flow
[2024-06-03 21:09:24,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:09:24,126 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:09:24,126 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:09:24,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-03 21:09:24,126 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:09:24,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:09:24,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 327326616, now seen corresponding path program 6 times
[2024-06-03 21:09:24,127 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:09:24,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049671940]
[2024-06-03 21:09:24,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:09:24,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:09:24,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:09:36,567 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:09:36,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:09:36,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049671940]
[2024-06-03 21:09:36,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049671940] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:09:36,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:09:36,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:09:36,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521373217]
[2024-06-03 21:09:36,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:09:36,568 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:09:36,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:09:36,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:09:36,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:09:36,797 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:09:36,797 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 984 flow. Second operand  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:09:36,797 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:09:36,797 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:09:36,798 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:09:38,564 INFO  L124   PetriNetUnfolderBase]: 2255/3467 cut-off events.
[2024-06-03 21:09:38,564 INFO  L125   PetriNetUnfolderBase]: For 107568/107568 co-relation queries the response was YES.
[2024-06-03 21:09:38,572 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21161 conditions, 3467 events. 2255/3467 cut-off events. For 107568/107568 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 17528 event pairs, 698 based on Foata normal form. 4/3468 useless extension candidates. Maximal degree in co-relation 21112. Up to 3147 conditions per place. 
[2024-06-03 21:09:38,582 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 113 selfloop transitions, 30 changer transitions 0/149 dead transitions.
[2024-06-03 21:09:38,582 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 149 transitions, 1340 flow
[2024-06-03 21:09:38,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:09:38,584 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:09:38,585 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-03 21:09:38,585 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4403409090909091
[2024-06-03 21:09:38,585 INFO  L175             Difference]: Start difference. First operand has 110 places, 123 transitions, 984 flow. Second operand 8 states and 155 transitions.
[2024-06-03 21:09:38,585 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 149 transitions, 1340 flow
[2024-06-03 21:09:38,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 149 transitions, 1282 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-03 21:09:38,666 INFO  L231             Difference]: Finished difference. Result has 112 places, 123 transitions, 994 flow
[2024-06-03 21:09:38,666 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=112, PETRI_TRANSITIONS=123}
[2024-06-03 21:09:38,666 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 67 predicate places.
[2024-06-03 21:09:38,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 123 transitions, 994 flow
[2024-06-03 21:09:38,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:09:38,667 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:09:38,667 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:09:38,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-03 21:09:38,667 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:09:38,667 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:09:38,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -16943856, now seen corresponding path program 1 times
[2024-06-03 21:09:38,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:09:38,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102140705]
[2024-06-03 21:09:38,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:09:38,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:09:38,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:09:50,969 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:09:50,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:09:50,969 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102140705]
[2024-06-03 21:09:50,969 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102140705] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:09:50,969 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:09:50,969 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:09:50,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958819688]
[2024-06-03 21:09:50,969 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:09:50,970 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:09:50,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:09:50,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:09:50,970 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:09:51,166 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44
[2024-06-03 21:09:51,166 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 123 transitions, 994 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:09:51,166 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:09:51,166 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44
[2024-06-03 21:09:51,166 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:09:53,264 INFO  L124   PetriNetUnfolderBase]: 2673/4035 cut-off events.
[2024-06-03 21:09:53,264 INFO  L125   PetriNetUnfolderBase]: For 132662/132662 co-relation queries the response was YES.
[2024-06-03 21:09:53,274 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24607 conditions, 4035 events. 2673/4035 cut-off events. For 132662/132662 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19704 event pairs, 864 based on Foata normal form. 4/4036 useless extension candidates. Maximal degree in co-relation 24557. Up to 3827 conditions per place. 
[2024-06-03 21:09:53,288 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 129 selfloop transitions, 18 changer transitions 0/152 dead transitions.
[2024-06-03 21:09:53,288 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 152 transitions, 1411 flow
[2024-06-03 21:09:53,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:09:53,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:09:53,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-03 21:09:53,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40625
[2024-06-03 21:09:53,292 INFO  L175             Difference]: Start difference. First operand has 112 places, 123 transitions, 994 flow. Second operand 8 states and 143 transitions.
[2024-06-03 21:09:53,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 152 transitions, 1411 flow
[2024-06-03 21:09:53,386 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 152 transitions, 1270 flow, removed 13 selfloop flow, removed 8 redundant places.
[2024-06-03 21:09:53,388 INFO  L231             Difference]: Finished difference. Result has 113 places, 128 transitions, 969 flow
[2024-06-03 21:09:53,388 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=113, PETRI_TRANSITIONS=128}
[2024-06-03 21:09:53,389 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places.
[2024-06-03 21:09:53,389 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 969 flow
[2024-06-03 21:09:53,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 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:09:53,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:09:53,389 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:09:53,389 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-03 21:09:53,389 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:09:53,390 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:09:53,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 761732564, now seen corresponding path program 1 times
[2024-06-03 21:09:53,390 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:09:53,390 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842142457]
[2024-06-03 21:09:53,390 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:09:53,390 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:09:53,422 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:10:09,761 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:10:09,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:10:09,762 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842142457]
[2024-06-03 21:10:09,762 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842142457] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:10:09,762 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:10:09,762 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:10:09,762 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660417650]
[2024-06-03 21:10:09,762 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:10:09,763 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:10:09,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:10:09,763 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:10:09,763 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:10:09,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:10:09,910 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 969 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:09,910 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:10:09,910 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:10:09,910 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:10:11,618 INFO  L124   PetriNetUnfolderBase]: 2554/3917 cut-off events.
[2024-06-03 21:10:11,618 INFO  L125   PetriNetUnfolderBase]: For 137947/137947 co-relation queries the response was YES.
[2024-06-03 21:10:11,628 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23918 conditions, 3917 events. 2554/3917 cut-off events. For 137947/137947 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19426 event pairs, 934 based on Foata normal form. 3/3919 useless extension candidates. Maximal degree in co-relation 23867. Up to 3698 conditions per place. 
[2024-06-03 21:10:11,640 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 104 selfloop transitions, 11 changer transitions 0/142 dead transitions.
[2024-06-03 21:10:11,641 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 142 transitions, 1253 flow
[2024-06-03 21:10:11,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:10:11,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:10:11,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-03 21:10:11,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4166666666666667
[2024-06-03 21:10:11,642 INFO  L175             Difference]: Start difference. First operand has 113 places, 128 transitions, 969 flow. Second operand 6 states and 110 transitions.
[2024-06-03 21:10:11,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 142 transitions, 1253 flow
[2024-06-03 21:10:11,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 142 transitions, 1186 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-03 21:10:11,738 INFO  L231             Difference]: Finished difference. Result has 114 places, 131 transitions, 964 flow
[2024-06-03 21:10:11,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=964, PETRI_PLACES=114, PETRI_TRANSITIONS=131}
[2024-06-03 21:10:11,743 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 69 predicate places.
[2024-06-03 21:10:11,743 INFO  L495      AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 964 flow
[2024-06-03 21:10:11,743 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:11,744 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:10:11,744 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:10:11,744 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-03 21:10:11,744 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:10:11,744 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:10:11,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -1316388329, now seen corresponding path program 1 times
[2024-06-03 21:10:11,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:10:11,745 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046493012]
[2024-06-03 21:10:11,745 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:10:11,745 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:10:11,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:10:23,593 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:10:23,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:10:23,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046493012]
[2024-06-03 21:10:23,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046493012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:10:23,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:10:23,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:10:23,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028682714]
[2024-06-03 21:10:23,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:10:23,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:10:23,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:10:23,595 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:10:23,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:10:23,933 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:10:23,933 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 964 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:23,934 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:10:23,934 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:10:23,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:10:25,896 INFO  L124   PetriNetUnfolderBase]: 2556/3902 cut-off events.
[2024-06-03 21:10:25,897 INFO  L125   PetriNetUnfolderBase]: For 146071/146071 co-relation queries the response was YES.
[2024-06-03 21:10:25,911 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24688 conditions, 3902 events. 2556/3902 cut-off events. For 146071/146071 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19779 event pairs, 817 based on Foata normal form. 4/3895 useless extension candidates. Maximal degree in co-relation 24636. Up to 3634 conditions per place. 
[2024-06-03 21:10:25,929 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 144 selfloop transitions, 20 changer transitions 0/171 dead transitions.
[2024-06-03 21:10:25,929 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 171 transitions, 1434 flow
[2024-06-03 21:10:25,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:10:25,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:10:25,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-03 21:10:25,932 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4444444444444444
[2024-06-03 21:10:25,932 INFO  L175             Difference]: Start difference. First operand has 114 places, 131 transitions, 964 flow. Second operand 9 states and 176 transitions.
[2024-06-03 21:10:25,933 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 171 transitions, 1434 flow
[2024-06-03 21:10:26,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 171 transitions, 1394 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-03 21:10:26,028 INFO  L231             Difference]: Finished difference. Result has 119 places, 134 transitions, 1024 flow
[2024-06-03 21:10:26,028 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1024, PETRI_PLACES=119, PETRI_TRANSITIONS=134}
[2024-06-03 21:10:26,029 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 74 predicate places.
[2024-06-03 21:10:26,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 134 transitions, 1024 flow
[2024-06-03 21:10:26,029 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:26,029 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:10:26,029 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:10:26,029 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-03 21:10:26,029 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:10:26,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:10:26,030 INFO  L85        PathProgramCache]: Analyzing trace with hash -1312663679, now seen corresponding path program 2 times
[2024-06-03 21:10:26,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:10:26,030 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643421412]
[2024-06-03 21:10:26,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:10:26,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:10:26,081 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:10:35,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:10:35,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:10:35,475 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643421412]
[2024-06-03 21:10:35,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643421412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:10:35,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:10:35,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:10:35,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364953094]
[2024-06-03 21:10:35,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:10:35,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:10:35,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:10:35,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:10:35,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:10:35,764 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:10:35,765 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 134 transitions, 1024 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:35,765 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:10:35,765 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:10:35,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:10:37,789 INFO  L124   PetriNetUnfolderBase]: 2705/4117 cut-off events.
[2024-06-03 21:10:37,789 INFO  L125   PetriNetUnfolderBase]: For 164563/164565 co-relation queries the response was YES.
[2024-06-03 21:10:37,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27063 conditions, 4117 events. 2705/4117 cut-off events. For 164563/164565 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 20965 event pairs, 756 based on Foata normal form. 8/4115 useless extension candidates. Maximal degree in co-relation 27010. Up to 3268 conditions per place. 
[2024-06-03 21:10:37,812 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 111 selfloop transitions, 75 changer transitions 0/193 dead transitions.
[2024-06-03 21:10:37,812 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 193 transitions, 2094 flow
[2024-06-03 21:10:37,814 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:10:37,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:10:37,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-03 21:10:37,815 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49242424242424243
[2024-06-03 21:10:37,815 INFO  L175             Difference]: Start difference. First operand has 119 places, 134 transitions, 1024 flow. Second operand 9 states and 195 transitions.
[2024-06-03 21:10:37,815 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 193 transitions, 2094 flow
[2024-06-03 21:10:37,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 193 transitions, 2014 flow, removed 20 selfloop flow, removed 7 redundant places.
[2024-06-03 21:10:37,912 INFO  L231             Difference]: Finished difference. Result has 122 places, 146 transitions, 1337 flow
[2024-06-03 21:10:37,913 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1337, PETRI_PLACES=122, PETRI_TRANSITIONS=146}
[2024-06-03 21:10:37,913 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 77 predicate places.
[2024-06-03 21:10:37,913 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 146 transitions, 1337 flow
[2024-06-03 21:10:37,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:37,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:10:37,913 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:10:37,914 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-03 21:10:37,914 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:10:37,914 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:10:37,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056188496, now seen corresponding path program 1 times
[2024-06-03 21:10:37,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:10:37,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992013332]
[2024-06-03 21:10:37,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:10:37,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:10:37,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:10:50,010 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:10:50,010 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:10:50,011 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992013332]
[2024-06-03 21:10:50,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992013332] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:10:50,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:10:50,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:10:50,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883587677]
[2024-06-03 21:10:50,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:10:50,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:10:50,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:10:50,012 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:10:50,012 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:10:50,268 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:10:50,268 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 146 transitions, 1337 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:50,268 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:10:50,269 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:10:50,269 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:10:52,190 INFO  L124   PetriNetUnfolderBase]: 2727/4157 cut-off events.
[2024-06-03 21:10:52,191 INFO  L125   PetriNetUnfolderBase]: For 177688/177690 co-relation queries the response was YES.
[2024-06-03 21:10:52,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28486 conditions, 4157 events. 2727/4157 cut-off events. For 177688/177690 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21379 event pairs, 792 based on Foata normal form. 4/4152 useless extension candidates. Maximal degree in co-relation 28431. Up to 3809 conditions per place. 
[2024-06-03 21:10:52,215 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 130 selfloop transitions, 42 changer transitions 0/179 dead transitions.
[2024-06-03 21:10:52,215 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 179 transitions, 1765 flow
[2024-06-03 21:10:52,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:10:52,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:10:52,218 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-03 21:10:52,218 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44696969696969696
[2024-06-03 21:10:52,218 INFO  L175             Difference]: Start difference. First operand has 122 places, 146 transitions, 1337 flow. Second operand 9 states and 177 transitions.
[2024-06-03 21:10:52,218 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 179 transitions, 1765 flow
[2024-06-03 21:10:52,350 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 179 transitions, 1650 flow, removed 42 selfloop flow, removed 3 redundant places.
[2024-06-03 21:10:52,352 INFO  L231             Difference]: Finished difference. Result has 128 places, 146 transitions, 1314 flow
[2024-06-03 21:10:52,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1314, PETRI_PLACES=128, PETRI_TRANSITIONS=146}
[2024-06-03 21:10:52,353 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 83 predicate places.
[2024-06-03 21:10:52,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 146 transitions, 1314 flow
[2024-06-03 21:10:52,353 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:10:52,353 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:10: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:10:52,354 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-03 21:10:52,354 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:10:52,354 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:10:52,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1312669259, now seen corresponding path program 3 times
[2024-06-03 21:10:52,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:10:52,354 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317387387]
[2024-06-03 21:10:52,354 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:10:52,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:10:52,409 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:11:02,600 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:11:02,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:11:02,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317387387]
[2024-06-03 21:11:02,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317387387] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:11:02,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:11:02,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:11:02,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418757215]
[2024-06-03 21:11:02,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:11:02,601 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:11:02,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:11:02,601 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:11:02,601 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:11:02,835 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:11:02,835 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 146 transitions, 1314 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:02,836 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:11:02,836 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:11:02,836 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:11:04,719 INFO  L124   PetriNetUnfolderBase]: 2686/4092 cut-off events.
[2024-06-03 21:11:04,719 INFO  L125   PetriNetUnfolderBase]: For 183071/183073 co-relation queries the response was YES.
[2024-06-03 21:11:04,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28076 conditions, 4092 events. 2686/4092 cut-off events. For 183071/183073 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 20883 event pairs, 762 based on Foata normal form. 4/4086 useless extension candidates. Maximal degree in co-relation 28019. Up to 3434 conditions per place. 
[2024-06-03 21:11:04,743 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 119 selfloop transitions, 69 changer transitions 0/195 dead transitions.
[2024-06-03 21:11:04,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 195 transitions, 2044 flow
[2024-06-03 21:11:04,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:11:04,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:11:04,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-03 21:11:04,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4772727272727273
[2024-06-03 21:11:04,745 INFO  L175             Difference]: Start difference. First operand has 128 places, 146 transitions, 1314 flow. Second operand 9 states and 189 transitions.
[2024-06-03 21:11:04,745 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 195 transitions, 2044 flow
[2024-06-03 21:11:04,860 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 195 transitions, 1933 flow, removed 8 selfloop flow, removed 8 redundant places.
[2024-06-03 21:11:04,863 INFO  L231             Difference]: Finished difference. Result has 131 places, 155 transitions, 1527 flow
[2024-06-03 21:11:04,863 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1527, PETRI_PLACES=131, PETRI_TRANSITIONS=155}
[2024-06-03 21:11:04,863 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 86 predicate places.
[2024-06-03 21:11:04,863 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 1527 flow
[2024-06-03 21:11:04,863 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:04,864 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:11:04,864 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:11:04,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-03 21:11:04,864 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:11:04,864 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:11:04,864 INFO  L85        PathProgramCache]: Analyzing trace with hash -1816762103, now seen corresponding path program 4 times
[2024-06-03 21:11:04,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:11:04,865 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292718906]
[2024-06-03 21:11:04,865 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:11:04,865 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:11:04,912 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:11:16,555 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:11:16,555 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:11:16,555 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292718906]
[2024-06-03 21:11:16,555 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292718906] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:11:16,556 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:11:16,556 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:11:16,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288603909]
[2024-06-03 21:11:16,556 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:11:16,556 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:11:16,556 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:11:16,557 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:11:16,557 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:11:16,785 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:11:16,787 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 155 transitions, 1527 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:16,787 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:11:16,788 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:11:16,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:11:18,642 INFO  L124   PetriNetUnfolderBase]: 2739/4174 cut-off events.
[2024-06-03 21:11:18,643 INFO  L125   PetriNetUnfolderBase]: For 197854/197856 co-relation queries the response was YES.
[2024-06-03 21:11:18,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29573 conditions, 4174 events. 2739/4174 cut-off events. For 197854/197856 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21512 event pairs, 737 based on Foata normal form. 4/4166 useless extension candidates. Maximal degree in co-relation 29513. Up to 3811 conditions per place. 
[2024-06-03 21:11:18,667 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 151 selfloop transitions, 34 changer transitions 0/192 dead transitions.
[2024-06-03 21:11:18,667 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 192 transitions, 2050 flow
[2024-06-03 21:11:18,669 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:11:18,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:11:18,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-03 21:11:18,670 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44696969696969696
[2024-06-03 21:11:18,670 INFO  L175             Difference]: Start difference. First operand has 131 places, 155 transitions, 1527 flow. Second operand 9 states and 177 transitions.
[2024-06-03 21:11:18,670 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 192 transitions, 2050 flow
[2024-06-03 21:11:18,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 192 transitions, 1955 flow, removed 26 selfloop flow, removed 4 redundant places.
[2024-06-03 21:11:18,782 INFO  L231             Difference]: Finished difference. Result has 136 places, 158 transitions, 1575 flow
[2024-06-03 21:11:18,782 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1575, PETRI_PLACES=136, PETRI_TRANSITIONS=158}
[2024-06-03 21:11:18,783 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 91 predicate places.
[2024-06-03 21:11:18,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 136 places, 158 transitions, 1575 flow
[2024-06-03 21:11:18,783 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:18,783 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:11:18,783 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:11:18,783 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-03 21:11:18,783 INFO  L420      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:11:18,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:11:18,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -1816963913, now seen corresponding path program 5 times
[2024-06-03 21:11:18,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:11:18,784 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316868953]
[2024-06-03 21:11:18,784 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:11:18,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:11:18,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:11:30,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:11:30,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:11:30,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316868953]
[2024-06-03 21:11:30,071 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316868953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:11:30,071 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:11:30,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:11:30,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272441298]
[2024-06-03 21:11:30,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:11:30,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:11:30,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:11:30,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:11:30,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:11:30,377 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:11:30,377 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 158 transitions, 1575 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:30,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:11:30,378 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:11:30,378 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:11:32,299 INFO  L124   PetriNetUnfolderBase]: 2762/4207 cut-off events.
[2024-06-03 21:11:32,300 INFO  L125   PetriNetUnfolderBase]: For 209242/209244 co-relation queries the response was YES.
[2024-06-03 21:11:32,313 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30226 conditions, 4207 events. 2762/4207 cut-off events. For 209242/209244 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 21638 event pairs, 799 based on Foata normal form. 4/4201 useless extension candidates. Maximal degree in co-relation 30164. Up to 3769 conditions per place. 
[2024-06-03 21:11:32,328 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 148 selfloop transitions, 46 changer transitions 0/201 dead transitions.
[2024-06-03 21:11:32,329 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 201 transitions, 2321 flow
[2024-06-03 21:11:32,331 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:11:32,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:11:32,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-03 21:11:32,331 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46464646464646464
[2024-06-03 21:11:32,331 INFO  L175             Difference]: Start difference. First operand has 136 places, 158 transitions, 1575 flow. Second operand 9 states and 184 transitions.
[2024-06-03 21:11:32,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 201 transitions, 2321 flow
[2024-06-03 21:11:32,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 201 transitions, 2209 flow, removed 24 selfloop flow, removed 7 redundant places.
[2024-06-03 21:11:32,500 INFO  L231             Difference]: Finished difference. Result has 138 places, 164 transitions, 1699 flow
[2024-06-03 21:11:32,501 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1699, PETRI_PLACES=138, PETRI_TRANSITIONS=164}
[2024-06-03 21:11:32,501 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 93 predicate places.
[2024-06-03 21:11:32,501 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 164 transitions, 1699 flow
[2024-06-03 21:11:32,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:32,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:11:32,501 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:11:32,502 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-03 21:11:32,502 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:11:32,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:11:32,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -1816969493, now seen corresponding path program 6 times
[2024-06-03 21:11:32,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:11:32,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786128463]
[2024-06-03 21:11:32,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:11:32,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:11:32,553 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:11:45,432 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:11:45,432 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:11:45,432 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786128463]
[2024-06-03 21:11:45,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786128463] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:11:45,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:11:45,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:11:45,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684527224]
[2024-06-03 21:11:45,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:11:45,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:11:45,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:11:45,433 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:11:45,433 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:11:45,646 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:11:45,646 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 164 transitions, 1699 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:45,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:11:45,647 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:11:45,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:11:47,624 INFO  L124   PetriNetUnfolderBase]: 2752/4193 cut-off events.
[2024-06-03 21:11:47,624 INFO  L125   PetriNetUnfolderBase]: For 218400/218402 co-relation queries the response was YES.
[2024-06-03 21:11:47,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30340 conditions, 4193 events. 2752/4193 cut-off events. For 218400/218402 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 21544 event pairs, 804 based on Foata normal form. 4/4187 useless extension candidates. Maximal degree in co-relation 30277. Up to 3761 conditions per place. 
[2024-06-03 21:11:47,653 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 145 selfloop transitions, 47 changer transitions 0/199 dead transitions.
[2024-06-03 21:11:47,654 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 199 transitions, 2179 flow
[2024-06-03 21:11:47,656 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:11:47,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:11:47,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions.
[2024-06-03 21:11:47,657 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45707070707070707
[2024-06-03 21:11:47,657 INFO  L175             Difference]: Start difference. First operand has 138 places, 164 transitions, 1699 flow. Second operand 9 states and 181 transitions.
[2024-06-03 21:11:47,657 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 199 transitions, 2179 flow
[2024-06-03 21:11:47,814 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 199 transitions, 2052 flow, removed 47 selfloop flow, removed 4 redundant places.
[2024-06-03 21:11:47,816 INFO  L231             Difference]: Finished difference. Result has 143 places, 164 transitions, 1674 flow
[2024-06-03 21:11:47,817 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1674, PETRI_PLACES=143, PETRI_TRANSITIONS=164}
[2024-06-03 21:11:47,817 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places.
[2024-06-03 21:11:47,817 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 164 transitions, 1674 flow
[2024-06-03 21:11:47,817 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:11:47,817 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:11:47,818 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:11:47,818 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-03 21:11:47,818 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:11:47,819 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:11:47,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 795656043, now seen corresponding path program 1 times
[2024-06-03 21:11:47,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:11:47,820 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79069489]
[2024-06-03 21:11:47,820 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:11:47,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:11:47,858 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:12:01,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:12:01,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:12:01,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79069489]
[2024-06-03 21:12:01,680 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79069489] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:12:01,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:12:01,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:12:01,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245017006]
[2024-06-03 21:12:01,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:12:01,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:12:01,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:12:01,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:12:01,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:12:01,847 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:12:01,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 164 transitions, 1674 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:01,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:12:01,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:12:01,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:12:03,679 INFO  L124   PetriNetUnfolderBase]: 2824/4297 cut-off events.
[2024-06-03 21:12:03,679 INFO  L125   PetriNetUnfolderBase]: For 236689/236716 co-relation queries the response was YES.
[2024-06-03 21:12:03,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31391 conditions, 4297 events. 2824/4297 cut-off events. For 236689/236716 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21624 event pairs, 942 based on Foata normal form. 21/4284 useless extension candidates. Maximal degree in co-relation 31326. Up to 4052 conditions per place. 
[2024-06-03 21:12:03,713 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 142 selfloop transitions, 17 changer transitions 0/187 dead transitions.
[2024-06-03 21:12:03,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 187 transitions, 2160 flow
[2024-06-03 21:12:03,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:12:03,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:12:03,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-03 21:12:03,716 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42207792207792205
[2024-06-03 21:12:03,716 INFO  L175             Difference]: Start difference. First operand has 143 places, 164 transitions, 1674 flow. Second operand 7 states and 130 transitions.
[2024-06-03 21:12:03,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 187 transitions, 2160 flow
[2024-06-03 21:12:03,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 187 transitions, 2068 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-03 21:12:03,913 INFO  L231             Difference]: Finished difference. Result has 143 places, 170 transitions, 1684 flow
[2024-06-03 21:12:03,914 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1684, PETRI_PLACES=143, PETRI_TRANSITIONS=170}
[2024-06-03 21:12:03,914 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places.
[2024-06-03 21:12:03,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 170 transitions, 1684 flow
[2024-06-03 21:12:03,914 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:03,914 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:12:03,914 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:12:03,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-03 21:12:03,915 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:12:03,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:12:03,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -791301879, now seen corresponding path program 7 times
[2024-06-03 21:12:03,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:12:03,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058069609]
[2024-06-03 21:12:03,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:12:03,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:12:03,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:12:15,923 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:12:15,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:12:15,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058069609]
[2024-06-03 21:12:15,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058069609] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:12:15,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:12:15,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:12:15,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688700571]
[2024-06-03 21:12:15,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:12:15,926 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:12:15,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:12:15,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:12:15,927 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:12:16,118 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:12:16,118 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 170 transitions, 1684 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:16,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:12:16,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:12:16,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:12:18,158 INFO  L124   PetriNetUnfolderBase]: 2819/4284 cut-off events.
[2024-06-03 21:12:18,159 INFO  L125   PetriNetUnfolderBase]: For 246787/246799 co-relation queries the response was YES.
[2024-06-03 21:12:18,173 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31880 conditions, 4284 events. 2819/4284 cut-off events. For 246787/246799 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 22015 event pairs, 839 based on Foata normal form. 4/4274 useless extension candidates. Maximal degree in co-relation 31814. Up to 3967 conditions per place. 
[2024-06-03 21:12:18,192 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 168 selfloop transitions, 27 changer transitions 0/204 dead transitions.
[2024-06-03 21:12:18,192 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 204 transitions, 2229 flow
[2024-06-03 21:12:18,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:12:18,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:12:18,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions.
[2024-06-03 21:12:18,195 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43434343434343436
[2024-06-03 21:12:18,195 INFO  L175             Difference]: Start difference. First operand has 143 places, 170 transitions, 1684 flow. Second operand 9 states and 172 transitions.
[2024-06-03 21:12:18,195 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 204 transitions, 2229 flow
[2024-06-03 21:12:18,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 204 transitions, 2197 flow, removed 11 selfloop flow, removed 3 redundant places.
[2024-06-03 21:12:18,398 INFO  L231             Difference]: Finished difference. Result has 149 places, 173 transitions, 1791 flow
[2024-06-03 21:12:18,398 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1652, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1791, PETRI_PLACES=149, PETRI_TRANSITIONS=173}
[2024-06-03 21:12:18,399 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 104 predicate places.
[2024-06-03 21:12:18,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 173 transitions, 1791 flow
[2024-06-03 21:12:18,399 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:18,399 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:12:18,399 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:12:18,399 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-03 21:12:18,399 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:12:18,400 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:12:18,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 1557191401, now seen corresponding path program 8 times
[2024-06-03 21:12:18,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:12:18,400 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604099263]
[2024-06-03 21:12:18,400 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:12:18,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:12:18,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:12:32,136 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:12:32,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:12:32,136 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604099263]
[2024-06-03 21:12:32,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604099263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:12:32,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:12:32,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:12:32,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459045614]
[2024-06-03 21:12:32,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:12:32,137 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:12:32,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:12:32,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:12:32,137 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:12:32,334 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:12:32,334 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 173 transitions, 1791 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:32,334 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:12:32,334 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:12:32,335 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:12:34,615 INFO  L124   PetriNetUnfolderBase]: 2899/4412 cut-off events.
[2024-06-03 21:12:34,615 INFO  L125   PetriNetUnfolderBase]: For 267632/267644 co-relation queries the response was YES.
[2024-06-03 21:12:34,630 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33732 conditions, 4412 events. 2899/4412 cut-off events. For 267632/267644 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 22929 event pairs, 762 based on Foata normal form. 4/4400 useless extension candidates. Maximal degree in co-relation 33664. Up to 3924 conditions per place. 
[2024-06-03 21:12:34,649 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 161 selfloop transitions, 44 changer transitions 0/214 dead transitions.
[2024-06-03 21:12:34,649 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 214 transitions, 2731 flow
[2024-06-03 21:12:34,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:12:34,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:12:34,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-03 21:12:34,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-03 21:12:34,652 INFO  L175             Difference]: Start difference. First operand has 149 places, 173 transitions, 1791 flow. Second operand 9 states and 179 transitions.
[2024-06-03 21:12:34,652 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 214 transitions, 2731 flow
[2024-06-03 21:12:34,809 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 214 transitions, 2629 flow, removed 26 selfloop flow, removed 7 redundant places.
[2024-06-03 21:12:34,812 INFO  L231             Difference]: Finished difference. Result has 151 places, 179 transitions, 1939 flow
[2024-06-03 21:12:34,812 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1689, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1939, PETRI_PLACES=151, PETRI_TRANSITIONS=179}
[2024-06-03 21:12:34,812 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 106 predicate places.
[2024-06-03 21:12:34,812 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 179 transitions, 1939 flow
[2024-06-03 21:12:34,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:34,813 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:12:34,813 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:12:34,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-03 21:12:34,813 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:12:34,813 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:12:34,813 INFO  L85        PathProgramCache]: Analyzing trace with hash -116559435, now seen corresponding path program 9 times
[2024-06-03 21:12:34,813 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:12:34,814 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319845977]
[2024-06-03 21:12:34,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:12:34,814 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:12:34,868 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:12:45,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:12:45,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:12:45,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319845977]
[2024-06-03 21:12:45,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319845977] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:12:45,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:12:45,820 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:12:45,820 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109058453]
[2024-06-03 21:12:45,820 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:12:45,820 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:12:45,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:12:45,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:12:45,821 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:12:46,085 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:12:46,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 179 transitions, 1939 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:46,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:12:46,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:12:46,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:12:48,125 INFO  L124   PetriNetUnfolderBase]: 2923/4448 cut-off events.
[2024-06-03 21:12:48,126 INFO  L125   PetriNetUnfolderBase]: For 280746/280758 co-relation queries the response was YES.
[2024-06-03 21:12:48,140 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34039 conditions, 4448 events. 2923/4448 cut-off events. For 280746/280758 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 23106 event pairs, 832 based on Foata normal form. 8/4442 useless extension candidates. Maximal degree in co-relation 33970. Up to 3894 conditions per place. 
[2024-06-03 21:12:48,155 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 162 selfloop transitions, 48 changer transitions 0/219 dead transitions.
[2024-06-03 21:12:48,155 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 219 transitions, 2725 flow
[2024-06-03 21:12:48,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:12:48,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:12:48,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions.
[2024-06-03 21:12:48,158 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4494949494949495
[2024-06-03 21:12:48,158 INFO  L175             Difference]: Start difference. First operand has 151 places, 179 transitions, 1939 flow. Second operand 9 states and 178 transitions.
[2024-06-03 21:12:48,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 219 transitions, 2725 flow
[2024-06-03 21:12:48,328 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 219 transitions, 2466 flow, removed 59 selfloop flow, removed 7 redundant places.
[2024-06-03 21:12:48,330 INFO  L231             Difference]: Finished difference. Result has 154 places, 186 transitions, 1943 flow
[2024-06-03 21:12:48,331 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1680, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1943, PETRI_PLACES=154, PETRI_TRANSITIONS=186}
[2024-06-03 21:12:48,331 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places.
[2024-06-03 21:12:48,331 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 186 transitions, 1943 flow
[2024-06-03 21:12:48,331 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:12:48,331 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:12:48,331 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:12:48,332 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-03 21:12:48,332 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:12:48,332 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:12:48,332 INFO  L85        PathProgramCache]: Analyzing trace with hash -116559590, now seen corresponding path program 2 times
[2024-06-03 21:12:48,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:12:48,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217458876]
[2024-06-03 21:12:48,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:12:48,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:12:48,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:13:00,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:13:00,701 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:13:00,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217458876]
[2024-06-03 21:13:00,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217458876] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:13:00,702 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:13:00,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:13:00,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551336908]
[2024-06-03 21:13:00,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:13:00,702 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:13:00,703 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:13:00,703 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:13:00,703 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:13:01,021 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:13:01,022 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 186 transitions, 1943 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:01,022 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:13:01,022 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:13:01,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:13:03,097 INFO  L124   PetriNetUnfolderBase]: 2936/4467 cut-off events.
[2024-06-03 21:13:03,097 INFO  L125   PetriNetUnfolderBase]: For 291738/291750 co-relation queries the response was YES.
[2024-06-03 21:13:03,113 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34491 conditions, 4467 events. 2936/4467 cut-off events. For 291738/291750 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 23282 event pairs, 803 based on Foata normal form. 2/4453 useless extension candidates. Maximal degree in co-relation 34421. Up to 4207 conditions per place. 
[2024-06-03 21:13:03,132 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 186 selfloop transitions, 20 changer transitions 0/215 dead transitions.
[2024-06-03 21:13:03,132 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 215 transitions, 2475 flow
[2024-06-03 21:13:03,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:13:03,135 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:13:03,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions.
[2024-06-03 21:13:03,135 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.41919191919191917
[2024-06-03 21:13:03,135 INFO  L175             Difference]: Start difference. First operand has 154 places, 186 transitions, 1943 flow. Second operand 9 states and 166 transitions.
[2024-06-03 21:13:03,135 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 215 transitions, 2475 flow
[2024-06-03 21:13:03,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 215 transitions, 2364 flow, removed 36 selfloop flow, removed 5 redundant places.
[2024-06-03 21:13:03,347 INFO  L231             Difference]: Finished difference. Result has 158 places, 188 transitions, 1936 flow
[2024-06-03 21:13:03,347 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1838, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1936, PETRI_PLACES=158, PETRI_TRANSITIONS=188}
[2024-06-03 21:13:03,347 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 113 predicate places.
[2024-06-03 21:13:03,348 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 188 transitions, 1936 flow
[2024-06-03 21:13:03,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:03,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:13:03,348 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:13:03,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-03 21:13:03,348 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:13:03,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:13:03,349 INFO  L85        PathProgramCache]: Analyzing trace with hash -525270233, now seen corresponding path program 1 times
[2024-06-03 21:13:03,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:13:03,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366427800]
[2024-06-03 21:13:03,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:13:03,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:13:03,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:13:13,736 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:13:13,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:13:13,737 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366427800]
[2024-06-03 21:13:13,737 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366427800] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:13:13,737 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:13:13,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:13:13,737 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215386576]
[2024-06-03 21:13:13,737 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:13:13,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:13:13,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:13:13,738 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:13:13,738 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:13:13,943 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44
[2024-06-03 21:13:13,944 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 188 transitions, 1936 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:13,944 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:13:13,944 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44
[2024-06-03 21:13:13,944 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:13:16,096 INFO  L124   PetriNetUnfolderBase]: 3207/4796 cut-off events.
[2024-06-03 21:13:16,096 INFO  L125   PetriNetUnfolderBase]: For 304609/304609 co-relation queries the response was YES.
[2024-06-03 21:13:16,176 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36322 conditions, 4796 events. 3207/4796 cut-off events. For 304609/304609 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 23769 event pairs, 968 based on Foata normal form. 2/4793 useless extension candidates. Maximal degree in co-relation 36250. Up to 4584 conditions per place. 
[2024-06-03 21:13:16,194 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 189 selfloop transitions, 22 changer transitions 0/218 dead transitions.
[2024-06-03 21:13:16,195 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 218 transitions, 2506 flow
[2024-06-03 21:13:16,197 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:13:16,197 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:13:16,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions.
[2024-06-03 21:13:16,197 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4090909090909091
[2024-06-03 21:13:16,197 INFO  L175             Difference]: Start difference. First operand has 158 places, 188 transitions, 1936 flow. Second operand 8 states and 144 transitions.
[2024-06-03 21:13:16,198 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 218 transitions, 2506 flow
[2024-06-03 21:13:16,423 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 218 transitions, 2428 flow, removed 21 selfloop flow, removed 7 redundant places.
[2024-06-03 21:13:16,425 INFO  L231             Difference]: Finished difference. Result has 159 places, 194 transitions, 2012 flow
[2024-06-03 21:13:16,425 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2012, PETRI_PLACES=159, PETRI_TRANSITIONS=194}
[2024-06-03 21:13:16,426 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 114 predicate places.
[2024-06-03 21:13:16,426 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 194 transitions, 2012 flow
[2024-06-03 21:13:16,426 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:16,426 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:13:16,426 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:13:16,426 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-03 21:13:16,427 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:13:16,427 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:13:16,427 INFO  L85        PathProgramCache]: Analyzing trace with hash -534801369, now seen corresponding path program 10 times
[2024-06-03 21:13:16,427 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:13:16,427 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056915262]
[2024-06-03 21:13:16,427 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:13:16,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:13:16,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:13:29,089 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:13:29,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:13:29,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056915262]
[2024-06-03 21:13:29,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056915262] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:13:29,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:13:29,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:13:29,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750071950]
[2024-06-03 21:13:29,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:13:29,091 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:13:29,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:13:29,092 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:13:29,092 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:13:29,379 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:13:29,380 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 194 transitions, 2012 flow. Second operand  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:29,380 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:13:29,380 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:13:29,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:13:31,391 INFO  L124   PetriNetUnfolderBase]: 2912/4437 cut-off events.
[2024-06-03 21:13:31,392 INFO  L125   PetriNetUnfolderBase]: For 309990/309990 co-relation queries the response was YES.
[2024-06-03 21:13:31,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34718 conditions, 4437 events. 2912/4437 cut-off events. For 309990/309990 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23172 event pairs, 764 based on Foata normal form. 6/4436 useless extension candidates. Maximal degree in co-relation 34645. Up to 4087 conditions per place. 
[2024-06-03 21:13:31,422 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 190 selfloop transitions, 25 changer transitions 0/224 dead transitions.
[2024-06-03 21:13:31,422 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 224 transitions, 2522 flow
[2024-06-03 21:13:31,425 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:13:31,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:13:31,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-03 21:13:31,425 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42676767676767674
[2024-06-03 21:13:31,425 INFO  L175             Difference]: Start difference. First operand has 159 places, 194 transitions, 2012 flow. Second operand 9 states and 169 transitions.
[2024-06-03 21:13:31,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 224 transitions, 2522 flow
[2024-06-03 21:13:31,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 224 transitions, 2412 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-03 21:13:31,654 INFO  L231             Difference]: Finished difference. Result has 162 places, 194 transitions, 1960 flow
[2024-06-03 21:13:31,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1960, PETRI_PLACES=162, PETRI_TRANSITIONS=194}
[2024-06-03 21:13:31,655 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 117 predicate places.
[2024-06-03 21:13:31,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 1960 flow
[2024-06-03 21:13:31,655 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:31,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:13:31,655 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:13:31,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-03 21:13:31,656 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:13:31,656 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:13:31,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 808988523, now seen corresponding path program 2 times
[2024-06-03 21:13:31,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:13:31,656 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161363235]
[2024-06-03 21:13:31,656 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:13:31,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:13:31,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:13:44,851 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:13:44,852 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:13:44,852 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161363235]
[2024-06-03 21:13:44,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161363235] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:13:44,852 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:13:44,852 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:13:44,852 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282311840]
[2024-06-03 21:13:44,852 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:13:44,852 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:13:44,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:13:44,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:13:44,853 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:13:45,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:13:45,009 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 194 transitions, 1960 flow. Second operand  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:45,009 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:13:45,009 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:13:45,009 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:13:46,798 INFO  L124   PetriNetUnfolderBase]: 2969/4517 cut-off events.
[2024-06-03 21:13:46,798 INFO  L125   PetriNetUnfolderBase]: For 326007/326044 co-relation queries the response was YES.
[2024-06-03 21:13:46,815 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35351 conditions, 4517 events. 2969/4517 cut-off events. For 326007/326044 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 23028 event pairs, 936 based on Foata normal form. 26/4504 useless extension candidates. Maximal degree in co-relation 35277. Up to 4279 conditions per place. 
[2024-06-03 21:13:46,831 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 163 selfloop transitions, 11 changer transitions 0/203 dead transitions.
[2024-06-03 21:13:46,831 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 203 transitions, 2330 flow
[2024-06-03 21:13:46,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:13:46,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:13:46,832 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions.
[2024-06-03 21:13:46,832 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4090909090909091
[2024-06-03 21:13:46,832 INFO  L175             Difference]: Start difference. First operand has 162 places, 194 transitions, 1960 flow. Second operand 6 states and 108 transitions.
[2024-06-03 21:13:46,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 203 transitions, 2330 flow
[2024-06-03 21:13:47,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 203 transitions, 2241 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-06-03 21:13:47,147 INFO  L231             Difference]: Finished difference. Result has 160 places, 194 transitions, 1899 flow
[2024-06-03 21:13:47,147 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1899, PETRI_PLACES=160, PETRI_TRANSITIONS=194}
[2024-06-03 21:13:47,147 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 115 predicate places.
[2024-06-03 21:13:47,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 194 transitions, 1899 flow
[2024-06-03 21:13:47,147 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:13:47,148 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:13:47,148 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:13:47,148 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-03 21:13:47,148 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:13:47,148 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:13:47,148 INFO  L85        PathProgramCache]: Analyzing trace with hash 802329227, now seen corresponding path program 1 times
[2024-06-03 21:13:47,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:13:47,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153649263]
[2024-06-03 21:13:47,149 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:13:47,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:13:47,180 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:14:02,785 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:14:02,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:14:02,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153649263]
[2024-06-03 21:14:02,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153649263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:14:02,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:14:02,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:14:02,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313463927]
[2024-06-03 21:14:02,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:14:02,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:14:02,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:14:02,786 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:14:02,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:14:02,913 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44
[2024-06-03 21:14:02,914 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 194 transitions, 1899 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:14:02,914 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:14:02,914 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44
[2024-06-03 21:14:02,914 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:14:04,970 INFO  L124   PetriNetUnfolderBase]: 3397/4989 cut-off events.
[2024-06-03 21:14:04,970 INFO  L125   PetriNetUnfolderBase]: For 340206/340206 co-relation queries the response was YES.
[2024-06-03 21:14:04,987 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38004 conditions, 4989 events. 3397/4989 cut-off events. For 340206/340206 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 23946 event pairs, 1034 based on Foata normal form. 1/4989 useless extension candidates. Maximal degree in co-relation 37929. Up to 4957 conditions per place. 
[2024-06-03 21:14:05,002 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 195 selfloop transitions, 17 changer transitions 0/215 dead transitions.
[2024-06-03 21:14:05,002 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 215 transitions, 2521 flow
[2024-06-03 21:14:05,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:14:05,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:14:05,003 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions.
[2024-06-03 21:14:05,003 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.35795454545454547
[2024-06-03 21:14:05,004 INFO  L175             Difference]: Start difference. First operand has 160 places, 194 transitions, 1899 flow. Second operand 8 states and 126 transitions.
[2024-06-03 21:14:05,004 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 215 transitions, 2521 flow
[2024-06-03 21:14:05,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 215 transitions, 2487 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-06-03 21:14:05,332 INFO  L231             Difference]: Finished difference. Result has 163 places, 200 transitions, 1987 flow
[2024-06-03 21:14:05,332 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1865, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1987, PETRI_PLACES=163, PETRI_TRANSITIONS=200}
[2024-06-03 21:14:05,333 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 118 predicate places.
[2024-06-03 21:14:05,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 200 transitions, 1987 flow
[2024-06-03 21:14:05,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:14:05,333 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:14:05,333 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:14:05,333 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-03 21:14:05,334 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 21:14:05,334 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:14:05,334 INFO  L85        PathProgramCache]: Analyzing trace with hash 808995467, now seen corresponding path program 2 times
[2024-06-03 21:14:05,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:14:05,334 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842367980]
[2024-06-03 21:14:05,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:14:05,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:14:05,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:14:21,972 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:14:21,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:14:21,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842367980]
[2024-06-03 21:14:21,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842367980] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:14:21,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:14:21,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:14:21,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207045983]
[2024-06-03 21:14:21,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:14:21,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:14:21,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:14:21,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:14:21,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:14:22,065 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 44
[2024-06-03 21:14:22,066 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 200 transitions, 1987 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:14:22,066 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:14:22,066 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 44
[2024-06-03 21:14:22,066 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:14:24,144 INFO  L124   PetriNetUnfolderBase]: 3394/4986 cut-off events.
[2024-06-03 21:14:24,146 INFO  L125   PetriNetUnfolderBase]: For 354789/354791 co-relation queries the response was YES.
[2024-06-03 21:14:24,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38653 conditions, 4986 events. 3394/4986 cut-off events. For 354789/354791 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 23893 event pairs, 1031 based on Foata normal form. 3/4988 useless extension candidates. Maximal degree in co-relation 38577. Up to 4954 conditions per place. 
[2024-06-03 21:14:24,191 INFO  L140   encePairwiseOnDemand]: 36/44 looper letters, 190 selfloop transitions, 16 changer transitions 0/209 dead transitions.
[2024-06-03 21:14:24,191 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 209 transitions, 2421 flow
[2024-06-03 21:14:24,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-03 21:14:24,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-03 21:14:24,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions.
[2024-06-03 21:14:24,192 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3787878787878788
[2024-06-03 21:14:24,192 INFO  L175             Difference]: Start difference. First operand has 163 places, 200 transitions, 1987 flow. Second operand 6 states and 100 transitions.
[2024-06-03 21:14:24,193 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 209 transitions, 2421 flow
[2024-06-03 21:14:24,562 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 209 transitions, 2343 flow, removed 32 selfloop flow, removed 4 redundant places.
[2024-06-03 21:14:24,564 INFO  L231             Difference]: Finished difference. Result has 165 places, 200 transitions, 1947 flow
[2024-06-03 21:14:24,565 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1947, PETRI_PLACES=165, PETRI_TRANSITIONS=200}
[2024-06-03 21:14:24,566 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 120 predicate places.
[2024-06-03 21:14:24,567 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 200 transitions, 1947 flow
[2024-06-03 21:14:24,567 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-03 21:14:24,567 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:14:24,567 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:14:24,567 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-03 21:14:24,567 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:14:24,567 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:14:24,568 INFO  L85        PathProgramCache]: Analyzing trace with hash -1622480793, now seen corresponding path program 1 times
[2024-06-03 21:14:24,568 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:14:24,568 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858975464]
[2024-06-03 21:14:24,568 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:14:24,568 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:14:24,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:14:37,198 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:14:37,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:14:37,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858975464]
[2024-06-03 21:14:37,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858975464] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:14:37,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:14:37,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:14:37,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805805091]
[2024-06-03 21:14:37,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:14:37,205 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:14:37,208 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:14:37,208 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:14:37,208 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:14:37,462 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:14:37,463 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 200 transitions, 1947 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:14:37,463 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:14:37,463 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:14:37,463 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:14:39,804 INFO  L124   PetriNetUnfolderBase]: 2972/4521 cut-off events.
[2024-06-03 21:14:39,805 INFO  L125   PetriNetUnfolderBase]: For 368669/368669 co-relation queries the response was YES.
[2024-06-03 21:14:39,820 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36874 conditions, 4521 events. 2972/4521 cut-off events. For 368669/368669 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 23608 event pairs, 622 based on Foata normal form. 4/4518 useless extension candidates. Maximal degree in co-relation 36796. Up to 4142 conditions per place. 
[2024-06-03 21:14:39,837 INFO  L140   encePairwiseOnDemand]: 33/44 looper letters, 210 selfloop transitions, 27 changer transitions 0/248 dead transitions.
[2024-06-03 21:14:39,838 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 248 transitions, 2815 flow
[2024-06-03 21:14:39,840 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:14:39,840 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:14:39,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions.
[2024-06-03 21:14:39,841 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44772727272727275
[2024-06-03 21:14:39,841 INFO  L175             Difference]: Start difference. First operand has 165 places, 200 transitions, 1947 flow. Second operand 10 states and 197 transitions.
[2024-06-03 21:14:39,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 248 transitions, 2815 flow
[2024-06-03 21:14:40,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 248 transitions, 2783 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-06-03 21:14:40,159 INFO  L231             Difference]: Finished difference. Result has 170 places, 204 transitions, 2096 flow
[2024-06-03 21:14:40,159 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1915, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2096, PETRI_PLACES=170, PETRI_TRANSITIONS=204}
[2024-06-03 21:14:40,159 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 125 predicate places.
[2024-06-03 21:14:40,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 170 places, 204 transitions, 2096 flow
[2024-06-03 21:14:40,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:14:40,160 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:14:40,160 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:14:40,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-03 21:14:40,160 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:14:40,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:14:40,160 INFO  L85        PathProgramCache]: Analyzing trace with hash -775210095, now seen corresponding path program 2 times
[2024-06-03 21:14:40,161 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:14:40,161 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625978437]
[2024-06-03 21:14:40,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:14:40,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:14:40,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:14:53,208 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:14:53,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:14:53,209 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625978437]
[2024-06-03 21:14:53,209 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625978437] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:14:53,209 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:14:53,209 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:14:53,209 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606897264]
[2024-06-03 21:14:53,210 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:14:53,210 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:14:53,210 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:14:53,210 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:14:53,210 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:14:53,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:14:53,437 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 204 transitions, 2096 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:14:53,437 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:14:53,437 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:14:53,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:14:55,895 INFO  L124   PetriNetUnfolderBase]: 3000/4564 cut-off events.
[2024-06-03 21:14:55,896 INFO  L125   PetriNetUnfolderBase]: For 387348/387348 co-relation queries the response was YES.
[2024-06-03 21:14:55,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37856 conditions, 4564 events. 3000/4564 cut-off events. For 387348/387348 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 23871 event pairs, 747 based on Foata normal form. 4/4561 useless extension candidates. Maximal degree in co-relation 37777. Up to 4240 conditions per place. 
[2024-06-03 21:14:55,932 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 218 selfloop transitions, 28 changer transitions 0/257 dead transitions.
[2024-06-03 21:14:55,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 257 transitions, 2800 flow
[2024-06-03 21:14:55,935 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-06-03 21:14:55,935 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-06-03 21:14:55,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 213 transitions.
[2024-06-03 21:14:55,936 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44008264462809915
[2024-06-03 21:14:55,936 INFO  L175             Difference]: Start difference. First operand has 170 places, 204 transitions, 2096 flow. Second operand 11 states and 213 transitions.
[2024-06-03 21:14:55,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 257 transitions, 2800 flow
[2024-06-03 21:14:56,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 257 transitions, 2668 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-03 21:14:56,330 INFO  L231             Difference]: Finished difference. Result has 175 places, 209 transitions, 2121 flow
[2024-06-03 21:14:56,330 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1991, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2121, PETRI_PLACES=175, PETRI_TRANSITIONS=209}
[2024-06-03 21:14:56,330 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 130 predicate places.
[2024-06-03 21:14:56,330 INFO  L495      AbstractCegarLoop]: Abstraction has has 175 places, 209 transitions, 2121 flow
[2024-06-03 21:14:56,330 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:14:56,331 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:14:56,331 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:14:56,331 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-03 21:14:56,331 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:14:56,331 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:14:56,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -775209971, now seen corresponding path program 1 times
[2024-06-03 21:14:56,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:14:56,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568661913]
[2024-06-03 21:14:56,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:14:56,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:14:56,382 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:15:08,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:15:08,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:15:08,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568661913]
[2024-06-03 21:15:08,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568661913] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:15:08,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:15:08,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:15:08,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613275886]
[2024-06-03 21:15:08,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:15:08,338 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:15:08,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:15:08,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:15:08,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:15:08,583 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:15:08,583 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 209 transitions, 2121 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:15:08,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:15:08,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:15:08,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:15:10,678 INFO  L124   PetriNetUnfolderBase]: 3016/4586 cut-off events.
[2024-06-03 21:15:10,679 INFO  L125   PetriNetUnfolderBase]: For 403251/403251 co-relation queries the response was YES.
[2024-06-03 21:15:10,702 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38114 conditions, 4586 events. 3016/4586 cut-off events. For 403251/403251 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 23998 event pairs, 742 based on Foata normal form. 4/4581 useless extension candidates. Maximal degree in co-relation 38033. Up to 4231 conditions per place. 
[2024-06-03 21:15:10,719 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 209 selfloop transitions, 29 changer transitions 0/249 dead transitions.
[2024-06-03 21:15:10,719 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 249 transitions, 2745 flow
[2024-06-03 21:15:10,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:15:10,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:15:10,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions.
[2024-06-03 21:15:10,725 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45202020202020204
[2024-06-03 21:15:10,725 INFO  L175             Difference]: Start difference. First operand has 175 places, 209 transitions, 2121 flow. Second operand 9 states and 179 transitions.
[2024-06-03 21:15:10,725 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 249 transitions, 2745 flow
[2024-06-03 21:15:11,147 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 249 transitions, 2658 flow, removed 19 selfloop flow, removed 8 redundant places.
[2024-06-03 21:15:11,149 INFO  L231             Difference]: Finished difference. Result has 176 places, 212 transitions, 2162 flow
[2024-06-03 21:15:11,150 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2034, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2162, PETRI_PLACES=176, PETRI_TRANSITIONS=212}
[2024-06-03 21:15:11,150 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 131 predicate places.
[2024-06-03 21:15:11,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 212 transitions, 2162 flow
[2024-06-03 21:15:11,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:15:11,150 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:15:11,151 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:15:11,151 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-03 21:15:11,151 INFO  L420      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:15:11,151 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:15:11,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 2141630915, now seen corresponding path program 3 times
[2024-06-03 21:15:11,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:15:11,152 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162883726]
[2024-06-03 21:15:11,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:15:11,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:15:11,206 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:15:25,386 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:15:25,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:15:25,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162883726]
[2024-06-03 21:15:25,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162883726] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:15:25,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:15:25,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:15:25,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519983684]
[2024-06-03 21:15:25,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:15:25,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:15:25,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:15:25,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:15:25,388 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:15:25,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:15:25,613 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 212 transitions, 2162 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:15:25,613 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:15:25,613 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:15:25,613 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:15:28,063 INFO  L124   PetriNetUnfolderBase]: 3018/4588 cut-off events.
[2024-06-03 21:15:28,063 INFO  L125   PetriNetUnfolderBase]: For 415826/415826 co-relation queries the response was YES.
[2024-06-03 21:15:28,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38245 conditions, 4588 events. 3018/4588 cut-off events. For 415826/415826 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24013 event pairs, 748 based on Foata normal form. 4/4585 useless extension candidates. Maximal degree in co-relation 38164. Up to 4286 conditions per place. 
[2024-06-03 21:15:28,095 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 220 selfloop transitions, 22 changer transitions 0/253 dead transitions.
[2024-06-03 21:15:28,095 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 253 transitions, 2750 flow
[2024-06-03 21:15:28,097 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:15:28,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:15:28,109 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions.
[2024-06-03 21:15:28,109 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43636363636363634
[2024-06-03 21:15:28,109 INFO  L175             Difference]: Start difference. First operand has 176 places, 212 transitions, 2162 flow. Second operand 10 states and 192 transitions.
[2024-06-03 21:15:28,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 253 transitions, 2750 flow
[2024-06-03 21:15:28,455 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 253 transitions, 2636 flow, removed 32 selfloop flow, removed 7 redundant places.
[2024-06-03 21:15:28,458 INFO  L231             Difference]: Finished difference. Result has 179 places, 212 transitions, 2099 flow
[2024-06-03 21:15:28,458 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2048, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2099, PETRI_PLACES=179, PETRI_TRANSITIONS=212}
[2024-06-03 21:15:28,459 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 134 predicate places.
[2024-06-03 21:15:28,459 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 212 transitions, 2099 flow
[2024-06-03 21:15:28,459 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:15:28,459 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:15:28,459 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:15:28,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-03 21:15:28,459 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:15:28,460 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:15:28,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038040437, now seen corresponding path program 2 times
[2024-06-03 21:15:28,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:15:28,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322855828]
[2024-06-03 21:15:28,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:15:28,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:15:28,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:15:38,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:15:38,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:15:38,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322855828]
[2024-06-03 21:15:38,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322855828] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:15:38,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:15:38,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:15:38,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559862256]
[2024-06-03 21:15:38,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:15:38,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:15:38,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:15:38,652 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:15:38,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:15:38,870 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:15:38,870 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 212 transitions, 2099 flow. Second operand  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:15:38,870 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:15:38,870 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:15:38,870 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:15:41,084 INFO  L124   PetriNetUnfolderBase]: 3010/4576 cut-off events.
[2024-06-03 21:15:41,084 INFO  L125   PetriNetUnfolderBase]: For 428323/428325 co-relation queries the response was YES.
[2024-06-03 21:15:41,103 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38155 conditions, 4576 events. 3010/4576 cut-off events. For 428323/428325 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 23907 event pairs, 650 based on Foata normal form. 4/4570 useless extension candidates. Maximal degree in co-relation 38073. Up to 3480 conditions per place. 
[2024-06-03 21:15:41,122 INFO  L140   encePairwiseOnDemand]: 31/44 looper letters, 134 selfloop transitions, 107 changer transitions 0/252 dead transitions.
[2024-06-03 21:15:41,122 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 252 transitions, 2873 flow
[2024-06-03 21:15:41,124 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:15:41,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:15:41,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-03 21:15:41,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48737373737373735
[2024-06-03 21:15:41,133 INFO  L175             Difference]: Start difference. First operand has 179 places, 212 transitions, 2099 flow. Second operand 9 states and 193 transitions.
[2024-06-03 21:15:41,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 252 transitions, 2873 flow
[2024-06-03 21:15:41,539 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 252 transitions, 2775 flow, removed 17 selfloop flow, removed 10 redundant places.
[2024-06-03 21:15:41,545 INFO  L231             Difference]: Finished difference. Result has 178 places, 212 transitions, 2226 flow
[2024-06-03 21:15:41,545 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2001, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2226, PETRI_PLACES=178, PETRI_TRANSITIONS=212}
[2024-06-03 21:15:41,548 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 133 predicate places.
[2024-06-03 21:15:41,548 INFO  L495      AbstractCegarLoop]: Abstraction has has 178 places, 212 transitions, 2226 flow
[2024-06-03 21:15:41,548 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:15:41,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:15:41,549 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:15:41,549 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-03 21:15:41,549 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:15:41,549 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:15:41,549 INFO  L85        PathProgramCache]: Analyzing trace with hash -2038045211, now seen corresponding path program 4 times
[2024-06-03 21:15:41,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:15:41,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882831470]
[2024-06-03 21:15:41,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:15:41,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:15:41,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:15:54,320 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:15:54,320 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:15:54,320 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882831470]
[2024-06-03 21:15:54,320 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882831470] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:15:54,321 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:15:54,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:15:54,321 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083298430]
[2024-06-03 21:15:54,321 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:15:54,321 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:15:54,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:15:54,321 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:15:54,321 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:15:54,606 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:15:54,607 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 212 transitions, 2226 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:15:54,607 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:15:54,607 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:15:54,607 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:15:56,828 INFO  L124   PetriNetUnfolderBase]: 3025/4607 cut-off events.
[2024-06-03 21:15:56,828 INFO  L125   PetriNetUnfolderBase]: For 447048/447050 co-relation queries the response was YES.
[2024-06-03 21:15:56,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39067 conditions, 4607 events. 3025/4607 cut-off events. For 447048/447050 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 24173 event pairs, 745 based on Foata normal form. 6/4606 useless extension candidates. Maximal degree in co-relation 38984. Up to 4218 conditions per place. 
[2024-06-03 21:15:56,864 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 197 selfloop transitions, 44 changer transitions 0/252 dead transitions.
[2024-06-03 21:15:56,864 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 252 transitions, 2866 flow
[2024-06-03 21:15:56,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:15:56,867 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:15:56,867 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2024-06-03 21:15:56,868 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4409090909090909
[2024-06-03 21:15:56,868 INFO  L175             Difference]: Start difference. First operand has 178 places, 212 transitions, 2226 flow. Second operand 10 states and 194 transitions.
[2024-06-03 21:15:56,868 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 252 transitions, 2866 flow
[2024-06-03 21:15:57,380 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 252 transitions, 2622 flow, removed 9 selfloop flow, removed 8 redundant places.
[2024-06-03 21:15:57,383 INFO  L231             Difference]: Finished difference. Result has 180 places, 214 transitions, 2143 flow
[2024-06-03 21:15:57,383 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2143, PETRI_PLACES=180, PETRI_TRANSITIONS=214}
[2024-06-03 21:15:57,384 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 135 predicate places.
[2024-06-03 21:15:57,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 214 transitions, 2143 flow
[2024-06-03 21:15:57,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:15:57,384 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:15:57,384 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:15:57,384 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-03 21:15:57,384 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:15:57,385 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:15:57,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -2054811007, now seen corresponding path program 1 times
[2024-06-03 21:15:57,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:15:57,385 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78290525]
[2024-06-03 21:15:57,385 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:15:57,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:15:57,435 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:16:12,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:16:12,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:16:12,494 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78290525]
[2024-06-03 21:16:12,494 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78290525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:16:12,494 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:16:12,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:16:12,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578081944]
[2024-06-03 21:16:12,494 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:16:12,495 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:16:12,495 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:16:12,497 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:16:12,497 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:16:12,671 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:16:12,671 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 214 transitions, 2143 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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:16:12,672 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:16:12,672 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:16:12,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:16:14,618 INFO  L124   PetriNetUnfolderBase]: 3072/4680 cut-off events.
[2024-06-03 21:16:14,619 INFO  L125   PetriNetUnfolderBase]: For 451178/451208 co-relation queries the response was YES.
[2024-06-03 21:16:14,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38849 conditions, 4680 events. 3072/4680 cut-off events. For 451178/451208 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 24034 event pairs, 920 based on Foata normal form. 21/4662 useless extension candidates. Maximal degree in co-relation 38765. Up to 4324 conditions per place. 
[2024-06-03 21:16:14,653 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 181 selfloop transitions, 28 changer transitions 0/245 dead transitions.
[2024-06-03 21:16:14,654 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 245 transitions, 2811 flow
[2024-06-03 21:16:14,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:16:14,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:16:14,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions.
[2024-06-03 21:16:14,655 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-03 21:16:14,655 INFO  L175             Difference]: Start difference. First operand has 180 places, 214 transitions, 2143 flow. Second operand 7 states and 140 transitions.
[2024-06-03 21:16:14,655 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 245 transitions, 2811 flow
[2024-06-03 21:16:15,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 245 transitions, 2668 flow, removed 29 selfloop flow, removed 8 redundant places.
[2024-06-03 21:16:15,124 INFO  L231             Difference]: Finished difference. Result has 179 places, 220 transitions, 2142 flow
[2024-06-03 21:16:15,125 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2142, PETRI_PLACES=179, PETRI_TRANSITIONS=220}
[2024-06-03 21:16:15,125 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 134 predicate places.
[2024-06-03 21:16:15,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 179 places, 220 transitions, 2142 flow
[2024-06-03 21:16:15,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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:16:15,125 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:16:15,125 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:16:15,126 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-03 21:16:15,126 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:16:15,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:16:15,126 INFO  L85        PathProgramCache]: Analyzing trace with hash -491305527, now seen corresponding path program 3 times
[2024-06-03 21:16:15,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:16:15,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910669310]
[2024-06-03 21:16:15,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:16:15,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:16:15,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:16:29,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-03 21:16:29,524 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:16:29,524 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910669310]
[2024-06-03 21:16:29,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910669310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:16:29,524 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:16:29,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:16:29,524 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941272681]
[2024-06-03 21:16:29,524 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:16:29,525 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:16:29,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:16:29,525 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:16:29,525 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:16:29,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:16:29,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 220 transitions, 2142 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:16:29,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:16:29,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:16:29,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:16:32,039 INFO  L124   PetriNetUnfolderBase]: 3075/4676 cut-off events.
[2024-06-03 21:16:32,039 INFO  L125   PetriNetUnfolderBase]: For 464871/464889 co-relation queries the response was YES.
[2024-06-03 21:16:32,057 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39753 conditions, 4676 events. 3075/4676 cut-off events. For 464871/464889 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 24600 event pairs, 692 based on Foata normal form. 4/4664 useless extension candidates. Maximal degree in co-relation 39668. Up to 4177 conditions per place. 
[2024-06-03 21:16:32,074 INFO  L140   encePairwiseOnDemand]: 30/44 looper letters, 198 selfloop transitions, 52 changer transitions 0/263 dead transitions.
[2024-06-03 21:16:32,074 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 263 transitions, 2814 flow
[2024-06-03 21:16:32,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:16:32,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:16:32,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 200 transitions.
[2024-06-03 21:16:32,077 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45454545454545453
[2024-06-03 21:16:32,077 INFO  L175             Difference]: Start difference. First operand has 179 places, 220 transitions, 2142 flow. Second operand 10 states and 200 transitions.
[2024-06-03 21:16:32,077 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 263 transitions, 2814 flow
[2024-06-03 21:16:32,389 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 263 transitions, 2762 flow, removed 17 selfloop flow, removed 3 redundant places.
[2024-06-03 21:16:32,392 INFO  L231             Difference]: Finished difference. Result has 186 places, 223 transitions, 2270 flow
[2024-06-03 21:16:32,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2270, PETRI_PLACES=186, PETRI_TRANSITIONS=223}
[2024-06-03 21:16:32,392 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 141 predicate places.
[2024-06-03 21:16:32,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 223 transitions, 2270 flow
[2024-06-03 21:16:32,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:16:32,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:16:32,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:16:32,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-03 21:16:32,394 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:16:32,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:16:32,394 INFO  L85        PathProgramCache]: Analyzing trace with hash -1872401303, now seen corresponding path program 4 times
[2024-06-03 21:16:32,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:16:32,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756773089]
[2024-06-03 21:16:32,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:16:32,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:16:32,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:16:43,536 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:16:43,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:16:43,537 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756773089]
[2024-06-03 21:16:43,537 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756773089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:16:43,537 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:16:43,537 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:16:43,537 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152538347]
[2024-06-03 21:16:43,537 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:16:43,538 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:16:43,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:16:43,538 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:16:43,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:16:43,814 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:16:43,814 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 223 transitions, 2270 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:16:43,814 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:16:43,814 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:16:43,814 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:16:46,182 INFO  L124   PetriNetUnfolderBase]: 3119/4745 cut-off events.
[2024-06-03 21:16:46,182 INFO  L125   PetriNetUnfolderBase]: For 489071/489089 co-relation queries the response was YES.
[2024-06-03 21:16:46,202 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40798 conditions, 4745 events. 3119/4745 cut-off events. For 489071/489089 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 25001 event pairs, 690 based on Foata normal form. 8/4737 useless extension candidates. Maximal degree in co-relation 40711. Up to 4162 conditions per place. 
[2024-06-03 21:16:46,289 INFO  L140   encePairwiseOnDemand]: 30/44 looper letters, 196 selfloop transitions, 62 changer transitions 0/271 dead transitions.
[2024-06-03 21:16:46,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 271 transitions, 3230 flow
[2024-06-03 21:16:46,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:16:46,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:16:46,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions.
[2024-06-03 21:16:46,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4659090909090909
[2024-06-03 21:16:46,292 INFO  L175             Difference]: Start difference. First operand has 186 places, 223 transitions, 2270 flow. Second operand 10 states and 205 transitions.
[2024-06-03 21:16:46,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 271 transitions, 3230 flow
[2024-06-03 21:16:46,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 271 transitions, 3080 flow, removed 25 selfloop flow, removed 8 redundant places.
[2024-06-03 21:16:46,723 INFO  L231             Difference]: Finished difference. Result has 189 places, 229 transitions, 2400 flow
[2024-06-03 21:16:46,723 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2400, PETRI_PLACES=189, PETRI_TRANSITIONS=229}
[2024-06-03 21:16:46,724 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 144 predicate places.
[2024-06-03 21:16:46,724 INFO  L495      AbstractCegarLoop]: Abstraction has has 189 places, 229 transitions, 2400 flow
[2024-06-03 21:16:46,724 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:16:46,724 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:16:46,724 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:16:46,724 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-03 21:16:46,724 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:16:46,725 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:16:46,725 INFO  L85        PathProgramCache]: Analyzing trace with hash -1872406077, now seen corresponding path program 5 times
[2024-06-03 21:16:46,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:16:46,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723221110]
[2024-06-03 21:16:46,725 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:16:46,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:16:46,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:16:59,782 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:16:59,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:16:59,782 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723221110]
[2024-06-03 21:16:59,782 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723221110] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:16:59,782 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:16:59,782 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:16:59,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623876024]
[2024-06-03 21:16:59,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:16:59,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:16:59,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:16:59,783 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:16:59,783 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:17:00,053 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:17:00,053 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 229 transitions, 2400 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:17:00,053 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:17:00,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:17:00,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:17:02,296 INFO  L124   PetriNetUnfolderBase]: 3136/4773 cut-off events.
[2024-06-03 21:17:02,297 INFO  L125   PetriNetUnfolderBase]: For 521177/521195 co-relation queries the response was YES.
[2024-06-03 21:17:02,316 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 41731 conditions, 4773 events. 3136/4773 cut-off events. For 521177/521195 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 25200 event pairs, 754 based on Foata normal form. 6/4761 useless extension candidates. Maximal degree in co-relation 41642. Up to 4450 conditions per place. 
[2024-06-03 21:17:02,335 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 226 selfloop transitions, 27 changer transitions 0/266 dead transitions.
[2024-06-03 21:17:02,336 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 266 transitions, 3060 flow
[2024-06-03 21:17:02,338 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:17:02,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:17:02,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-06-03 21:17:02,341 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42727272727272725
[2024-06-03 21:17:02,341 INFO  L175             Difference]: Start difference. First operand has 189 places, 229 transitions, 2400 flow. Second operand 10 states and 188 transitions.
[2024-06-03 21:17:02,341 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 266 transitions, 3060 flow
[2024-06-03 21:17:02,912 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 266 transitions, 2736 flow, removed 62 selfloop flow, removed 9 redundant places.
[2024-06-03 21:17:02,915 INFO  L231             Difference]: Finished difference. Result has 190 places, 231 transitions, 2207 flow
[2024-06-03 21:17:02,916 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2207, PETRI_PLACES=190, PETRI_TRANSITIONS=231}
[2024-06-03 21:17:02,916 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 145 predicate places.
[2024-06-03 21:17:02,916 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 231 transitions, 2207 flow
[2024-06-03 21:17:02,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:17:02,916 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:17:02,916 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:17:02,916 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-03 21:17:02,917 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:17:02,917 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:17:02,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -1445226389, now seen corresponding path program 5 times
[2024-06-03 21:17:02,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:17:02,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059830244]
[2024-06-03 21:17:02,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:17:02,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:17:02,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:17:16,316 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:17:16,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:17:16,317 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059830244]
[2024-06-03 21:17:16,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059830244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:17:16,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:17:16,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-06-03 21:17:16,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565424324]
[2024-06-03 21:17:16,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:17:16,318 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-06-03 21:17:16,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:17:16,319 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-06-03 21:17:16,319 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2024-06-03 21:17:16,704 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:17:16,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 231 transitions, 2207 flow. Second operand  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:17:16,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:17:16,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:17:16,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:17:19,040 INFO  L124   PetriNetUnfolderBase]: 3126/4758 cut-off events.
[2024-06-03 21:17:19,040 INFO  L125   PetriNetUnfolderBase]: For 514595/514613 co-relation queries the response was YES.
[2024-06-03 21:17:19,060 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40887 conditions, 4758 events. 3126/4758 cut-off events. For 514595/514613 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 25146 event pairs, 705 based on Foata normal form. 4/4746 useless extension candidates. Maximal degree in co-relation 40799. Up to 4331 conditions per place. 
[2024-06-03 21:17:19,078 INFO  L140   encePairwiseOnDemand]: 30/44 looper letters, 217 selfloop transitions, 40 changer transitions 0/270 dead transitions.
[2024-06-03 21:17:19,078 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 270 transitions, 2827 flow
[2024-06-03 21:17:19,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-03 21:17:19,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-03 21:17:19,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 195 transitions.
[2024-06-03 21:17:19,081 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2024-06-03 21:17:19,081 INFO  L175             Difference]: Start difference. First operand has 190 places, 231 transitions, 2207 flow. Second operand 10 states and 195 transitions.
[2024-06-03 21:17:19,081 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 270 transitions, 2827 flow
[2024-06-03 21:17:19,510 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 270 transitions, 2642 flow, removed 47 selfloop flow, removed 10 redundant places.
[2024-06-03 21:17:19,513 INFO  L231             Difference]: Finished difference. Result has 190 places, 231 transitions, 2110 flow
[2024-06-03 21:17:19,513 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2110, PETRI_PLACES=190, PETRI_TRANSITIONS=231}
[2024-06-03 21:17:19,514 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 145 predicate places.
[2024-06-03 21:17:19,514 INFO  L495      AbstractCegarLoop]: Abstraction has has 190 places, 231 transitions, 2110 flow
[2024-06-03 21:17:19,514 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:17:19,514 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:17:19,514 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:17:19,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-03 21:17:19,515 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:17:19,516 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:17:19,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -484803153, now seen corresponding path program 1 times
[2024-06-03 21:17:19,516 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:17:19,516 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022282778]
[2024-06-03 21:17:19,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:17:19,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:17:19,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:17:31,363 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:17:31,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:17:31,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022282778]
[2024-06-03 21:17:31,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022282778] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:17:31,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:17:31,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-03 21:17:31,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590768658]
[2024-06-03 21:17:31,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:17:31,365 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-03 21:17:31,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:17:31,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-03 21:17:31,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-03 21:17:31,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44
[2024-06-03 21:17:31,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 231 transitions, 2110 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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:17:31,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:17:31,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44
[2024-06-03 21:17:31,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:17:33,880 INFO  L124   PetriNetUnfolderBase]: 3457/5160 cut-off events.
[2024-06-03 21:17:33,880 INFO  L125   PetriNetUnfolderBase]: For 540346/540364 co-relation queries the response was YES.
[2024-06-03 21:17:33,903 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43149 conditions, 5160 events. 3457/5160 cut-off events. For 540346/540364 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 25925 event pairs, 824 based on Foata normal form. 4/5146 useless extension candidates. Maximal degree in co-relation 43060. Up to 4829 conditions per place. 
[2024-06-03 21:17:33,922 INFO  L140   encePairwiseOnDemand]: 32/44 looper letters, 223 selfloop transitions, 36 changer transitions 0/270 dead transitions.
[2024-06-03 21:17:33,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 270 transitions, 2798 flow
[2024-06-03 21:17:33,925 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-03 21:17:33,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-03 21:17:33,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions.
[2024-06-03 21:17:33,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42676767676767674
[2024-06-03 21:17:33,925 INFO  L175             Difference]: Start difference. First operand has 190 places, 231 transitions, 2110 flow. Second operand 9 states and 169 transitions.
[2024-06-03 21:17:33,925 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 270 transitions, 2798 flow
[2024-06-03 21:17:34,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 270 transitions, 2684 flow, removed 8 selfloop flow, removed 9 redundant places.
[2024-06-03 21:17:34,472 INFO  L231             Difference]: Finished difference. Result has 191 places, 236 transitions, 2165 flow
[2024-06-03 21:17:34,472 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2000, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2165, PETRI_PLACES=191, PETRI_TRANSITIONS=236}
[2024-06-03 21:17:34,473 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 146 predicate places.
[2024-06-03 21:17:34,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 236 transitions, 2165 flow
[2024-06-03 21:17:34,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 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:17:34,473 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:17:34,473 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:17:34,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-03 21:17:34,473 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:17:34,474 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:17:34,474 INFO  L85        PathProgramCache]: Analyzing trace with hash -2054452523, now seen corresponding path program 1 times
[2024-06-03 21:17:34,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:17:34,474 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875435084]
[2024-06-03 21:17:34,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:17:34,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:17:34,512 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:17:48,309 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:17:48,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:17:48,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875435084]
[2024-06-03 21:17:48,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875435084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:17:48,310 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:17:48,310 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-03 21:17:48,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861101955]
[2024-06-03 21:17:48,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:17:48,310 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-03 21:17:48,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:17:48,311 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-03 21:17:48,311 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-03 21:17:48,504 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:17:48,505 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 236 transitions, 2165 flow. Second operand  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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:17:48,505 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:17:48,505 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:17:48,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:17:50,578 INFO  L124   PetriNetUnfolderBase]: 3212/4896 cut-off events.
[2024-06-03 21:17:50,578 INFO  L125   PetriNetUnfolderBase]: For 556655/556680 co-relation queries the response was YES.
[2024-06-03 21:17:50,600 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42036 conditions, 4896 events. 3212/4896 cut-off events. For 556655/556680 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 25329 event pairs, 907 based on Foata normal form. 21/4885 useless extension candidates. Maximal degree in co-relation 41945. Up to 4554 conditions per place. 
[2024-06-03 21:17:50,620 INFO  L140   encePairwiseOnDemand]: 34/44 looper letters, 206 selfloop transitions, 24 changer transitions 0/267 dead transitions.
[2024-06-03 21:17:50,620 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 267 transitions, 2875 flow
[2024-06-03 21:17:50,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-03 21:17:50,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-03 21:17:50,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-03 21:17:50,621 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42613636363636365
[2024-06-03 21:17:50,621 INFO  L175             Difference]: Start difference. First operand has 191 places, 236 transitions, 2165 flow. Second operand 8 states and 150 transitions.
[2024-06-03 21:17:50,621 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 267 transitions, 2875 flow
[2024-06-03 21:17:51,087 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 267 transitions, 2754 flow, removed 27 selfloop flow, removed 6 redundant places.
[2024-06-03 21:17:51,090 INFO  L231             Difference]: Finished difference. Result has 194 places, 245 transitions, 2202 flow
[2024-06-03 21:17:51,090 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2044, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2202, PETRI_PLACES=194, PETRI_TRANSITIONS=245}
[2024-06-03 21:17:51,090 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 149 predicate places.
[2024-06-03 21:17:51,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 194 places, 245 transitions, 2202 flow
[2024-06-03 21:17:51,091 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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:17:51,091 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:17:51,091 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:17:51,091 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-03 21:17:51,091 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:17:51,091 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:17:51,092 INFO  L85        PathProgramCache]: Analyzing trace with hash -1104465277, now seen corresponding path program 2 times
[2024-06-03 21:17:51,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:17:51,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487174367]
[2024-06-03 21:17:51,092 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:17:51,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:17:51,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-03 21:18:07,293 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:18:07,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-03 21:18:07,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487174367]
[2024-06-03 21:18:07,294 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487174367] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-03 21:18:07,294 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-03 21:18:07,294 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-03 21:18:07,294 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552641363]
[2024-06-03 21:18:07,294 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-03 21:18:07,294 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-03 21:18:07,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-03 21:18:07,295 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-03 21:18:07,295 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-03 21:18:07,458 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44
[2024-06-03 21:18:07,459 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 245 transitions, 2202 flow. Second operand  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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:18:07,459 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-03 21:18:07,459 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44
[2024-06-03 21:18:07,459 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-03 21:18:09,554 INFO  L124   PetriNetUnfolderBase]: 3222/4912 cut-off events.
[2024-06-03 21:18:09,554 INFO  L125   PetriNetUnfolderBase]: For 574757/574782 co-relation queries the response was YES.
[2024-06-03 21:18:09,578 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42769 conditions, 4912 events. 3222/4912 cut-off events. For 574757/574782 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 25421 event pairs, 908 based on Foata normal form. 20/4900 useless extension candidates. Maximal degree in co-relation 42676. Up to 4590 conditions per place. 
[2024-06-03 21:18:09,598 INFO  L140   encePairwiseOnDemand]: 35/44 looper letters, 209 selfloop transitions, 19 changer transitions 0/265 dead transitions.
[2024-06-03 21:18:09,598 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 265 transitions, 2744 flow
[2024-06-03 21:18:09,599 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-03 21:18:09,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-03 21:18:09,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions.
[2024-06-03 21:18:09,599 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4253246753246753
[2024-06-03 21:18:09,599 INFO  L175             Difference]: Start difference. First operand has 194 places, 245 transitions, 2202 flow. Second operand 7 states and 131 transitions.
[2024-06-03 21:18:09,599 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 265 transitions, 2744 flow
[2024-06-03 21:18:10,121 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 265 transitions, 2702 flow, removed 16 selfloop flow, removed 3 redundant places.
[2024-06-03 21:18:10,124 INFO  L231             Difference]: Finished difference. Result has 198 places, 248 transitions, 2246 flow
[2024-06-03 21:18:10,125 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2246, PETRI_PLACES=198, PETRI_TRANSITIONS=248}
[2024-06-03 21:18:10,125 INFO  L281   CegarLoopForPetriNet]: 45 programPoint places, 153 predicate places.
[2024-06-03 21:18:10,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 248 transitions, 2246 flow
[2024-06-03 21:18:10,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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:18:10,125 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-03 21:18:10,125 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-03 21:18:10,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-03 21:18:10,126 INFO  L420      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-03 21:18:10,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-03 21:18:10,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 1233012591, now seen corresponding path program 6 times
[2024-06-03 21:18:10,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-03 21:18:10,126 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200587531]
[2024-06-03 21:18:10,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-03 21:18:10,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-03 21:18:10,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15