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


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


Checking for ERROR reachability
Using default analysis
Version 76401ed0
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false
--- Real Ultimate output ---
This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m
[2024-06-20 18:49:45,576 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-20 18:49:45,657 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-20 18:49:45,664 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-20 18:49:45,665 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-20 18:49:45,690 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-20 18:49:45,691 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-20 18:49:45,691 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-20 18:49:45,692 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-20 18:49:45,696 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-20 18:49:45,696 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-20 18:49:45,696 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-20 18:49:45,697 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-20 18:49:45,698 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-20 18:49:45,699 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-20 18:49:45,699 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-20 18:49:45,699 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-20 18:49:45,699 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-20 18:49:45,700 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-20 18:49:45,700 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-20 18:49:45,700 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-20 18:49:45,701 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-20 18:49:45,701 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-20 18:49:45,701 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-20 18:49:45,701 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-20 18:49:45,702 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-20 18:49:45,702 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-20 18:49:45,702 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-20 18:49:45,703 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-20 18:49:45,703 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-20 18:49:45,704 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-20 18:49:45,704 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-20 18:49:45,704 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:49:45,705 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-20 18:49:45,705 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-20 18:49:45,705 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-20 18:49:45,705 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-20 18:49:45,705 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-20 18:49:45,706 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-20 18:49:45,706 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-20 18:49:45,706 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-20 18:49:45,706 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-20 18:49:45,707 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-20 18:49:45,707 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
[2024-06-20 18:49:45,974 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-20 18:49:46,028 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-20 18:49:46,031 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-20 18:49:46,032 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-20 18:49:46,034 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-20 18:49:46,035 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:49:47,161 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-20 18:49:47,466 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-20 18:49:47,472 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:49:47,488 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d287efba7/0609a52748234889bba2344bc6f1a509/FLAGfa12650e7
[2024-06-20 18:49:47,504 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d287efba7/0609a52748234889bba2344bc6f1a509
[2024-06-20 18:49:47,506 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-20 18:49:47,507 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-20 18:49:47,509 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/mix028_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-20 18:49:47,704 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-20 18:49:47,705 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-20 18:49:47,708 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-20 18:49:47,708 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-20 18:49:47,713 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-20 18:49:47,713 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:49:47" (1/2) ...
[2024-06-20 18:49:47,714 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7751f949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:49:47, skipping insertion in model container
[2024-06-20 18:49:47,714 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:49:47" (1/2) ...
[2024-06-20 18:49:47,716 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f3afd04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:49:47, skipping insertion in model container
[2024-06-20 18:49:47,716 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:49:47" (2/2) ...
[2024-06-20 18:49:47,716 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7751f949 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:47, skipping insertion in model container
[2024-06-20 18:49:47,716 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:49:47" (2/2) ...
[2024-06-20 18:49:47,716 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-20 18:49:47,818 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-20 18:49:47,819 INFO  L97    edCorrectnessWitness]: Location invariant before [L842-L842] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! 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_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_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 || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p2_EBX <= 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_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-20 18:49:47,820 INFO  L97    edCorrectnessWitness]: Location invariant before [L841-L841] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! 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_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_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 || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p2_EBX <= 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_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-20 18:49:47,821 INFO  L97    edCorrectnessWitness]: Location invariant before [L839-L839] ((((((((((((((((((! multithreaded || z$r_buff0_thd3 == (_Bool)0) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! 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_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_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_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (1LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd1) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_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 || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 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_p2_EBX <= 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_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))
[2024-06-20 18:49:47,821 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-20 18:49:47,821 INFO  L106   edCorrectnessWitness]: ghost_update [L837-L837] multithreaded = 1;
[2024-06-20 18:49:47,866 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-20 18:49:48,254 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:49:48,263 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-20 18:49:48,681 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-20 18:49:48,724 INFO  L206         MainTranslator]: Completed translation
[2024-06-20 18:49:48,725 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48 WrapperNode
[2024-06-20 18:49:48,725 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-20 18:49:48,727 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-20 18:49:48,727 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-20 18:49:48,727 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-20 18:49:48,733 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 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:48,783 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 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:48,890 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125
[2024-06-20 18:49:48,890 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-20 18:49:48,891 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-20 18:49:48,892 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-20 18:49:48,892 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-20 18:49:48,902 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:48,902 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:48,936 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:48,982 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-06-20 18:49:48,983 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:48,983 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:49,114 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:49,116 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:49,130 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:49,136 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:49,173 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-20 18:49:49,174 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-20 18:49:49,175 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-20 18:49:49,175 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-20 18:49:49,176 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (1/1) ...
[2024-06-20 18:49:49,180 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-20 18:49:49,189 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-20 18:49:49,206 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-06-20 18:49:49,244 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-06-20 18:49:49,273 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-20 18:49:49,273 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-20 18:49:49,273 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-20 18:49:49,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-20 18:49:49,274 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-20 18:49:49,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-20 18:49:49,275 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-20 18:49:49,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-20 18:49:49,275 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-20 18:49:49,275 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-20 18:49:49,275 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-20 18:49:49,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-20 18:49:49,277 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-20 18:49:49,428 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-20 18:49:49,431 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-20 18:49:50,792 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-20 18:49:50,795 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-20 18:49:51,123 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-20 18:49:51,124 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-20 18:49:51,124 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:49:51 BoogieIcfgContainer
[2024-06-20 18:49:51,124 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-20 18:49:51,126 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-20 18:49:51,127 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-20 18:49:51,129 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-20 18:49:51,130 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:49:47" (1/4) ...
[2024-06-20 18:49:51,130 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009eeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:49:51, skipping insertion in model container
[2024-06-20 18:49:51,130 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:49:47" (2/4) ...
[2024-06-20 18:49:51,131 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009eeea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:49:51, skipping insertion in model container
[2024-06-20 18:49:51,131 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:49:48" (3/4) ...
[2024-06-20 18:49:51,131 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3009eeea and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:49:51, skipping insertion in model container
[2024-06-20 18:49:51,132 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:49:51" (4/4) ...
[2024-06-20 18:49:51,133 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-20 18:49:51,151 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-20 18:49:51,151 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-20 18:49:51,151 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-20 18:49:51,289 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-20 18:49:51,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow
[2024-06-20 18:49:51,477 INFO  L124   PetriNetUnfolderBase]: 0/38 cut-off events.
[2024-06-20 18:49:51,477 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:49:51,482 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-20 18:49:51,483 INFO  L82        GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow
[2024-06-20 18:49:51,491 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow
[2024-06-20 18:49:51,512 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-20 18:49:51,518 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;@5845a67d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-20 18:49:51,518 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-20 18:49:51,527 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-20 18:49:51,527 INFO  L124   PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-06-20 18:49:51,527 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-20 18:49:51,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:49:51,528 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2024-06-20 18:49:51,529 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:49:51,556 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:49:51,556 INFO  L85        PathProgramCache]: Analyzing trace with hash 368241174, now seen corresponding path program 1 times
[2024-06-20 18:49:51,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:49:51,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772869874]
[2024-06-20 18:49:51,580 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:49:51,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:49:52,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:49:59,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:49:59,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:49:59,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772869874]
[2024-06-20 18:49:59,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772869874] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:49:59,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:49:59,930 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-20 18:49:59,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350819249]
[2024-06-20 18:49:59,932 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:49:59,939 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-20 18:49:59,944 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:49:59,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-20 18:49:59,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-20 18:50:00,072 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:50:00,075 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:00,075 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:00,075 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:50:00,076 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:01,688 INFO  L124   PetriNetUnfolderBase]: 1659/2537 cut-off events.
[2024-06-20 18:50:01,688 INFO  L125   PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES.
[2024-06-20 18:50:01,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5101 conditions, 2537 events. 1659/2537 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12032 event pairs, 1184 based on Foata normal form. 1/2485 useless extension candidates. Maximal degree in co-relation 5089. Up to 2465 conditions per place. 
[2024-06-20 18:50:01,718 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/42 dead transitions.
[2024-06-20 18:50:01,718 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 173 flow
[2024-06-20 18:50:01,720 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-20 18:50:01,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-20 18:50:01,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-20 18:50:01,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5934959349593496
[2024-06-20 18:50:01,732 INFO  L175             Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 73 transitions.
[2024-06-20 18:50:01,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 173 flow
[2024-06-20 18:50:01,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-20 18:50:01,739 INFO  L231             Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow
[2024-06-20 18:50:01,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35}
[2024-06-20 18:50:01,745 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2024-06-20 18:50:01,745 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow
[2024-06-20 18:50:01,746 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:01,746 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:01,746 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:01,746 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-20 18:50:01,747 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:01,747 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:01,748 INFO  L85        PathProgramCache]: Analyzing trace with hash 1692467381, now seen corresponding path program 1 times
[2024-06-20 18:50:01,748 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:01,749 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610084880]
[2024-06-20 18:50:01,749 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:01,749 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:01,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:50:07,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:50:07,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:50:07,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610084880]
[2024-06-20 18:50:07,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610084880] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:50:07,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:50:07,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-20 18:50:07,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46294129]
[2024-06-20 18:50:07,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:50:07,695 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-20 18:50:07,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:50:07,695 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-20 18:50:07,696 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-20 18:50:07,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:50:07,783 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:07,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:07,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:50:07,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:08,968 INFO  L124   PetriNetUnfolderBase]: 1653/2528 cut-off events.
[2024-06-20 18:50:08,969 INFO  L125   PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES.
[2024-06-20 18:50:08,974 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 2528 events. 1653/2528 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12035 event pairs, 1038 based on Foata normal form. 3/2518 useless extension candidates. Maximal degree in co-relation 5705. Up to 2441 conditions per place. 
[2024-06-20 18:50:08,987 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 40 selfloop transitions, 7 changer transitions 0/52 dead transitions.
[2024-06-20 18:50:08,988 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 240 flow
[2024-06-20 18:50:08,992 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-20 18:50:08,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-20 18:50:08,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions.
[2024-06-20 18:50:08,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.573170731707317
[2024-06-20 18:50:08,996 INFO  L175             Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 94 transitions.
[2024-06-20 18:50:08,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 240 flow
[2024-06-20 18:50:08,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-20 18:50:09,001 INFO  L231             Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow
[2024-06-20 18:50:09,001 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38}
[2024-06-20 18:50:09,002 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places.
[2024-06-20 18:50:09,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow
[2024-06-20 18:50:09,003 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:09,003 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:09,004 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:09,006 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-20 18:50:09,007 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:09,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:09,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 926881865, now seen corresponding path program 1 times
[2024-06-20 18:50:09,009 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:09,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767301146]
[2024-06-20 18:50:09,015 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:09,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:09,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:50:14,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-20 18:50:14,337 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:50:14,337 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767301146]
[2024-06-20 18:50:14,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767301146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:50:14,338 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:50:14,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-20 18:50:14,338 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686096937]
[2024-06-20 18:50:14,338 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:50:14,339 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-20 18:50:14,339 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:50:14,340 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-20 18:50:14,340 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-20 18:50:14,476 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:50:14,477 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:14,477 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:14,477 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:50:14,477 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:15,707 INFO  L124   PetriNetUnfolderBase]: 1661/2558 cut-off events.
[2024-06-20 18:50:15,707 INFO  L125   PetriNetUnfolderBase]: For 1306/1306 co-relation queries the response was YES.
[2024-06-20 18:50:15,715 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6384 conditions, 2558 events. 1661/2558 cut-off events. For 1306/1306 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12206 event pairs, 812 based on Foata normal form. 5/2562 useless extension candidates. Maximal degree in co-relation 6370. Up to 2387 conditions per place. 
[2024-06-20 18:50:15,726 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 53 selfloop transitions, 16 changer transitions 0/74 dead transitions.
[2024-06-20 18:50:15,726 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 394 flow
[2024-06-20 18:50:15,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:50:15,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:50:15,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions.
[2024-06-20 18:50:15,733 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6
[2024-06-20 18:50:15,733 INFO  L175             Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 123 transitions.
[2024-06-20 18:50:15,733 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 394 flow
[2024-06-20 18:50:15,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 380 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-20 18:50:15,738 INFO  L231             Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow
[2024-06-20 18:50:15,738 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49}
[2024-06-20 18:50:15,739 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places.
[2024-06-20 18:50:15,739 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow
[2024-06-20 18:50:15,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:15,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:15,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:15,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-20 18:50:15,740 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:15,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:15,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -721908760, now seen corresponding path program 1 times
[2024-06-20 18:50:15,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:15,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829775560]
[2024-06-20 18:50:15,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:15,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:15,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:50:20,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:50:20,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:50:20,692 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829775560]
[2024-06-20 18:50:20,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829775560] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:50:20,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:50:20,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:50:20,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594172043]
[2024-06-20 18:50:20,693 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:50:20,693 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:50:20,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:50:20,694 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:50:20,694 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:50:20,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:50:20,876 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 flow. Second operand  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-20 18:50:20,876 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:20,876 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:50:20,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:22,286 INFO  L124   PetriNetUnfolderBase]: 1669/2570 cut-off events.
[2024-06-20 18:50:22,287 INFO  L125   PetriNetUnfolderBase]: For 3038/3040 co-relation queries the response was YES.
[2024-06-20 18:50:22,293 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7503 conditions, 2570 events. 1669/2570 cut-off events. For 3038/3040 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12288 event pairs, 666 based on Foata normal form. 7/2576 useless extension candidates. Maximal degree in co-relation 7486. Up to 2373 conditions per place. 
[2024-06-20 18:50:22,307 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 60 selfloop transitions, 20 changer transitions 0/85 dead transitions.
[2024-06-20 18:50:22,307 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 85 transitions, 521 flow
[2024-06-20 18:50:22,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:50:22,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:50:22,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions.
[2024-06-20 18:50:22,310 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5894308943089431
[2024-06-20 18:50:22,310 INFO  L175             Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 145 transitions.
[2024-06-20 18:50:22,310 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 85 transitions, 521 flow
[2024-06-20 18:50:22,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 513 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-20 18:50:22,319 INFO  L231             Difference]: Finished difference. Result has 56 places, 53 transitions, 308 flow
[2024-06-20 18:50:22,319 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=308, PETRI_PLACES=56, PETRI_TRANSITIONS=53}
[2024-06-20 18:50:22,321 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places.
[2024-06-20 18:50:22,321 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 53 transitions, 308 flow
[2024-06-20 18:50:22,322 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 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-20 18:50:22,322 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:22,322 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:22,322 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-20 18:50:22,322 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:22,323 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:22,323 INFO  L85        PathProgramCache]: Analyzing trace with hash 1675262408, now seen corresponding path program 1 times
[2024-06-20 18:50:22,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:22,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816733476]
[2024-06-20 18:50:22,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:22,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:22,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:50:28,016 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:50:28,016 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:50:28,016 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816733476]
[2024-06-20 18:50:28,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816733476] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:50:28,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:50:28,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:50:28,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904458212]
[2024-06-20 18:50:28,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:50:28,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:50:28,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:50:28,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:50:28,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:50:28,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 11 out of 41
[2024-06-20 18:50:28,162 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 53 transitions, 308 flow. Second operand  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:28,162 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:28,162 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 41
[2024-06-20 18:50:28,162 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:29,613 INFO  L124   PetriNetUnfolderBase]: 1681/2590 cut-off events.
[2024-06-20 18:50:29,613 INFO  L125   PetriNetUnfolderBase]: For 4787/4789 co-relation queries the response was YES.
[2024-06-20 18:50:29,617 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8374 conditions, 2590 events. 1681/2590 cut-off events. For 4787/4789 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12415 event pairs, 502 based on Foata normal form. 12/2601 useless extension candidates. Maximal degree in co-relation 8354. Up to 2341 conditions per place. 
[2024-06-20 18:50:29,628 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 64 selfloop transitions, 23 changer transitions 0/92 dead transitions.
[2024-06-20 18:50:29,628 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 622 flow
[2024-06-20 18:50:29,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:50:29,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:50:29,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions.
[2024-06-20 18:50:29,630 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5679442508710801
[2024-06-20 18:50:29,630 INFO  L175             Difference]: Start difference. First operand has 56 places, 53 transitions, 308 flow. Second operand 7 states and 163 transitions.
[2024-06-20 18:50:29,630 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 622 flow
[2024-06-20 18:50:29,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 573 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-20 18:50:29,635 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 335 flow
[2024-06-20 18:50:29,635 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-20 18:50:29,636 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2024-06-20 18:50:29,636 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 335 flow
[2024-06-20 18:50:29,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:29,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:29,637 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:29,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-20 18:50:29,637 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:29,638 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:29,638 INFO  L85        PathProgramCache]: Analyzing trace with hash 1549786196, now seen corresponding path program 1 times
[2024-06-20 18:50:29,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:29,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180286985]
[2024-06-20 18:50:29,638 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:29,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:29,672 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:50:40,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:50:40,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:50:40,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180286985]
[2024-06-20 18:50:40,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180286985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:50:40,447 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:50:40,447 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:50:40,447 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75374511]
[2024-06-20 18:50:40,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:50:40,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:50:40,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:50:40,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:50:40,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:50:40,594 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:50:40,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 335 flow. Second operand  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:40,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:40,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:50:40,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:41,580 INFO  L124   PetriNetUnfolderBase]: 1676/2579 cut-off events.
[2024-06-20 18:50:41,581 INFO  L125   PetriNetUnfolderBase]: For 6458/6458 co-relation queries the response was YES.
[2024-06-20 18:50:41,587 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8897 conditions, 2579 events. 1676/2579 cut-off events. For 6458/6458 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 12271 event pairs, 659 based on Foata normal form. 2/2580 useless extension candidates. Maximal degree in co-relation 8875. Up to 2484 conditions per place. 
[2024-06-20 18:50:41,600 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 54 selfloop transitions, 8 changer transitions 0/66 dead transitions.
[2024-06-20 18:50:41,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 66 transitions, 487 flow
[2024-06-20 18:50:41,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:50:41,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:50:41,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions.
[2024-06-20 18:50:41,601 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44390243902439025
[2024-06-20 18:50:41,601 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 335 flow. Second operand 5 states and 91 transitions.
[2024-06-20 18:50:41,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 66 transitions, 487 flow
[2024-06-20 18:50:41,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 423 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-20 18:50:41,608 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 295 flow
[2024-06-20 18:50:41,608 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-20 18:50:41,609 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2024-06-20 18:50:41,609 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 295 flow
[2024-06-20 18:50:41,609 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:41,609 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:41,609 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:41,610 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-20 18:50:41,610 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:41,610 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:41,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 798329682, now seen corresponding path program 1 times
[2024-06-20 18:50:41,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:41,611 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469819547]
[2024-06-20 18:50:41,611 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:41,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:41,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:50:52,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:50:52,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:50:52,689 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469819547]
[2024-06-20 18:50:52,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469819547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:50:52,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:50:52,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:50:52,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365046850]
[2024-06-20 18:50:52,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:50:52,690 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:50:52,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:50:52,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:50:52,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:50:52,815 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:50:52,815 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 295 flow. Second operand  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:52,815 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:50:52,815 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:50:52,816 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:50:54,000 INFO  L124   PetriNetUnfolderBase]: 1932/2871 cut-off events.
[2024-06-20 18:50:54,000 INFO  L125   PetriNetUnfolderBase]: For 8815/8815 co-relation queries the response was YES.
[2024-06-20 18:50:54,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10013 conditions, 2871 events. 1932/2871 cut-off events. For 8815/8815 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13034 event pairs, 727 based on Foata normal form. 6/2876 useless extension candidates. Maximal degree in co-relation 9989. Up to 2802 conditions per place. 
[2024-06-20 18:50:54,017 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 65 selfloop transitions, 17 changer transitions 0/85 dead transitions.
[2024-06-20 18:50:54,017 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 589 flow
[2024-06-20 18:50:54,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:50:54,018 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:50:54,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions.
[2024-06-20 18:50:54,019 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44715447154471544
[2024-06-20 18:50:54,019 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 295 flow. Second operand 6 states and 110 transitions.
[2024-06-20 18:50:54,019 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 589 flow
[2024-06-20 18:50:54,024 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 567 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-20 18:50:54,025 INFO  L231             Difference]: Finished difference. Result has 62 places, 66 transitions, 404 flow
[2024-06-20 18:50:54,025 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=62, PETRI_TRANSITIONS=66}
[2024-06-20 18:50:54,027 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places.
[2024-06-20 18:50:54,027 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 66 transitions, 404 flow
[2024-06-20 18:50:54,027 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:50:54,027 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:50:54,027 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:50:54,027 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-20 18:50:54,028 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:50:54,028 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:50:54,028 INFO  L85        PathProgramCache]: Analyzing trace with hash -2006007427, now seen corresponding path program 1 times
[2024-06-20 18:50:54,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:50:54,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052900975]
[2024-06-20 18:50:54,029 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:50:54,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:50:54,082 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:51:02,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:51:02,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:51:02,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052900975]
[2024-06-20 18:51:02,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052900975] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:51:02,678 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:51:02,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:51:02,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934159263]
[2024-06-20 18:51:02,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:51:02,679 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:51:02,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:51:02,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:51:02,679 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:51:02,837 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:51:02,837 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 66 transitions, 404 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-20 18:51:02,837 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:51:02,837 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:51:02,837 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:51:03,773 INFO  L124   PetriNetUnfolderBase]: 1744/2686 cut-off events.
[2024-06-20 18:51:03,773 INFO  L125   PetriNetUnfolderBase]: For 10832/10846 co-relation queries the response was YES.
[2024-06-20 18:51:03,780 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10190 conditions, 2686 events. 1744/2686 cut-off events. For 10832/10846 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12861 event pairs, 651 based on Foata normal form. 8/2678 useless extension candidates. Maximal degree in co-relation 10164. Up to 2489 conditions per place. 
[2024-06-20 18:51:03,790 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 63 selfloop transitions, 19 changer transitions 0/89 dead transitions.
[2024-06-20 18:51:03,791 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 668 flow
[2024-06-20 18:51:03,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:51:03,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:51:03,792 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions.
[2024-06-20 18:51:03,793 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715447154471545
[2024-06-20 18:51:03,793 INFO  L175             Difference]: Start difference. First operand has 62 places, 66 transitions, 404 flow. Second operand 6 states and 116 transitions.
[2024-06-20 18:51:03,793 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 668 flow
[2024-06-20 18:51:03,803 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 650 flow, removed 8 selfloop flow, removed 1 redundant places.
[2024-06-20 18:51:03,805 INFO  L231             Difference]: Finished difference. Result has 67 places, 69 transitions, 458 flow
[2024-06-20 18:51:03,805 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=458, PETRI_PLACES=67, PETRI_TRANSITIONS=69}
[2024-06-20 18:51:03,808 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places.
[2024-06-20 18:51:03,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 69 transitions, 458 flow
[2024-06-20 18:51:03,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-20 18:51:03,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:51:03,809 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:51:03,809 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-20 18:51:03,809 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:51:03,810 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:51:03,810 INFO  L85        PathProgramCache]: Analyzing trace with hash -1009077837, now seen corresponding path program 2 times
[2024-06-20 18:51:03,810 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:51:03,810 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36200165]
[2024-06-20 18:51:03,810 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:51:03,810 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:51:03,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:51:11,930 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:51:11,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:51:11,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36200165]
[2024-06-20 18:51:11,931 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36200165] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:51:11,931 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:51:11,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:51:11,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726869422]
[2024-06-20 18:51:11,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:51:11,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:51:11,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:51:11,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:51:11,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:51:12,103 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:51:12,104 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 69 transitions, 458 flow. Second operand  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-20 18:51:12,104 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:51:12,104 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:51:12,104 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:51:13,088 INFO  L124   PetriNetUnfolderBase]: 1729/2660 cut-off events.
[2024-06-20 18:51:13,088 INFO  L125   PetriNetUnfolderBase]: For 12020/12030 co-relation queries the response was YES.
[2024-06-20 18:51:13,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10270 conditions, 2660 events. 1729/2660 cut-off events. For 12020/12030 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12689 event pairs, 647 based on Foata normal form. 2/2646 useless extension candidates. Maximal degree in co-relation 10241. Up to 2530 conditions per place. 
[2024-06-20 18:51:13,102 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 66 selfloop transitions, 11 changer transitions 0/84 dead transitions.
[2024-06-20 18:51:13,103 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 650 flow
[2024-06-20 18:51:13,103 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:51:13,103 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:51:13,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions.
[2024-06-20 18:51:13,104 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4349593495934959
[2024-06-20 18:51:13,104 INFO  L175             Difference]: Start difference. First operand has 67 places, 69 transitions, 458 flow. Second operand 6 states and 107 transitions.
[2024-06-20 18:51:13,105 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 650 flow
[2024-06-20 18:51:13,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 84 transitions, 621 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-20 18:51:13,118 INFO  L231             Difference]: Finished difference. Result has 70 places, 69 transitions, 459 flow
[2024-06-20 18:51:13,118 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=70, PETRI_TRANSITIONS=69}
[2024-06-20 18:51:13,119 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places.
[2024-06-20 18:51:13,119 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 459 flow
[2024-06-20 18:51:13,120 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 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-20 18:51:13,120 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:51:13,120 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:51:13,120 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-20 18:51:13,120 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:51:13,121 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:51:13,121 INFO  L85        PathProgramCache]: Analyzing trace with hash -62117735, now seen corresponding path program 1 times
[2024-06-20 18:51:13,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:51:13,127 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989428716]
[2024-06-20 18:51:13,127 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:51:13,127 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:51:13,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:51:21,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:51:21,742 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:51:21,742 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989428716]
[2024-06-20 18:51:21,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989428716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:51:21,743 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:51:21,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:51:21,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005896022]
[2024-06-20 18:51:21,743 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:51:21,744 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:51:21,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:51:21,744 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:51:21,744 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:51:21,937 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:51:21,938 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 459 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:21,938 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:51:21,938 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:51:21,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:51:23,085 INFO  L124   PetriNetUnfolderBase]: 2091/3095 cut-off events.
[2024-06-20 18:51:23,085 INFO  L125   PetriNetUnfolderBase]: For 17153/17153 co-relation queries the response was YES.
[2024-06-20 18:51:23,092 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12368 conditions, 3095 events. 2091/3095 cut-off events. For 17153/17153 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14121 event pairs, 649 based on Foata normal form. 12/3106 useless extension candidates. Maximal degree in co-relation 12338. Up to 2721 conditions per place. 
[2024-06-20 18:51:23,105 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 87 selfloop transitions, 31 changer transitions 0/121 dead transitions.
[2024-06-20 18:51:23,106 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 985 flow
[2024-06-20 18:51:23,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:51:23,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:51:23,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions.
[2024-06-20 18:51:23,108 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4843205574912892
[2024-06-20 18:51:23,108 INFO  L175             Difference]: Start difference. First operand has 70 places, 69 transitions, 459 flow. Second operand 7 states and 139 transitions.
[2024-06-20 18:51:23,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 985 flow
[2024-06-20 18:51:23,122 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 121 transitions, 938 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 18:51:23,125 INFO  L231             Difference]: Finished difference. Result has 74 places, 88 transitions, 660 flow
[2024-06-20 18:51:23,126 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=660, PETRI_PLACES=74, PETRI_TRANSITIONS=88}
[2024-06-20 18:51:23,127 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places.
[2024-06-20 18:51:23,129 INFO  L495      AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 660 flow
[2024-06-20 18:51:23,129 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:23,129 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:51:23,129 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:51:23,130 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-20 18:51:23,130 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:51:23,130 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:51:23,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -1679359571, now seen corresponding path program 2 times
[2024-06-20 18:51:23,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:51:23,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452230440]
[2024-06-20 18:51:23,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:51:23,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:51:23,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:51:32,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:51:32,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:51:32,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452230440]
[2024-06-20 18:51:32,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452230440] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:51:32,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:51:32,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:51:32,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447137129]
[2024-06-20 18:51:32,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:51:32,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:51:32,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:51:32,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:51:32,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:51:32,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:51:32,179 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 88 transitions, 660 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:32,179 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:51:32,179 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:51:32,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:51:33,690 INFO  L124   PetriNetUnfolderBase]: 2127/3145 cut-off events.
[2024-06-20 18:51:33,690 INFO  L125   PetriNetUnfolderBase]: For 22864/22864 co-relation queries the response was YES.
[2024-06-20 18:51:33,698 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14507 conditions, 3145 events. 2127/3145 cut-off events. For 22864/22864 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14321 event pairs, 700 based on Foata normal form. 6/3150 useless extension candidates. Maximal degree in co-relation 14473. Up to 3007 conditions per place. 
[2024-06-20 18:51:33,712 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 97 selfloop transitions, 23 changer transitions 0/123 dead transitions.
[2024-06-20 18:51:33,712 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 123 transitions, 1142 flow
[2024-06-20 18:51:33,713 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:51:33,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:51:33,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions.
[2024-06-20 18:51:33,714 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44947735191637633
[2024-06-20 18:51:33,714 INFO  L175             Difference]: Start difference. First operand has 74 places, 88 transitions, 660 flow. Second operand 7 states and 129 transitions.
[2024-06-20 18:51:33,714 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 123 transitions, 1142 flow
[2024-06-20 18:51:33,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 1098 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-20 18:51:33,739 INFO  L231             Difference]: Finished difference. Result has 81 places, 96 transitions, 768 flow
[2024-06-20 18:51:33,739 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=768, PETRI_PLACES=81, PETRI_TRANSITIONS=96}
[2024-06-20 18:51:33,740 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places.
[2024-06-20 18:51:33,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 81 places, 96 transitions, 768 flow
[2024-06-20 18:51:33,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:33,740 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:51:33,740 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:51:33,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-20 18:51:33,741 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:51:33,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:51:33,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -1691865281, now seen corresponding path program 3 times
[2024-06-20 18:51:33,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:51:33,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238949249]
[2024-06-20 18:51:33,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:51:33,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:51:33,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:51:41,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:51:41,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:51:41,653 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238949249]
[2024-06-20 18:51:41,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238949249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:51:41,653 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:51:41,653 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:51:41,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612830920]
[2024-06-20 18:51:41,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:51:41,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:51:41,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:51:41,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:51:41,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:51:41,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:51:41,767 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 96 transitions, 768 flow. Second operand  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:41,767 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:51:41,767 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:51:41,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:51:43,007 INFO  L124   PetriNetUnfolderBase]: 2131/3151 cut-off events.
[2024-06-20 18:51:43,008 INFO  L125   PetriNetUnfolderBase]: For 27428/27428 co-relation queries the response was YES.
[2024-06-20 18:51:43,015 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15155 conditions, 3151 events. 2131/3151 cut-off events. For 27428/27428 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14366 event pairs, 694 based on Foata normal form. 6/3156 useless extension candidates. Maximal degree in co-relation 15117. Up to 3076 conditions per place. 
[2024-06-20 18:51:43,025 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 99 selfloop transitions, 23 changer transitions 0/125 dead transitions.
[2024-06-20 18:51:43,025 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 1189 flow
[2024-06-20 18:51:43,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:51:43,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:51:43,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions.
[2024-06-20 18:51:43,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40853658536585363
[2024-06-20 18:51:43,027 INFO  L175             Difference]: Start difference. First operand has 81 places, 96 transitions, 768 flow. Second operand 8 states and 134 transitions.
[2024-06-20 18:51:43,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 1189 flow
[2024-06-20 18:51:43,045 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 125 transitions, 1138 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-20 18:51:43,048 INFO  L231             Difference]: Finished difference. Result has 88 places, 104 transitions, 872 flow
[2024-06-20 18:51:43,048 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=872, PETRI_PLACES=88, PETRI_TRANSITIONS=104}
[2024-06-20 18:51:43,048 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places.
[2024-06-20 18:51:43,049 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 872 flow
[2024-06-20 18:51:43,049 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:43,049 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:51:43,049 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:51:43,049 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-20 18:51:43,050 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-20 18:51:43,050 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:51:43,050 INFO  L85        PathProgramCache]: Analyzing trace with hash 115259863, now seen corresponding path program 1 times
[2024-06-20 18:51:43,050 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:51:43,050 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041523817]
[2024-06-20 18:51:43,051 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:51:43,051 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:51:43,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:51:54,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:51:54,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:51:54,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041523817]
[2024-06-20 18:51:54,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041523817] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:51:54,755 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:51:54,755 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:51:54,755 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437258588]
[2024-06-20 18:51:54,755 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:51:54,755 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:51:54,756 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:51:54,756 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:51:54,756 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:51:54,926 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:51:54,928 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 872 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:54,928 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:51:54,928 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:51:54,928 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:51:56,230 INFO  L124   PetriNetUnfolderBase]: 2134/3156 cut-off events.
[2024-06-20 18:51:56,231 INFO  L125   PetriNetUnfolderBase]: For 30079/30079 co-relation queries the response was YES.
[2024-06-20 18:51:56,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15536 conditions, 3156 events. 2134/3156 cut-off events. For 30079/30079 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14430 event pairs, 673 based on Foata normal form. 6/3161 useless extension candidates. Maximal degree in co-relation 15495. Up to 3061 conditions per place. 
[2024-06-20 18:51:56,249 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 99 selfloop transitions, 26 changer transitions 0/128 dead transitions.
[2024-06-20 18:51:56,249 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 1254 flow
[2024-06-20 18:51:56,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:51:56,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:51:56,250 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 18:51:56,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-20 18:51:56,250 INFO  L175             Difference]: Start difference. First operand has 88 places, 104 transitions, 872 flow. Second operand 7 states and 126 transitions.
[2024-06-20 18:51:56,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 128 transitions, 1254 flow
[2024-06-20 18:51:56,268 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 128 transitions, 1199 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-20 18:51:56,270 INFO  L231             Difference]: Finished difference. Result has 91 places, 107 transitions, 915 flow
[2024-06-20 18:51:56,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=915, PETRI_PLACES=91, PETRI_TRANSITIONS=107}
[2024-06-20 18:51:56,270 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places.
[2024-06-20 18:51:56,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 915 flow
[2024-06-20 18:51:56,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:51:56,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:51:56,271 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:51:56,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-20 18:51:56,271 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:51:56,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:51:56,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -842309822, now seen corresponding path program 1 times
[2024-06-20 18:51:56,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:51:56,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273318994]
[2024-06-20 18:51:56,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:51:56,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:51:56,311 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:52:07,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:52:07,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:52:07,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273318994]
[2024-06-20 18:52:07,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273318994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:52:07,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:52:07,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-20 18:52:07,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857106513]
[2024-06-20 18:52:07,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:52:07,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-20 18:52:07,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:52:07,867 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-20 18:52:07,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-20 18:52:07,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:52:07,939 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 915 flow. Second operand  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:07,939 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:52:07,939 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:52:07,939 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:52:09,145 INFO  L124   PetriNetUnfolderBase]: 2131/3152 cut-off events.
[2024-06-20 18:52:09,145 INFO  L125   PetriNetUnfolderBase]: For 32999/32999 co-relation queries the response was YES.
[2024-06-20 18:52:09,153 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15981 conditions, 3152 events. 2131/3152 cut-off events. For 32999/32999 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14357 event pairs, 697 based on Foata normal form. 1/3152 useless extension candidates. Maximal degree in co-relation 15939. Up to 3137 conditions per place. 
[2024-06-20 18:52:09,162 INFO  L140   encePairwiseOnDemand]: 34/41 looper letters, 102 selfloop transitions, 9 changer transitions 0/114 dead transitions.
[2024-06-20 18:52:09,162 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 114 transitions, 1155 flow
[2024-06-20 18:52:09,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-20 18:52:09,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-20 18:52:09,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions.
[2024-06-20 18:52:09,163 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40487804878048783
[2024-06-20 18:52:09,163 INFO  L175             Difference]: Start difference. First operand has 91 places, 107 transitions, 915 flow. Second operand 5 states and 83 transitions.
[2024-06-20 18:52:09,163 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 114 transitions, 1155 flow
[2024-06-20 18:52:09,181 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 114 transitions, 1073 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-20 18:52:09,182 INFO  L231             Difference]: Finished difference. Result has 91 places, 107 transitions, 857 flow
[2024-06-20 18:52:09,183 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=857, PETRI_PLACES=91, PETRI_TRANSITIONS=107}
[2024-06-20 18:52:09,183 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 49 predicate places.
[2024-06-20 18:52:09,183 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 857 flow
[2024-06-20 18:52:09,184 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:09,184 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:52:09,184 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:52:09,184 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-20 18:52:09,184 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:52:09,185 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:52:09,185 INFO  L85        PathProgramCache]: Analyzing trace with hash 1600057850, now seen corresponding path program 1 times
[2024-06-20 18:52:09,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:52:09,185 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170817199]
[2024-06-20 18:52:09,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:52:09,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:52:09,240 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:52:18,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:52:18,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:52:18,186 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170817199]
[2024-06-20 18:52:18,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170817199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:52:18,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:52:18,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:52:18,186 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969199808]
[2024-06-20 18:52:18,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:52:18,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:52:18,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:52:18,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:52:18,187 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:52:18,393 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:52:18,393 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 857 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:18,393 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:52:18,393 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:52:18,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:52:19,605 INFO  L124   PetriNetUnfolderBase]: 2008/3035 cut-off events.
[2024-06-20 18:52:19,605 INFO  L125   PetriNetUnfolderBase]: For 35200/35236 co-relation queries the response was YES.
[2024-06-20 18:52:19,613 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15412 conditions, 3035 events. 2008/3035 cut-off events. For 35200/35236 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14341 event pairs, 612 based on Foata normal form. 14/3028 useless extension candidates. Maximal degree in co-relation 15369. Up to 2758 conditions per place. 
[2024-06-20 18:52:19,621 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 96 selfloop transitions, 27 changer transitions 0/139 dead transitions.
[2024-06-20 18:52:19,621 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 139 transitions, 1307 flow
[2024-06-20 18:52:19,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:52:19,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:52:19,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions.
[2024-06-20 18:52:19,624 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47038327526132406
[2024-06-20 18:52:19,624 INFO  L175             Difference]: Start difference. First operand has 91 places, 107 transitions, 857 flow. Second operand 7 states and 135 transitions.
[2024-06-20 18:52:19,624 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 139 transitions, 1307 flow
[2024-06-20 18:52:19,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 139 transitions, 1287 flow, removed 3 selfloop flow, removed 3 redundant places.
[2024-06-20 18:52:19,654 INFO  L231             Difference]: Finished difference. Result has 95 places, 113 transitions, 985 flow
[2024-06-20 18:52:19,655 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=985, PETRI_PLACES=95, PETRI_TRANSITIONS=113}
[2024-06-20 18:52:19,655 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 53 predicate places.
[2024-06-20 18:52:19,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 113 transitions, 985 flow
[2024-06-20 18:52:19,656 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:19,656 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:52:19,656 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:52:19,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-20 18:52:19,656 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:52:19,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:52:19,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -1929373294, now seen corresponding path program 2 times
[2024-06-20 18:52:19,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:52:19,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823140428]
[2024-06-20 18:52:19,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:52:19,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:52:19,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:52:27,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:52:27,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:52:27,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823140428]
[2024-06-20 18:52:27,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823140428] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:52:27,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:52:27,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:52:27,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044980752]
[2024-06-20 18:52:27,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:52:27,935 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:52:27,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:52:27,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:52:27,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:52:28,072 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:52:28,073 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 113 transitions, 985 flow. Second operand  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:28,073 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:52:28,073 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:52:28,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:52:29,247 INFO  L124   PetriNetUnfolderBase]: 2003/3028 cut-off events.
[2024-06-20 18:52:29,247 INFO  L125   PetriNetUnfolderBase]: For 39942/39978 co-relation queries the response was YES.
[2024-06-20 18:52:29,255 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16008 conditions, 3028 events. 2003/3028 cut-off events. For 39942/39978 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 14288 event pairs, 612 based on Foata normal form. 14/3021 useless extension candidates. Maximal degree in co-relation 15964. Up to 2786 conditions per place. 
[2024-06-20 18:52:29,264 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 95 selfloop transitions, 23 changer transitions 0/134 dead transitions.
[2024-06-20 18:52:29,264 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 134 transitions, 1277 flow
[2024-06-20 18:52:29,266 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:52:29,266 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:52:29,266 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 18:52:29,266 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4529616724738676
[2024-06-20 18:52:29,267 INFO  L175             Difference]: Start difference. First operand has 95 places, 113 transitions, 985 flow. Second operand 7 states and 130 transitions.
[2024-06-20 18:52:29,267 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 134 transitions, 1277 flow
[2024-06-20 18:52:29,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 1194 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-20 18:52:29,308 INFO  L231             Difference]: Finished difference. Result has 99 places, 113 transitions, 956 flow
[2024-06-20 18:52:29,308 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=956, PETRI_PLACES=99, PETRI_TRANSITIONS=113}
[2024-06-20 18:52:29,309 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 57 predicate places.
[2024-06-20 18:52:29,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 99 places, 113 transitions, 956 flow
[2024-06-20 18:52:29,309 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:29,309 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:52:29,309 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:52:29,310 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-20 18:52:29,310 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:52:29,310 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:52:29,310 INFO  L85        PathProgramCache]: Analyzing trace with hash 1600211455, now seen corresponding path program 1 times
[2024-06-20 18:52:29,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:52:29,310 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725138456]
[2024-06-20 18:52:29,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:52:29,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:52:29,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:52:38,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:52:38,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:52:38,334 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725138456]
[2024-06-20 18:52:38,334 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725138456] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:52:38,334 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:52:38,334 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:52:38,334 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860041786]
[2024-06-20 18:52:38,335 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:52:38,335 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:52:38,335 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:52:38,336 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:52:38,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:52:38,411 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:52:38,412 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 113 transitions, 956 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:38,412 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:52:38,412 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:52:38,412 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:52:39,691 INFO  L124   PetriNetUnfolderBase]: 2221/3283 cut-off events.
[2024-06-20 18:52:39,691 INFO  L125   PetriNetUnfolderBase]: For 46969/46971 co-relation queries the response was YES.
[2024-06-20 18:52:39,704 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17721 conditions, 3283 events. 2221/3283 cut-off events. For 46969/46971 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 15052 event pairs, 639 based on Foata normal form. 8/3290 useless extension candidates. Maximal degree in co-relation 17675. Up to 2821 conditions per place. 
[2024-06-20 18:52:39,714 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 102 selfloop transitions, 48 changer transitions 0/153 dead transitions.
[2024-06-20 18:52:39,714 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 153 transitions, 1632 flow
[2024-06-20 18:52:39,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:52:39,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:52:39,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-20 18:52:39,715 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4808362369337979
[2024-06-20 18:52:39,715 INFO  L175             Difference]: Start difference. First operand has 99 places, 113 transitions, 956 flow. Second operand 7 states and 138 transitions.
[2024-06-20 18:52:39,715 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 153 transitions, 1632 flow
[2024-06-20 18:52:39,750 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 153 transitions, 1575 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 18:52:39,752 INFO  L231             Difference]: Finished difference. Result has 102 places, 122 transitions, 1164 flow
[2024-06-20 18:52:39,752 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1164, PETRI_PLACES=102, PETRI_TRANSITIONS=122}
[2024-06-20 18:52:39,753 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places.
[2024-06-20 18:52:39,753 INFO  L495      AbstractCegarLoop]: Abstraction has has 102 places, 122 transitions, 1164 flow
[2024-06-20 18:52:39,753 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:39,754 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:52:39,754 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:52:39,754 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-20 18:52:39,754 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:52:39,754 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:52:39,754 INFO  L85        PathProgramCache]: Analyzing trace with hash 667220215, now seen corresponding path program 2 times
[2024-06-20 18:52:39,755 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:52:39,755 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860179856]
[2024-06-20 18:52:39,755 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:52:39,755 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:52:39,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:52:46,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:52:46,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:52:46,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860179856]
[2024-06-20 18:52:46,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860179856] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:52:46,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:52:46,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:52:46,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983261584]
[2024-06-20 18:52:46,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:52:46,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:52:46,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:52:46,643 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:52:46,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:52:46,742 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:52:46,743 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 122 transitions, 1164 flow. Second operand  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:46,743 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:52:46,743 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:52:46,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:52:47,954 INFO  L124   PetriNetUnfolderBase]: 2209/3267 cut-off events.
[2024-06-20 18:52:47,954 INFO  L125   PetriNetUnfolderBase]: For 53212/53214 co-relation queries the response was YES.
[2024-06-20 18:52:47,965 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18655 conditions, 3267 events. 2209/3267 cut-off events. For 53212/53214 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 14986 event pairs, 636 based on Foata normal form. 8/3274 useless extension candidates. Maximal degree in co-relation 18606. Up to 2815 conditions per place. 
[2024-06-20 18:52:47,976 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 104 selfloop transitions, 50 changer transitions 0/157 dead transitions.
[2024-06-20 18:52:47,976 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 157 transitions, 1758 flow
[2024-06-20 18:52:47,976 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:52:47,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:52:47,977 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions.
[2024-06-20 18:52:47,977 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5650406504065041
[2024-06-20 18:52:47,977 INFO  L175             Difference]: Start difference. First operand has 102 places, 122 transitions, 1164 flow. Second operand 6 states and 139 transitions.
[2024-06-20 18:52:47,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 157 transitions, 1758 flow
[2024-06-20 18:52:48,016 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 157 transitions, 1662 flow, removed 26 selfloop flow, removed 3 redundant places.
[2024-06-20 18:52:48,019 INFO  L231             Difference]: Finished difference. Result has 107 places, 125 transitions, 1272 flow
[2024-06-20 18:52:48,019 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1272, PETRI_PLACES=107, PETRI_TRANSITIONS=125}
[2024-06-20 18:52:48,020 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 65 predicate places.
[2024-06-20 18:52:48,020 INFO  L495      AbstractCegarLoop]: Abstraction has has 107 places, 125 transitions, 1272 flow
[2024-06-20 18:52:48,020 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:48,020 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:52:48,020 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:52:48,021 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-20 18:52:48,021 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:52:48,021 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:52:48,021 INFO  L85        PathProgramCache]: Analyzing trace with hash 946473554, now seen corresponding path program 1 times
[2024-06-20 18:52:48,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:52:48,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453155146]
[2024-06-20 18:52:48,022 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:52:48,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:52:48,095 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:52:57,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:52:57,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:52:57,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453155146]
[2024-06-20 18:52:57,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453155146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:52:57,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:52:57,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:52:57,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051536332]
[2024-06-20 18:52:57,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:52:57,056 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:52:57,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:52:57,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:52:57,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:52:57,242 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:52:57,242 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 125 transitions, 1272 flow. Second operand  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:57,242 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:52:57,242 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:52:57,243 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:52:58,520 INFO  L124   PetriNetUnfolderBase]: 2211/3268 cut-off events.
[2024-06-20 18:52:58,520 INFO  L125   PetriNetUnfolderBase]: For 57685/57685 co-relation queries the response was YES.
[2024-06-20 18:52:58,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19267 conditions, 3268 events. 2211/3268 cut-off events. For 57685/57685 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14956 event pairs, 669 based on Foata normal form. 3/3270 useless extension candidates. Maximal degree in co-relation 19216. Up to 3162 conditions per place. 
[2024-06-20 18:52:58,540 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 115 selfloop transitions, 31 changer transitions 0/149 dead transitions.
[2024-06-20 18:52:58,540 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 149 transitions, 1708 flow
[2024-06-20 18:52:58,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:52:58,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:52:58,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 18:52:58,542 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-20 18:52:58,542 INFO  L175             Difference]: Start difference. First operand has 107 places, 125 transitions, 1272 flow. Second operand 7 states and 126 transitions.
[2024-06-20 18:52:58,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 149 transitions, 1708 flow
[2024-06-20 18:52:58,591 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 149 transitions, 1614 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 18:52:58,594 INFO  L231             Difference]: Finished difference. Result has 110 places, 129 transitions, 1318 flow
[2024-06-20 18:52:58,594 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1318, PETRI_PLACES=110, PETRI_TRANSITIONS=129}
[2024-06-20 18:52:58,595 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places.
[2024-06-20 18:52:58,595 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 129 transitions, 1318 flow
[2024-06-20 18:52:58,595 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:52:58,595 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:52:58,596 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:52:58,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-20 18:52:58,596 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:52:58,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:52:58,597 INFO  L85        PathProgramCache]: Analyzing trace with hash -908214863, now seen corresponding path program 3 times
[2024-06-20 18:52:58,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:52:58,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557996875]
[2024-06-20 18:52:58,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:52:58,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:52:58,652 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:53:07,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:53:07,057 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:53:07,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557996875]
[2024-06-20 18:53:07,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557996875] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:53:07,057 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:53:07,057 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:53:07,057 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112478470]
[2024-06-20 18:53:07,057 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:53:07,058 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:53:07,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:53:07,058 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:53:07,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:53:07,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:53:07,195 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 129 transitions, 1318 flow. Second operand  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:07,195 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:53:07,195 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:53:07,195 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:53:08,574 INFO  L124   PetriNetUnfolderBase]: 2215/3275 cut-off events.
[2024-06-20 18:53:08,574 INFO  L125   PetriNetUnfolderBase]: For 61901/61907 co-relation queries the response was YES.
[2024-06-20 18:53:08,583 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19532 conditions, 3275 events. 2215/3275 cut-off events. For 61901/61907 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15013 event pairs, 672 based on Foata normal form. 12/3286 useless extension candidates. Maximal degree in co-relation 19480. Up to 3167 conditions per place. 
[2024-06-20 18:53:08,592 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 127 selfloop transitions, 24 changer transitions 0/154 dead transitions.
[2024-06-20 18:53:08,592 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 154 transitions, 1773 flow
[2024-06-20 18:53:08,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:53:08,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:53:08,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 18:53:08,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-20 18:53:08,593 INFO  L175             Difference]: Start difference. First operand has 110 places, 129 transitions, 1318 flow. Second operand 7 states and 126 transitions.
[2024-06-20 18:53:08,594 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 154 transitions, 1773 flow
[2024-06-20 18:53:08,634 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 154 transitions, 1685 flow, removed 18 selfloop flow, removed 5 redundant places.
[2024-06-20 18:53:08,636 INFO  L231             Difference]: Finished difference. Result has 112 places, 133 transitions, 1354 flow
[2024-06-20 18:53:08,636 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1354, PETRI_PLACES=112, PETRI_TRANSITIONS=133}
[2024-06-20 18:53:08,637 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 70 predicate places.
[2024-06-20 18:53:08,637 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 133 transitions, 1354 flow
[2024-06-20 18:53:08,637 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:08,637 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:53:08,637 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:53:08,638 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-20 18:53:08,638 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:53:08,638 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:53:08,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -341799338, now seen corresponding path program 1 times
[2024-06-20 18:53:08,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:53:08,638 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695444392]
[2024-06-20 18:53:08,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:53:08,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:53:08,670 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:53:22,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:53:22,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:53:22,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695444392]
[2024-06-20 18:53:22,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695444392] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:53:22,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:53:22,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:53:22,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451958241]
[2024-06-20 18:53:22,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:53:22,229 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:53:22,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:53:22,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:53:22,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:53:22,344 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:53:22,345 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 133 transitions, 1354 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:22,345 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:53:22,345 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:53:22,345 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:53:23,585 INFO  L124   PetriNetUnfolderBase]: 2206/3262 cut-off events.
[2024-06-20 18:53:23,586 INFO  L125   PetriNetUnfolderBase]: For 66058/66058 co-relation queries the response was YES.
[2024-06-20 18:53:23,596 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19738 conditions, 3262 events. 2206/3262 cut-off events. For 66058/66058 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14819 event pairs, 674 based on Foata normal form. 3/3264 useless extension candidates. Maximal degree in co-relation 19685. Up to 3238 conditions per place. 
[2024-06-20 18:53:23,606 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 131 selfloop transitions, 12 changer transitions 0/146 dead transitions.
[2024-06-20 18:53:23,606 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 146 transitions, 1690 flow
[2024-06-20 18:53:23,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:53:23,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:53:23,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-20 18:53:23,607 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3943089430894309
[2024-06-20 18:53:23,608 INFO  L175             Difference]: Start difference. First operand has 112 places, 133 transitions, 1354 flow. Second operand 6 states and 97 transitions.
[2024-06-20 18:53:23,608 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 146 transitions, 1690 flow
[2024-06-20 18:53:23,651 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 146 transitions, 1617 flow, removed 15 selfloop flow, removed 5 redundant places.
[2024-06-20 18:53:23,654 INFO  L231             Difference]: Finished difference. Result has 113 places, 136 transitions, 1343 flow
[2024-06-20 18:53:23,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=113, PETRI_TRANSITIONS=136}
[2024-06-20 18:53:23,654 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places.
[2024-06-20 18:53:23,654 INFO  L495      AbstractCegarLoop]: Abstraction has has 113 places, 136 transitions, 1343 flow
[2024-06-20 18:53:23,654 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:23,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:53:23,655 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:53:23,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-20 18:53:23,655 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:53:23,655 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:53:23,655 INFO  L85        PathProgramCache]: Analyzing trace with hash -245636352, now seen corresponding path program 1 times
[2024-06-20 18:53:23,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:53:23,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194580176]
[2024-06-20 18:53:23,655 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:53:23,656 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:53:23,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:53:33,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:53:33,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:53:33,080 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194580176]
[2024-06-20 18:53:33,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194580176] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:53:33,080 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:53:33,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:53:33,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217171417]
[2024-06-20 18:53:33,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:53:33,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:53:33,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:53:33,081 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:53:33,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:53:33,284 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:53:33,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 136 transitions, 1343 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:33,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:53:33,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:53:33,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:53:34,634 INFO  L124   PetriNetUnfolderBase]: 2088/3153 cut-off events.
[2024-06-20 18:53:34,634 INFO  L125   PetriNetUnfolderBase]: For 68785/68836 co-relation queries the response was YES.
[2024-06-20 18:53:34,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19421 conditions, 3153 events. 2088/3153 cut-off events. For 68785/68836 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14988 event pairs, 452 based on Foata normal form. 15/3148 useless extension candidates. Maximal degree in co-relation 19367. Up to 2758 conditions per place. 
[2024-06-20 18:53:34,703 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 118 selfloop transitions, 33 changer transitions 0/172 dead transitions.
[2024-06-20 18:53:34,704 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 172 transitions, 1905 flow
[2024-06-20 18:53:34,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:53:34,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:53:34,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-20 18:53:34,706 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:53:34,706 INFO  L175             Difference]: Start difference. First operand has 113 places, 136 transitions, 1343 flow. Second operand 8 states and 152 transitions.
[2024-06-20 18:53:34,707 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 172 transitions, 1905 flow
[2024-06-20 18:53:34,748 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 172 transitions, 1865 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 18:53:34,751 INFO  L231             Difference]: Finished difference. Result has 117 places, 140 transitions, 1476 flow
[2024-06-20 18:53:34,751 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1476, PETRI_PLACES=117, PETRI_TRANSITIONS=140}
[2024-06-20 18:53:34,751 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 75 predicate places.
[2024-06-20 18:53:34,751 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 140 transitions, 1476 flow
[2024-06-20 18:53:34,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:34,752 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:53:34,752 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:53:34,752 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-20 18:53:34,752 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:53:34,753 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:53:34,753 INFO  L85        PathProgramCache]: Analyzing trace with hash -909100818, now seen corresponding path program 1 times
[2024-06-20 18:53:34,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:53:34,753 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457434119]
[2024-06-20 18:53:34,753 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:53:34,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:53:34,810 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:53:44,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-20 18:53:44,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:53:44,785 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457434119]
[2024-06-20 18:53:44,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457434119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:53:44,785 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:53:44,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:53:44,786 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045808647]
[2024-06-20 18:53:44,786 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:53:44,786 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:53:44,786 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:53:44,787 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:53:44,787 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:53:44,921 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:53:44,921 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 140 transitions, 1476 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:44,921 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:53:44,921 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:53:44,921 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:53:46,396 INFO  L124   PetriNetUnfolderBase]: 2307/3410 cut-off events.
[2024-06-20 18:53:46,396 INFO  L125   PetriNetUnfolderBase]: For 80183/80185 co-relation queries the response was YES.
[2024-06-20 18:53:46,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21550 conditions, 3410 events. 2307/3410 cut-off events. For 80183/80185 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 15835 event pairs, 535 based on Foata normal form. 8/3417 useless extension candidates. Maximal degree in co-relation 21495. Up to 2735 conditions per place. 
[2024-06-20 18:53:46,473 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 131 selfloop transitions, 57 changer transitions 0/191 dead transitions.
[2024-06-20 18:53:46,473 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 191 transitions, 2364 flow
[2024-06-20 18:53:46,474 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:53:46,474 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:53:46,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions.
[2024-06-20 18:53:46,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4878048780487805
[2024-06-20 18:53:46,474 INFO  L175             Difference]: Start difference. First operand has 117 places, 140 transitions, 1476 flow. Second operand 8 states and 160 transitions.
[2024-06-20 18:53:46,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 191 transitions, 2364 flow
[2024-06-20 18:53:46,526 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 191 transitions, 2272 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-20 18:53:46,528 INFO  L231             Difference]: Finished difference. Result has 123 places, 152 transitions, 1686 flow
[2024-06-20 18:53:46,529 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1686, PETRI_PLACES=123, PETRI_TRANSITIONS=152}
[2024-06-20 18:53:46,529 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places.
[2024-06-20 18:53:46,529 INFO  L495      AbstractCegarLoop]: Abstraction has has 123 places, 152 transitions, 1686 flow
[2024-06-20 18:53:46,529 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:46,530 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:53:46,530 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:53:46,530 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-20 18:53:46,530 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:53:46,530 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:53:46,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -909100942, now seen corresponding path program 2 times
[2024-06-20 18:53:46,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:53:46,531 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145520713]
[2024-06-20 18:53:46,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:53:46,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:53:46,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:53:55,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:53:55,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:53:55,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145520713]
[2024-06-20 18:53:55,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145520713] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:53:55,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:53:55,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:53:55,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345119792]
[2024-06-20 18:53:55,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:53:55,609 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:53:55,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:53:55,609 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:53:55,609 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:53:55,839 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:53:55,840 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 152 transitions, 1686 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:55,840 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:53:55,840 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:53:55,840 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:53:57,188 INFO  L124   PetriNetUnfolderBase]: 2215/3325 cut-off events.
[2024-06-20 18:53:57,188 INFO  L125   PetriNetUnfolderBase]: For 86772/86823 co-relation queries the response was YES.
[2024-06-20 18:53:57,199 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22013 conditions, 3325 events. 2215/3325 cut-off events. For 86772/86823 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15822 event pairs, 581 based on Foata normal form. 15/3320 useless extension candidates. Maximal degree in co-relation 21954. Up to 2997 conditions per place. 
[2024-06-20 18:53:57,210 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 130 selfloop transitions, 29 changer transitions 0/183 dead transitions.
[2024-06-20 18:53:57,210 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 183 transitions, 2118 flow
[2024-06-20 18:53:57,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:53:57,213 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:53:57,213 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions.
[2024-06-20 18:53:57,213 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45426829268292684
[2024-06-20 18:53:57,213 INFO  L175             Difference]: Start difference. First operand has 123 places, 152 transitions, 1686 flow. Second operand 8 states and 149 transitions.
[2024-06-20 18:53:57,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 183 transitions, 2118 flow
[2024-06-20 18:53:57,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 183 transitions, 1993 flow, removed 39 selfloop flow, removed 3 redundant places.
[2024-06-20 18:53:57,278 INFO  L231             Difference]: Finished difference. Result has 128 places, 154 transitions, 1666 flow
[2024-06-20 18:53:57,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1666, PETRI_PLACES=128, PETRI_TRANSITIONS=154}
[2024-06-20 18:53:57,278 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 86 predicate places.
[2024-06-20 18:53:57,279 INFO  L495      AbstractCegarLoop]: Abstraction has has 128 places, 154 transitions, 1666 flow
[2024-06-20 18:53:57,279 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:53:57,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:53:57,279 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:53:57,279 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-20 18:53:57,279 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:53:57,279 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:53:57,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 318976162, now seen corresponding path program 2 times
[2024-06-20 18:53:57,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:53:57,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676468532]
[2024-06-20 18:53:57,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:53:57,280 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:53:57,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:54:06,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:54:06,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:54:06,379 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676468532]
[2024-06-20 18:54:06,379 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676468532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:54:06,379 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:54:06,379 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:54:06,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328988517]
[2024-06-20 18:54:06,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:54:06,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:54:06,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:54:06,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:54:06,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:54:06,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:54:06,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 154 transitions, 1666 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:06,594 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:54:06,594 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:54:06,594 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:54:07,966 INFO  L124   PetriNetUnfolderBase]: 2360/3489 cut-off events.
[2024-06-20 18:54:07,966 INFO  L125   PetriNetUnfolderBase]: For 95780/95782 co-relation queries the response was YES.
[2024-06-20 18:54:07,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 23335 conditions, 3489 events. 2360/3489 cut-off events. For 95780/95782 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 16271 event pairs, 550 based on Foata normal form. 6/3494 useless extension candidates. Maximal degree in co-relation 23274. Up to 2944 conditions per place. 
[2024-06-20 18:54:07,988 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 130 selfloop transitions, 63 changer transitions 0/196 dead transitions.
[2024-06-20 18:54:07,989 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 196 transitions, 2469 flow
[2024-06-20 18:54:07,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:54:07,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:54:07,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions.
[2024-06-20 18:54:07,990 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47865853658536583
[2024-06-20 18:54:07,990 INFO  L175             Difference]: Start difference. First operand has 128 places, 154 transitions, 1666 flow. Second operand 8 states and 157 transitions.
[2024-06-20 18:54:07,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 196 transitions, 2469 flow
[2024-06-20 18:54:08,057 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 196 transitions, 2386 flow, removed 14 selfloop flow, removed 6 redundant places.
[2024-06-20 18:54:08,060 INFO  L231             Difference]: Finished difference. Result has 131 places, 161 transitions, 1861 flow
[2024-06-20 18:54:08,060 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1583, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1861, PETRI_PLACES=131, PETRI_TRANSITIONS=161}
[2024-06-20 18:54:08,060 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places.
[2024-06-20 18:54:08,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 1861 flow
[2024-06-20 18:54:08,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:08,061 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:54:08,061 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:54:08,061 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-20 18:54:08,061 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:54:08,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:54:08,062 INFO  L85        PathProgramCache]: Analyzing trace with hash 318971512, now seen corresponding path program 3 times
[2024-06-20 18:54:08,062 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:54:08,062 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251377274]
[2024-06-20 18:54:08,062 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:54:08,063 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:54:08,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:54:16,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:54:16,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:54:16,522 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251377274]
[2024-06-20 18:54:16,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251377274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:54:16,522 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:54:16,522 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:54:16,522 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349062587]
[2024-06-20 18:54:16,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:54:16,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:54:16,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:54:16,523 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:54:16,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:54:16,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:54:16,692 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 1861 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:16,692 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:54:16,692 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:54:16,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:54:18,144 INFO  L124   PetriNetUnfolderBase]: 2420/3574 cut-off events.
[2024-06-20 18:54:18,145 INFO  L125   PetriNetUnfolderBase]: For 105851/105853 co-relation queries the response was YES.
[2024-06-20 18:54:18,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25129 conditions, 3574 events. 2420/3574 cut-off events. For 105851/105853 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16706 event pairs, 569 based on Foata normal form. 8/3581 useless extension candidates. Maximal degree in co-relation 25066. Up to 3028 conditions per place. 
[2024-06-20 18:54:18,170 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 139 selfloop transitions, 60 changer transitions 0/202 dead transitions.
[2024-06-20 18:54:18,170 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 202 transitions, 2669 flow
[2024-06-20 18:54:18,171 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:54:18,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:54:18,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions.
[2024-06-20 18:54:18,172 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47560975609756095
[2024-06-20 18:54:18,172 INFO  L175             Difference]: Start difference. First operand has 131 places, 161 transitions, 1861 flow. Second operand 8 states and 156 transitions.
[2024-06-20 18:54:18,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 202 transitions, 2669 flow
[2024-06-20 18:54:18,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 202 transitions, 2540 flow, removed 24 selfloop flow, removed 5 redundant places.
[2024-06-20 18:54:18,265 INFO  L231             Difference]: Finished difference. Result has 135 places, 169 transitions, 2005 flow
[2024-06-20 18:54:18,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1732, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2005, PETRI_PLACES=135, PETRI_TRANSITIONS=169}
[2024-06-20 18:54:18,266 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 93 predicate places.
[2024-06-20 18:54:18,266 INFO  L495      AbstractCegarLoop]: Abstraction has has 135 places, 169 transitions, 2005 flow
[2024-06-20 18:54:18,266 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:18,266 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:54:18,266 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:54:18,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-20 18:54:18,267 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:54:18,267 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:54:18,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -795481912, now seen corresponding path program 3 times
[2024-06-20 18:54:18,267 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:54:18,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277181619]
[2024-06-20 18:54:18,267 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:54:18,267 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:54:18,325 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:54:28,059 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:54:28,059 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:54:28,060 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277181619]
[2024-06-20 18:54:28,060 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277181619] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:54:28,060 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:54:28,060 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:54:28,060 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584572868]
[2024-06-20 18:54:28,060 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:54:28,060 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:54:28,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:54:28,061 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:54:28,061 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:54:28,198 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:54:28,199 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 169 transitions, 2005 flow. Second operand  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:28,199 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:54:28,199 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:54:28,199 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:54:29,579 INFO  L124   PetriNetUnfolderBase]: 2295/3442 cut-off events.
[2024-06-20 18:54:29,579 INFO  L125   PetriNetUnfolderBase]: For 110373/110425 co-relation queries the response was YES.
[2024-06-20 18:54:29,594 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24506 conditions, 3442 events. 2295/3442 cut-off events. For 110373/110425 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16463 event pairs, 573 based on Foata normal form. 16/3438 useless extension candidates. Maximal degree in co-relation 24441. Up to 3129 conditions per place. 
[2024-06-20 18:54:29,607 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 142 selfloop transitions, 25 changer transitions 0/195 dead transitions.
[2024-06-20 18:54:29,607 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 195 transitions, 2407 flow
[2024-06-20 18:54:29,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:54:29,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:54:29,610 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 18:54:29,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-20 18:54:29,610 INFO  L175             Difference]: Start difference. First operand has 135 places, 169 transitions, 2005 flow. Second operand 8 states and 146 transitions.
[2024-06-20 18:54:29,610 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 195 transitions, 2407 flow
[2024-06-20 18:54:29,760 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 2260 flow, removed 43 selfloop flow, removed 4 redundant places.
[2024-06-20 18:54:29,763 INFO  L231             Difference]: Finished difference. Result has 139 places, 169 transitions, 1915 flow
[2024-06-20 18:54:29,763 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1915, PETRI_PLACES=139, PETRI_TRANSITIONS=169}
[2024-06-20 18:54:29,763 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places.
[2024-06-20 18:54:29,763 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 169 transitions, 1915 flow
[2024-06-20 18:54:29,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:29,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:54:29,764 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:54:29,764 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-20 18:54:29,764 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:54:29,764 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:54:29,764 INFO  L85        PathProgramCache]: Analyzing trace with hash -791013138, now seen corresponding path program 4 times
[2024-06-20 18:54:29,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:54:29,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459505972]
[2024-06-20 18:54:29,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:54:29,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:54:29,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:54:39,480 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:54:39,481 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:54:39,481 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459505972]
[2024-06-20 18:54:39,481 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459505972] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:54:39,481 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:54:39,481 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:54:39,481 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123255991]
[2024-06-20 18:54:39,481 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:54:39,482 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:54:39,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:54:39,482 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:54:39,483 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:54:39,615 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:54:39,616 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 169 transitions, 1915 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:39,616 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:54:39,616 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:54:39,616 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:54:41,223 INFO  L124   PetriNetUnfolderBase]: 2448/3614 cut-off events.
[2024-06-20 18:54:41,224 INFO  L125   PetriNetUnfolderBase]: For 119095/119097 co-relation queries the response was YES.
[2024-06-20 18:54:41,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25917 conditions, 3614 events. 2448/3614 cut-off events. For 119095/119097 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16935 event pairs, 527 based on Foata normal form. 8/3621 useless extension candidates. Maximal degree in co-relation 25850. Up to 3011 conditions per place. 
[2024-06-20 18:54:41,254 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 149 selfloop transitions, 63 changer transitions 0/215 dead transitions.
[2024-06-20 18:54:41,254 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 215 transitions, 2856 flow
[2024-06-20 18:54:41,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:54:41,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:54:41,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-20 18:54:41,256 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-20 18:54:41,256 INFO  L175             Difference]: Start difference. First operand has 139 places, 169 transitions, 1915 flow. Second operand 8 states and 164 transitions.
[2024-06-20 18:54:41,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 215 transitions, 2856 flow
[2024-06-20 18:54:41,351 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 215 transitions, 2791 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-20 18:54:41,353 INFO  L231             Difference]: Finished difference. Result has 141 places, 174 transitions, 2103 flow
[2024-06-20 18:54:41,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2103, PETRI_PLACES=141, PETRI_TRANSITIONS=174}
[2024-06-20 18:54:41,354 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places.
[2024-06-20 18:54:41,354 INFO  L495      AbstractCegarLoop]: Abstraction has has 141 places, 174 transitions, 2103 flow
[2024-06-20 18:54:41,354 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:41,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:54:41,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:54:41,355 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-20 18:54:41,355 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:54:41,355 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:54:41,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -791008488, now seen corresponding path program 5 times
[2024-06-20 18:54:41,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:54:41,356 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698276241]
[2024-06-20 18:54:41,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:54:41,356 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:54:41,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:54:52,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:54:52,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:54:52,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698276241]
[2024-06-20 18:54:52,132 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698276241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:54:52,132 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:54:52,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:54:52,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578257573]
[2024-06-20 18:54:52,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:54:52,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:54:52,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:54:52,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:54:52,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:54:52,330 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:54:52,331 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 174 transitions, 2103 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:52,331 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:54:52,331 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:54:52,331 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:54:53,877 INFO  L124   PetriNetUnfolderBase]: 2484/3666 cut-off events.
[2024-06-20 18:54:53,877 INFO  L125   PetriNetUnfolderBase]: For 130425/130427 co-relation queries the response was YES.
[2024-06-20 18:54:53,895 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27224 conditions, 3666 events. 2484/3666 cut-off events. For 130425/130427 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17209 event pairs, 523 based on Foata normal form. 6/3671 useless extension candidates. Maximal degree in co-relation 27155. Up to 3121 conditions per place. 
[2024-06-20 18:54:53,979 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 144 selfloop transitions, 71 changer transitions 0/218 dead transitions.
[2024-06-20 18:54:53,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 218 transitions, 3019 flow
[2024-06-20 18:54:53,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:54:53,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:54:53,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-20 18:54:53,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4847560975609756
[2024-06-20 18:54:53,981 INFO  L175             Difference]: Start difference. First operand has 141 places, 174 transitions, 2103 flow. Second operand 8 states and 159 transitions.
[2024-06-20 18:54:53,981 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 218 transitions, 3019 flow
[2024-06-20 18:54:54,082 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 218 transitions, 2758 flow, removed 41 selfloop flow, removed 7 redundant places.
[2024-06-20 18:54:54,085 INFO  L231             Difference]: Finished difference. Result has 143 places, 181 transitions, 2166 flow
[2024-06-20 18:54:54,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2166, PETRI_PLACES=143, PETRI_TRANSITIONS=181}
[2024-06-20 18:54:54,085 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places.
[2024-06-20 18:54:54,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 2166 flow
[2024-06-20 18:54:54,086 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:54:54,086 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:54:54,086 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:54:54,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-20 18:54:54,086 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:54:54,087 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:54:54,087 INFO  L85        PathProgramCache]: Analyzing trace with hash 434440312, now seen corresponding path program 6 times
[2024-06-20 18:54:54,087 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:54:54,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865936888]
[2024-06-20 18:54:54,088 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:54:54,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:54:54,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:55:03,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:55:03,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:55:03,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865936888]
[2024-06-20 18:55:03,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865936888] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:55:03,904 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:55:03,904 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:55:03,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196786134]
[2024-06-20 18:55:03,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:55:03,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:55:03,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:55:03,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:55:03,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:55:04,137 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:55:04,137 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 181 transitions, 2166 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:04,137 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:55:04,137 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:55:04,137 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:55:05,620 INFO  L124   PetriNetUnfolderBase]: 2520/3718 cut-off events.
[2024-06-20 18:55:05,620 INFO  L125   PetriNetUnfolderBase]: For 139845/139847 co-relation queries the response was YES.
[2024-06-20 18:55:05,639 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27717 conditions, 3718 events. 2520/3718 cut-off events. For 139845/139847 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 17537 event pairs, 527 based on Foata normal form. 8/3725 useless extension candidates. Maximal degree in co-relation 27647. Up to 3235 conditions per place. 
[2024-06-20 18:55:05,657 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 157 selfloop transitions, 56 changer transitions 0/216 dead transitions.
[2024-06-20 18:55:05,658 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 216 transitions, 2878 flow
[2024-06-20 18:55:05,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:55:05,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:55:05,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-20 18:55:05,659 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4634146341463415
[2024-06-20 18:55:05,659 INFO  L175             Difference]: Start difference. First operand has 143 places, 181 transitions, 2166 flow. Second operand 8 states and 152 transitions.
[2024-06-20 18:55:05,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 216 transitions, 2878 flow
[2024-06-20 18:55:05,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 216 transitions, 2751 flow, removed 29 selfloop flow, removed 4 redundant places.
[2024-06-20 18:55:05,779 INFO  L231             Difference]: Finished difference. Result has 147 places, 185 transitions, 2252 flow
[2024-06-20 18:55:05,779 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2039, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2252, PETRI_PLACES=147, PETRI_TRANSITIONS=185}
[2024-06-20 18:55:05,780 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places.
[2024-06-20 18:55:05,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 185 transitions, 2252 flow
[2024-06-20 18:55:05,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:05,780 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:55:05,780 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:55:05,780 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-20 18:55:05,781 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-20 18:55:05,781 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:55:05,781 INFO  L85        PathProgramCache]: Analyzing trace with hash 434447256, now seen corresponding path program 1 times
[2024-06-20 18:55:05,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:55:05,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400937771]
[2024-06-20 18:55:05,783 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:55:05,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:55:05,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:55:16,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-20 18:55:16,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:55:16,198 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400937771]
[2024-06-20 18:55:16,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400937771] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:55:16,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:55:16,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:55:16,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848713907]
[2024-06-20 18:55:16,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:55:16,199 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:55:16,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:55:16,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:55:16,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:55:16,416 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:55:16,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 185 transitions, 2252 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:16,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:55:16,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:55:16,417 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:55:18,167 INFO  L124   PetriNetUnfolderBase]: 2576/3806 cut-off events.
[2024-06-20 18:55:18,168 INFO  L125   PetriNetUnfolderBase]: For 153085/153087 co-relation queries the response was YES.
[2024-06-20 18:55:18,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28496 conditions, 3806 events. 2576/3806 cut-off events. For 153085/153087 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 18045 event pairs, 549 based on Foata normal form. 14/3819 useless extension candidates. Maximal degree in co-relation 28425. Up to 3305 conditions per place. 
[2024-06-20 18:55:18,197 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 164 selfloop transitions, 54 changer transitions 0/221 dead transitions.
[2024-06-20 18:55:18,197 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 221 transitions, 3036 flow
[2024-06-20 18:55:18,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:55:18,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:55:18,198 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-20 18:55:18,199 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4725609756097561
[2024-06-20 18:55:18,199 INFO  L175             Difference]: Start difference. First operand has 147 places, 185 transitions, 2252 flow. Second operand 8 states and 155 transitions.
[2024-06-20 18:55:18,199 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 221 transitions, 3036 flow
[2024-06-20 18:55:18,302 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 221 transitions, 2865 flow, removed 32 selfloop flow, removed 6 redundant places.
[2024-06-20 18:55:18,305 INFO  L231             Difference]: Finished difference. Result has 149 places, 189 transitions, 2288 flow
[2024-06-20 18:55:18,305 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2081, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2288, PETRI_PLACES=149, PETRI_TRANSITIONS=189}
[2024-06-20 18:55:18,305 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places.
[2024-06-20 18:55:18,306 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 189 transitions, 2288 flow
[2024-06-20 18:55:18,306 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:18,306 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:55:18,306 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:55:18,306 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-20 18:55:18,306 INFO  L420      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:55:18,306 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:55:18,307 INFO  L85        PathProgramCache]: Analyzing trace with hash -283223773, now seen corresponding path program 1 times
[2024-06-20 18:55:18,307 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:55:18,307 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456185295]
[2024-06-20 18:55:18,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:55:18,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:55:18,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:55:27,532 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:55:27,533 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:55:27,533 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456185295]
[2024-06-20 18:55:27,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456185295] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:55:27,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:55:27,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:55:27,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814090476]
[2024-06-20 18:55:27,533 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:55:27,533 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:55:27,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:55:27,534 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:55:27,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:55:27,652 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:55:27,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 189 transitions, 2288 flow. Second operand  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:27,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:55:27,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:55:27,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:55:28,931 INFO  L124   PetriNetUnfolderBase]: 2581/3811 cut-off events.
[2024-06-20 18:55:28,931 INFO  L125   PetriNetUnfolderBase]: For 155941/155941 co-relation queries the response was YES.
[2024-06-20 18:55:28,948 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29041 conditions, 3811 events. 2581/3811 cut-off events. For 155941/155941 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17988 event pairs, 645 based on Foata normal form. 1/3811 useless extension candidates. Maximal degree in co-relation 28969. Up to 3774 conditions per place. 
[2024-06-20 18:55:28,963 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 187 selfloop transitions, 17 changer transitions 0/207 dead transitions.
[2024-06-20 18:55:28,963 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 207 transitions, 2857 flow
[2024-06-20 18:55:28,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:55:28,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:55:28,964 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions.
[2024-06-20 18:55:28,964 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42276422764227645
[2024-06-20 18:55:28,964 INFO  L175             Difference]: Start difference. First operand has 149 places, 189 transitions, 2288 flow. Second operand 6 states and 104 transitions.
[2024-06-20 18:55:28,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 207 transitions, 2857 flow
[2024-06-20 18:55:29,091 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 207 transitions, 2676 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-20 18:55:29,094 INFO  L231             Difference]: Finished difference. Result has 149 places, 192 transitions, 2206 flow
[2024-06-20 18:55:29,094 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2111, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2206, PETRI_PLACES=149, PETRI_TRANSITIONS=192}
[2024-06-20 18:55:29,095 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 107 predicate places.
[2024-06-20 18:55:29,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 149 places, 192 transitions, 2206 flow
[2024-06-20 18:55:29,095 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:29,095 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:55:29,095 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:55:29,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-20 18:55:29,096 INFO  L420      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:55:29,096 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:55:29,096 INFO  L85        PathProgramCache]: Analyzing trace with hash -49655982, now seen corresponding path program 2 times
[2024-06-20 18:55:29,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:55:29,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005950723]
[2024-06-20 18:55:29,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:55:29,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:55:29,143 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:55:38,833 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:55:38,834 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:55:38,834 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005950723]
[2024-06-20 18:55:38,834 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005950723] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:55:38,834 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:55:38,834 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:55:38,834 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766751458]
[2024-06-20 18:55:38,834 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:55:38,834 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:55:38,835 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:55:38,835 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:55:38,835 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:55:39,007 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:55:39,007 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 192 transitions, 2206 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:39,008 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:55:39,008 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:55:39,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:55:40,545 INFO  L124   PetriNetUnfolderBase]: 2609/3855 cut-off events.
[2024-06-20 18:55:40,545 INFO  L125   PetriNetUnfolderBase]: For 165025/165025 co-relation queries the response was YES.
[2024-06-20 18:55:40,564 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28872 conditions, 3855 events. 2609/3855 cut-off events. For 165025/165025 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18290 event pairs, 632 based on Foata normal form. 6/3860 useless extension candidates. Maximal degree in co-relation 28799. Up to 3696 conditions per place. 
[2024-06-20 18:55:40,580 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 188 selfloop transitions, 31 changer transitions 0/222 dead transitions.
[2024-06-20 18:55:40,580 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 222 transitions, 2922 flow
[2024-06-20 18:55:40,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:55:40,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:55:40,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 18:55:40,653 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-20 18:55:40,653 INFO  L175             Difference]: Start difference. First operand has 149 places, 192 transitions, 2206 flow. Second operand 8 states and 143 transitions.
[2024-06-20 18:55:40,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 222 transitions, 2922 flow
[2024-06-20 18:55:40,752 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 222 transitions, 2776 flow, removed 16 selfloop flow, removed 6 redundant places.
[2024-06-20 18:55:40,755 INFO  L231             Difference]: Finished difference. Result has 151 places, 195 transitions, 2216 flow
[2024-06-20 18:55:40,755 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2060, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2216, PETRI_PLACES=151, PETRI_TRANSITIONS=195}
[2024-06-20 18:55:40,755 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places.
[2024-06-20 18:55:40,756 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 195 transitions, 2216 flow
[2024-06-20 18:55:40,756 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:40,756 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:55:40,756 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:55:40,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-20 18:55:40,756 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-20 18:55:40,757 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:55:40,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 178238224, now seen corresponding path program 7 times
[2024-06-20 18:55:40,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:55:40,757 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522757229]
[2024-06-20 18:55:40,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:55:40,757 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:55:40,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:55:49,598 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:55:49,598 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:55:49,598 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522757229]
[2024-06-20 18:55:49,598 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522757229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:55:49,598 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:55:49,598 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:55:49,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494224339]
[2024-06-20 18:55:49,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:55:49,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:55:49,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:55:49,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:55:49,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:55:49,693 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:55:49,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 195 transitions, 2216 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:49,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:55:49,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:55:49,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:55:51,249 INFO  L124   PetriNetUnfolderBase]: 2626/3881 cut-off events.
[2024-06-20 18:55:51,249 INFO  L125   PetriNetUnfolderBase]: For 173242/173248 co-relation queries the response was YES.
[2024-06-20 18:55:51,268 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29288 conditions, 3881 events. 2626/3881 cut-off events. For 173242/173248 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 18466 event pairs, 627 based on Foata normal form. 15/3895 useless extension candidates. Maximal degree in co-relation 29215. Up to 3675 conditions per place. 
[2024-06-20 18:55:51,281 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 187 selfloop transitions, 44 changer transitions 0/234 dead transitions.
[2024-06-20 18:55:51,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 234 transitions, 3161 flow
[2024-06-20 18:55:51,282 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:55:51,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:55:51,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-06-20 18:55:51,282 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4481707317073171
[2024-06-20 18:55:51,283 INFO  L175             Difference]: Start difference. First operand has 151 places, 195 transitions, 2216 flow. Second operand 8 states and 147 transitions.
[2024-06-20 18:55:51,283 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 234 transitions, 3161 flow
[2024-06-20 18:55:51,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 234 transitions, 3029 flow, removed 37 selfloop flow, removed 6 redundant places.
[2024-06-20 18:55:51,406 INFO  L231             Difference]: Finished difference. Result has 154 places, 206 transitions, 2432 flow
[2024-06-20 18:55:51,406 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2432, PETRI_PLACES=154, PETRI_TRANSITIONS=206}
[2024-06-20 18:55:51,406 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places.
[2024-06-20 18:55:51,406 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 206 transitions, 2432 flow
[2024-06-20 18:55:51,406 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:55:51,406 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:55:51,406 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:55:51,407 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-20 18:55:51,407 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-20 18:55:51,407 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:55:51,407 INFO  L85        PathProgramCache]: Analyzing trace with hash -732363564, now seen corresponding path program 3 times
[2024-06-20 18:55:51,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:55:51,407 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191503362]
[2024-06-20 18:55:51,408 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:55:51,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:55:51,454 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:56:01,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:56:01,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:56:01,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191503362]
[2024-06-20 18:56:01,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191503362] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:56:01,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:56:01,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:56:01,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930843326]
[2024-06-20 18:56:01,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:56:01,009 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:56:01,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:56:01,009 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:56:01,009 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:56:01,184 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:56:01,185 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 206 transitions, 2432 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:01,185 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:56:01,185 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:56:01,185 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:56:02,700 INFO  L124   PetriNetUnfolderBase]: 2654/3924 cut-off events.
[2024-06-20 18:56:02,700 INFO  L125   PetriNetUnfolderBase]: For 182106/182106 co-relation queries the response was YES.
[2024-06-20 18:56:02,722 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30243 conditions, 3924 events. 2654/3924 cut-off events. For 182106/182106 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18693 event pairs, 634 based on Foata normal form. 6/3929 useless extension candidates. Maximal degree in co-relation 30168. Up to 3825 conditions per place. 
[2024-06-20 18:56:02,742 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 206 selfloop transitions, 25 changer transitions 0/234 dead transitions.
[2024-06-20 18:56:02,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 234 transitions, 3116 flow
[2024-06-20 18:56:02,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:56:02,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:56:02,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions.
[2024-06-20 18:56:02,744 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-20 18:56:02,744 INFO  L175             Difference]: Start difference. First operand has 154 places, 206 transitions, 2432 flow. Second operand 8 states and 140 transitions.
[2024-06-20 18:56:02,744 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 234 transitions, 3116 flow
[2024-06-20 18:56:02,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 234 transitions, 2968 flow, removed 56 selfloop flow, removed 4 redundant places.
[2024-06-20 18:56:02,907 INFO  L231             Difference]: Finished difference. Result has 158 places, 209 transitions, 2438 flow
[2024-06-20 18:56:02,907 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2284, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2438, PETRI_PLACES=158, PETRI_TRANSITIONS=209}
[2024-06-20 18:56:02,908 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 116 predicate places.
[2024-06-20 18:56:02,908 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 2438 flow
[2024-06-20 18:56:02,908 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:02,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:56:02,908 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:56:02,908 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-20 18:56:02,908 INFO  L420      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:56:02,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:56:02,909 INFO  L85        PathProgramCache]: Analyzing trace with hash 186816048, now seen corresponding path program 4 times
[2024-06-20 18:56:02,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:56:02,909 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847877129]
[2024-06-20 18:56:02,909 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:56:02,909 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:56:02,967 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:56:12,041 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:56:12,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:56:12,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847877129]
[2024-06-20 18:56:12,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847877129] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:56:12,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:56:12,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:56:12,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804857147]
[2024-06-20 18:56:12,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:56:12,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:56:12,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:56:12,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:56:12,042 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:56:12,222 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:56:12,222 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 2438 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:12,222 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:56:12,222 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:56:12,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:56:13,913 INFO  L124   PetriNetUnfolderBase]: 2682/3968 cut-off events.
[2024-06-20 18:56:13,913 INFO  L125   PetriNetUnfolderBase]: For 191487/191487 co-relation queries the response was YES.
[2024-06-20 18:56:13,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30831 conditions, 3968 events. 2682/3968 cut-off events. For 191487/191487 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 18997 event pairs, 620 based on Foata normal form. 6/3973 useless extension candidates. Maximal degree in co-relation 30754. Up to 3841 conditions per place. 
[2024-06-20 18:56:13,947 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 205 selfloop transitions, 29 changer transitions 0/237 dead transitions.
[2024-06-20 18:56:13,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 237 transitions, 3134 flow
[2024-06-20 18:56:13,948 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:56:13,948 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:56:13,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-20 18:56:13,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4298780487804878
[2024-06-20 18:56:13,949 INFO  L175             Difference]: Start difference. First operand has 158 places, 209 transitions, 2438 flow. Second operand 8 states and 141 transitions.
[2024-06-20 18:56:13,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 237 transitions, 3134 flow
[2024-06-20 18:56:14,108 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 237 transitions, 3002 flow, removed 43 selfloop flow, removed 6 redundant places.
[2024-06-20 18:56:14,111 INFO  L231             Difference]: Finished difference. Result has 160 places, 212 transitions, 2474 flow
[2024-06-20 18:56:14,111 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=152, 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=8, PETRI_FLOW=2474, PETRI_PLACES=160, PETRI_TRANSITIONS=212}
[2024-06-20 18:56:14,112 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 118 predicate places.
[2024-06-20 18:56:14,112 INFO  L495      AbstractCegarLoop]: Abstraction has has 160 places, 212 transitions, 2474 flow
[2024-06-20 18:56:14,112 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:14,112 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:56:14,112 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:56:14,112 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-20 18:56:14,112 INFO  L420      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:56:14,113 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:56:14,113 INFO  L85        PathProgramCache]: Analyzing trace with hash 186519378, now seen corresponding path program 5 times
[2024-06-20 18:56:14,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:56:14,113 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291198256]
[2024-06-20 18:56:14,113 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:56:14,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:56:14,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:56:23,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:56:23,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:56:23,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291198256]
[2024-06-20 18:56:23,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291198256] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:56:23,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:56:23,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:56:23,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127216924]
[2024-06-20 18:56:23,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:56:23,882 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:56:23,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:56:23,883 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:56:23,884 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:56:24,082 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:56:24,082 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 212 transitions, 2474 flow. Second operand  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:24,082 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:56:24,082 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:56:24,083 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:56:25,709 INFO  L124   PetriNetUnfolderBase]: 2685/3973 cut-off events.
[2024-06-20 18:56:25,709 INFO  L125   PetriNetUnfolderBase]: For 198522/198522 co-relation queries the response was YES.
[2024-06-20 18:56:25,727 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30969 conditions, 3973 events. 2685/3973 cut-off events. For 198522/198522 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 19025 event pairs, 634 based on Foata normal form. 6/3978 useless extension candidates. Maximal degree in co-relation 30891. Up to 3815 conditions per place. 
[2024-06-20 18:56:25,741 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 200 selfloop transitions, 37 changer transitions 0/240 dead transitions.
[2024-06-20 18:56:25,742 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 240 transitions, 3186 flow
[2024-06-20 18:56:25,742 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:56:25,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:56:25,742 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions.
[2024-06-20 18:56:25,743 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4329268292682927
[2024-06-20 18:56:25,743 INFO  L175             Difference]: Start difference. First operand has 160 places, 212 transitions, 2474 flow. Second operand 8 states and 142 transitions.
[2024-06-20 18:56:25,743 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 240 transitions, 3186 flow
[2024-06-20 18:56:25,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 240 transitions, 3042 flow, removed 45 selfloop flow, removed 6 redundant places.
[2024-06-20 18:56:25,921 INFO  L231             Difference]: Finished difference. Result has 162 places, 215 transitions, 2524 flow
[2024-06-20 18:56:25,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2524, PETRI_PLACES=162, PETRI_TRANSITIONS=215}
[2024-06-20 18:56:25,921 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 120 predicate places.
[2024-06-20 18:56:25,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 215 transitions, 2524 flow
[2024-06-20 18:56:25,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:25,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:56:25,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:56:25,922 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-20 18:56:25,922 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:56:25,923 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:56:25,923 INFO  L85        PathProgramCache]: Analyzing trace with hash -912722322, now seen corresponding path program 1 times
[2024-06-20 18:56:25,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:56:25,923 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478286963]
[2024-06-20 18:56:25,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:56:25,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:56:25,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:56:35,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:56:35,584 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:56:35,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478286963]
[2024-06-20 18:56:35,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478286963] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:56:35,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:56:35,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:56:35,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517383395]
[2024-06-20 18:56:35,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:56:35,585 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:56:35,585 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:56:35,586 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:56:35,586 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:56:35,763 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:56:35,763 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 215 transitions, 2524 flow. Second operand  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:35,763 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:56:35,763 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:56:35,763 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:56:37,386 INFO  L124   PetriNetUnfolderBase]: 2676/3961 cut-off events.
[2024-06-20 18:56:37,387 INFO  L125   PetriNetUnfolderBase]: For 202953/202957 co-relation queries the response was YES.
[2024-06-20 18:56:37,409 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31045 conditions, 3961 events. 2676/3961 cut-off events. For 202953/202957 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18978 event pairs, 633 based on Foata normal form. 7/3967 useless extension candidates. Maximal degree in co-relation 30966. Up to 3807 conditions per place. 
[2024-06-20 18:56:37,429 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 196 selfloop transitions, 37 changer transitions 0/236 dead transitions.
[2024-06-20 18:56:37,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 236 transitions, 3120 flow
[2024-06-20 18:56:37,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 18:56:37,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 18:56:37,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-20 18:56:37,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.445993031358885
[2024-06-20 18:56:37,430 INFO  L175             Difference]: Start difference. First operand has 162 places, 215 transitions, 2524 flow. Second operand 7 states and 128 transitions.
[2024-06-20 18:56:37,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 236 transitions, 3120 flow
[2024-06-20 18:56:37,598 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 236 transitions, 2908 flow, removed 73 selfloop flow, removed 6 redundant places.
[2024-06-20 18:56:37,601 INFO  L231             Difference]: Finished difference. Result has 163 places, 215 transitions, 2402 flow
[2024-06-20 18:56:37,602 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2314, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2402, PETRI_PLACES=163, PETRI_TRANSITIONS=215}
[2024-06-20 18:56:37,602 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places.
[2024-06-20 18:56:37,602 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 215 transitions, 2402 flow
[2024-06-20 18:56:37,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:37,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:56:37,603 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:56:37,603 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-20 18:56:37,603 INFO  L420      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:56:37,603 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:56:37,603 INFO  L85        PathProgramCache]: Analyzing trace with hash -2005857375, now seen corresponding path program 2 times
[2024-06-20 18:56:37,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:56:37,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853671123]
[2024-06-20 18:56:37,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:56:37,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:56:37,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:56:47,949 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:56:47,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:56:47,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853671123]
[2024-06-20 18:56:47,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853671123] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:56:47,950 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:56:47,950 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:56:47,950 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023385153]
[2024-06-20 18:56:47,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:56:47,950 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:56:47,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:56:47,950 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:56:47,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:56:48,058 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:56:48,058 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 215 transitions, 2402 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:48,058 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:56:48,058 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:56:48,058 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:56:49,408 INFO  L124   PetriNetUnfolderBase]: 2673/3956 cut-off events.
[2024-06-20 18:56:49,408 INFO  L125   PetriNetUnfolderBase]: For 197161/197161 co-relation queries the response was YES.
[2024-06-20 18:56:49,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30490 conditions, 3956 events. 2673/3956 cut-off events. For 197161/197161 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18942 event pairs, 644 based on Foata normal form. 1/3956 useless extension candidates. Maximal degree in co-relation 30410. Up to 3938 conditions per place. 
[2024-06-20 18:56:49,449 INFO  L140   encePairwiseOnDemand]: 33/41 looper letters, 208 selfloop transitions, 12 changer transitions 0/223 dead transitions.
[2024-06-20 18:56:49,449 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 223 transitions, 2862 flow
[2024-06-20 18:56:49,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:56:49,449 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:56:49,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions.
[2024-06-20 18:56:49,450 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3861788617886179
[2024-06-20 18:56:49,450 INFO  L175             Difference]: Start difference. First operand has 163 places, 215 transitions, 2402 flow. Second operand 6 states and 95 transitions.
[2024-06-20 18:56:49,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 223 transitions, 2862 flow
[2024-06-20 18:56:49,624 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 223 transitions, 2778 flow, removed 5 selfloop flow, removed 6 redundant places.
[2024-06-20 18:56:49,627 INFO  L231             Difference]: Finished difference. Result has 163 places, 215 transitions, 2348 flow
[2024-06-20 18:56:49,627 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2318, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2348, PETRI_PLACES=163, PETRI_TRANSITIONS=215}
[2024-06-20 18:56:49,627 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 121 predicate places.
[2024-06-20 18:56:49,627 INFO  L495      AbstractCegarLoop]: Abstraction has has 163 places, 215 transitions, 2348 flow
[2024-06-20 18:56:49,628 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:56:49,628 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:56:49,628 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:56:49,628 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-20 18:56:49,628 INFO  L420      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:56:49,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:56:49,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -2012314923, now seen corresponding path program 1 times
[2024-06-20 18:56:49,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:56:49,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589656012]
[2024-06-20 18:56:49,628 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:56:49,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:56:49,661 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:57:03,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:57:03,366 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:57:03,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589656012]
[2024-06-20 18:57:03,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589656012] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:57:03,366 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:57:03,366 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:57:03,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104219779]
[2024-06-20 18:57:03,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:57:03,367 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:57:03,367 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:57:03,367 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:57:03,367 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:57:03,490 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:57:03,491 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 215 transitions, 2348 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:03,491 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:57:03,491 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:57:03,491 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:57:04,995 INFO  L124   PetriNetUnfolderBase]: 2672/3955 cut-off events.
[2024-06-20 18:57:04,995 INFO  L125   PetriNetUnfolderBase]: For 203953/203953 co-relation queries the response was YES.
[2024-06-20 18:57:05,018 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30494 conditions, 3955 events. 2672/3955 cut-off events. For 203953/203953 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 18859 event pairs, 642 based on Foata normal form. 3/3957 useless extension candidates. Maximal degree in co-relation 30413. Up to 3888 conditions per place. 
[2024-06-20 18:57:05,036 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 202 selfloop transitions, 25 changer transitions 0/230 dead transitions.
[2024-06-20 18:57:05,037 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 230 transitions, 2955 flow
[2024-06-20 18:57:05,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:57:05,037 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:57:05,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions.
[2024-06-20 18:57:05,037 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4268292682926829
[2024-06-20 18:57:05,038 INFO  L175             Difference]: Start difference. First operand has 163 places, 215 transitions, 2348 flow. Second operand 6 states and 105 transitions.
[2024-06-20 18:57:05,038 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 230 transitions, 2955 flow
[2024-06-20 18:57:05,195 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 230 transitions, 2920 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-20 18:57:05,198 INFO  L231             Difference]: Finished difference. Result has 164 places, 218 transitions, 2423 flow
[2024-06-20 18:57:05,198 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2313, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2423, PETRI_PLACES=164, PETRI_TRANSITIONS=218}
[2024-06-20 18:57:05,199 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 122 predicate places.
[2024-06-20 18:57:05,199 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 218 transitions, 2423 flow
[2024-06-20 18:57:05,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:05,199 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:57:05,199 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:57:05,200 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-20 18:57:05,200 INFO  L420      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:57:05,200 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:57:05,200 INFO  L85        PathProgramCache]: Analyzing trace with hash -350149763, now seen corresponding path program 2 times
[2024-06-20 18:57:05,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:57:05,201 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808746331]
[2024-06-20 18:57:05,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:57:05,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:57:05,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:57:19,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:57:19,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:57:19,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808746331]
[2024-06-20 18:57:19,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808746331] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:57:19,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:57:19,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:57:19,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350642266]
[2024-06-20 18:57:19,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:57:19,865 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:57:19,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:57:19,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:57:19,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:57:19,990 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:57:19,991 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 218 transitions, 2423 flow. Second operand  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:19,991 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:57:19,991 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:57:19,991 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:57:21,425 INFO  L124   PetriNetUnfolderBase]: 2635/3900 cut-off events.
[2024-06-20 18:57:21,425 INFO  L125   PetriNetUnfolderBase]: For 210692/210694 co-relation queries the response was YES.
[2024-06-20 18:57:21,445 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30377 conditions, 3900 events. 2635/3900 cut-off events. For 210692/210694 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 18527 event pairs, 652 based on Foata normal form. 1/3900 useless extension candidates. Maximal degree in co-relation 30295. Up to 3834 conditions per place. 
[2024-06-20 18:57:21,460 INFO  L140   encePairwiseOnDemand]: 32/41 looper letters, 197 selfloop transitions, 26 changer transitions 0/226 dead transitions.
[2024-06-20 18:57:21,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 226 transitions, 2889 flow
[2024-06-20 18:57:21,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:57:21,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:57:21,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-20 18:57:21,461 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4146341463414634
[2024-06-20 18:57:21,461 INFO  L175             Difference]: Start difference. First operand has 164 places, 218 transitions, 2423 flow. Second operand 6 states and 102 transitions.
[2024-06-20 18:57:21,461 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 226 transitions, 2889 flow
[2024-06-20 18:57:21,617 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 226 transitions, 2827 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-20 18:57:21,620 INFO  L231             Difference]: Finished difference. Result has 166 places, 218 transitions, 2419 flow
[2024-06-20 18:57:21,620 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2361, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2419, PETRI_PLACES=166, PETRI_TRANSITIONS=218}
[2024-06-20 18:57:21,621 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 124 predicate places.
[2024-06-20 18:57:21,621 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 218 transitions, 2419 flow
[2024-06-20 18:57:21,621 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:21,621 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:57:21,622 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:57:21,622 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-20 18:57:21,622 INFO  L420      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:57:21,622 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:57:21,622 INFO  L85        PathProgramCache]: Analyzing trace with hash 1209614158, now seen corresponding path program 1 times
[2024-06-20 18:57:21,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:57:21,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813305299]
[2024-06-20 18:57:21,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:57:21,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:57:21,692 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:57:33,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:57:33,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:57:33,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813305299]
[2024-06-20 18:57:33,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813305299] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:57:33,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:57:33,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:57:33,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141646186]
[2024-06-20 18:57:33,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:57:33,428 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:57:33,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:57:33,428 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:57:33,428 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:57:33,643 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-20 18:57:33,643 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 218 transitions, 2419 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:33,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:57:33,643 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-20 18:57:33,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:57:35,447 INFO  L124   PetriNetUnfolderBase]: 2973/4438 cut-off events.
[2024-06-20 18:57:35,447 INFO  L125   PetriNetUnfolderBase]: For 275211/275213 co-relation queries the response was YES.
[2024-06-20 18:57:35,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36122 conditions, 4438 events. 2973/4438 cut-off events. For 275211/275213 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 22213 event pairs, 398 based on Foata normal form. 26/4463 useless extension candidates. Maximal degree in co-relation 36039. Up to 2538 conditions per place. 
[2024-06-20 18:57:35,489 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 191 selfloop transitions, 87 changer transitions 0/281 dead transitions.
[2024-06-20 18:57:35,489 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 281 transitions, 3832 flow
[2024-06-20 18:57:35,489 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:57:35,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:57:35,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions.
[2024-06-20 18:57:35,490 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47696476964769646
[2024-06-20 18:57:35,490 INFO  L175             Difference]: Start difference. First operand has 166 places, 218 transitions, 2419 flow. Second operand 9 states and 176 transitions.
[2024-06-20 18:57:35,490 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 281 transitions, 3832 flow
[2024-06-20 18:57:35,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 281 transitions, 3757 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-20 18:57:35,716 INFO  L231             Difference]: Finished difference. Result has 171 places, 224 transitions, 2750 flow
[2024-06-20 18:57:35,716 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2344, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2750, PETRI_PLACES=171, PETRI_TRANSITIONS=224}
[2024-06-20 18:57:35,716 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 129 predicate places.
[2024-06-20 18:57:35,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 224 transitions, 2750 flow
[2024-06-20 18:57:35,716 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:35,716 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:57:35,716 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:57:35,717 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-20 18:57:35,717 INFO  L420      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:57:35,717 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:57:35,717 INFO  L85        PathProgramCache]: Analyzing trace with hash 1211491828, now seen corresponding path program 2 times
[2024-06-20 18:57:35,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:57:35,717 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310684847]
[2024-06-20 18:57:35,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:57:35,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:57:35,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:57:46,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:57:46,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:57:46,573 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310684847]
[2024-06-20 18:57:46,573 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310684847] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:57:46,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:57:46,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:57:46,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498355834]
[2024-06-20 18:57:46,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:57:46,574 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:57:46,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:57:46,574 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:57:46,574 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:57:46,849 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:57:46,849 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 224 transitions, 2750 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:46,849 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:57:46,849 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:57:46,849 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:57:48,785 INFO  L124   PetriNetUnfolderBase]: 3097/4642 cut-off events.
[2024-06-20 18:57:48,785 INFO  L125   PetriNetUnfolderBase]: For 310041/310043 co-relation queries the response was YES.
[2024-06-20 18:57:48,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39094 conditions, 4642 events. 3097/4642 cut-off events. For 310041/310043 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 23651 event pairs, 669 based on Foata normal form. 32/4673 useless extension candidates. Maximal degree in co-relation 39009. Up to 3676 conditions per place. 
[2024-06-20 18:57:48,823 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 185 selfloop transitions, 83 changer transitions 0/271 dead transitions.
[2024-06-20 18:57:48,823 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 271 transitions, 3762 flow
[2024-06-20 18:57:48,823 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:57:48,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:57:48,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions.
[2024-06-20 18:57:48,824 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4796747967479675
[2024-06-20 18:57:48,824 INFO  L175             Difference]: Start difference. First operand has 171 places, 224 transitions, 2750 flow. Second operand 9 states and 177 transitions.
[2024-06-20 18:57:48,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 271 transitions, 3762 flow
[2024-06-20 18:57:49,089 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 271 transitions, 3586 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-20 18:57:49,093 INFO  L231             Difference]: Finished difference. Result has 176 places, 226 transitions, 2837 flow
[2024-06-20 18:57:49,093 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2574, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2837, PETRI_PLACES=176, PETRI_TRANSITIONS=226}
[2024-06-20 18:57:49,094 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places.
[2024-06-20 18:57:49,094 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 226 transitions, 2837 flow
[2024-06-20 18:57:49,094 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:57:49,094 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:57:49,095 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:57:49,095 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-20 18:57:49,095 INFO  L420      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:57:49,095 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:57:49,095 INFO  L85        PathProgramCache]: Analyzing trace with hash 1211488108, now seen corresponding path program 3 times
[2024-06-20 18:57:49,096 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:57:49,096 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698589671]
[2024-06-20 18:57:49,096 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:57:49,096 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:57:49,151 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:01,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:58:01,335 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:01,335 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698589671]
[2024-06-20 18:58:01,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698589671] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:01,335 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:01,335 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:58:01,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035818897]
[2024-06-20 18:58:01,335 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:01,335 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:58:01,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:01,336 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:58:01,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:58:01,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41
[2024-06-20 18:58:01,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 226 transitions, 2837 flow. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:01,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:01,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41
[2024-06-20 18:58:01,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:03,806 INFO  L124   PetriNetUnfolderBase]: 3402/5129 cut-off events.
[2024-06-20 18:58:03,806 INFO  L125   PetriNetUnfolderBase]: For 353201/353203 co-relation queries the response was YES.
[2024-06-20 18:58:03,835 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44778 conditions, 5129 events. 3402/5129 cut-off events. For 353201/353203 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26964 event pairs, 762 based on Foata normal form. 26/5154 useless extension candidates. Maximal degree in co-relation 44691. Up to 3516 conditions per place. 
[2024-06-20 18:58:03,857 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 190 selfloop transitions, 96 changer transitions 0/289 dead transitions.
[2024-06-20 18:58:03,858 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 289 transitions, 4320 flow
[2024-06-20 18:58:03,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-06-20 18:58:03,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-06-20 18:58:03,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 193 transitions.
[2024-06-20 18:58:03,859 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47073170731707314
[2024-06-20 18:58:03,859 INFO  L175             Difference]: Start difference. First operand has 176 places, 226 transitions, 2837 flow. Second operand 10 states and 193 transitions.
[2024-06-20 18:58:03,859 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 289 transitions, 4320 flow
[2024-06-20 18:58:04,240 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 289 transitions, 4098 flow, removed 30 selfloop flow, removed 7 redundant places.
[2024-06-20 18:58:04,244 INFO  L231             Difference]: Finished difference. Result has 180 places, 231 transitions, 3013 flow
[2024-06-20 18:58:04,244 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2615, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3013, PETRI_PLACES=180, PETRI_TRANSITIONS=231}
[2024-06-20 18:58:04,245 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 138 predicate places.
[2024-06-20 18:58:04,245 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 231 transitions, 3013 flow
[2024-06-20 18:58:04,245 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:04,245 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:04,245 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:04,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-20 18:58:04,245 INFO  L420      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:04,245 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:04,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 1298327788, now seen corresponding path program 4 times
[2024-06-20 18:58:04,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:04,246 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118613774]
[2024-06-20 18:58:04,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:04,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:04,293 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:13,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:58:13,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:13,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118613774]
[2024-06-20 18:58:13,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118613774] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:13,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:13,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:58:13,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725304047]
[2024-06-20 18:58:13,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:13,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:58:13,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:13,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:58:13,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:58:14,086 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:58:14,086 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 231 transitions, 3013 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:14,086 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:14,086 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:58:14,086 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:16,153 INFO  L124   PetriNetUnfolderBase]: 3526/5333 cut-off events.
[2024-06-20 18:58:16,154 INFO  L125   PetriNetUnfolderBase]: For 385206/385208 co-relation queries the response was YES.
[2024-06-20 18:58:16,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46852 conditions, 5333 events. 3526/5333 cut-off events. For 385206/385208 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 28387 event pairs, 886 based on Foata normal form. 32/5364 useless extension candidates. Maximal degree in co-relation 46763. Up to 4675 conditions per place. 
[2024-06-20 18:58:16,316 INFO  L140   encePairwiseOnDemand]: 27/41 looper letters, 210 selfloop transitions, 60 changer transitions 0/273 dead transitions.
[2024-06-20 18:58:16,317 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 273 transitions, 3947 flow
[2024-06-20 18:58:16,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:58:16,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:58:16,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions.
[2024-06-20 18:58:16,318 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46883468834688347
[2024-06-20 18:58:16,318 INFO  L175             Difference]: Start difference. First operand has 180 places, 231 transitions, 3013 flow. Second operand 9 states and 173 transitions.
[2024-06-20 18:58:16,318 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 273 transitions, 3947 flow
[2024-06-20 18:58:16,720 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 273 transitions, 3747 flow, removed 44 selfloop flow, removed 6 redundant places.
[2024-06-20 18:58:16,725 INFO  L231             Difference]: Finished difference. Result has 183 places, 233 transitions, 3039 flow
[2024-06-20 18:58:16,725 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2813, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3039, PETRI_PLACES=183, PETRI_TRANSITIONS=233}
[2024-06-20 18:58:16,726 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places.
[2024-06-20 18:58:16,726 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 233 transitions, 3039 flow
[2024-06-20 18:58:16,726 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:16,726 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:16,726 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:16,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-20 18:58:16,727 INFO  L420      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:16,727 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:16,727 INFO  L85        PathProgramCache]: Analyzing trace with hash 1298183638, now seen corresponding path program 5 times
[2024-06-20 18:58:16,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:16,728 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656098459]
[2024-06-20 18:58:16,728 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:16,728 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:16,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:27,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:58:27,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:27,375 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656098459]
[2024-06-20 18:58:27,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656098459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:27,376 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:27,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:58:27,376 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806485851]
[2024-06-20 18:58:27,376 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:27,376 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:58:27,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:27,377 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:58:27,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:58:27,625 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:58:27,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 233 transitions, 3039 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:27,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:27,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:58:27,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:29,747 INFO  L124   PetriNetUnfolderBase]: 3600/5459 cut-off events.
[2024-06-20 18:58:29,747 INFO  L125   PetriNetUnfolderBase]: For 394073/394075 co-relation queries the response was YES.
[2024-06-20 18:58:29,776 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47759 conditions, 5459 events. 3600/5459 cut-off events. For 394073/394075 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 29338 event pairs, 896 based on Foata normal form. 30/5488 useless extension candidates. Maximal degree in co-relation 47668. Up to 4684 conditions per place. 
[2024-06-20 18:58:29,797 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 193 selfloop transitions, 80 changer transitions 0/276 dead transitions.
[2024-06-20 18:58:29,797 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 276 transitions, 4077 flow
[2024-06-20 18:58:29,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:58:29,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:58:29,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions.
[2024-06-20 18:58:29,798 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4742547425474255
[2024-06-20 18:58:29,798 INFO  L175             Difference]: Start difference. First operand has 183 places, 233 transitions, 3039 flow. Second operand 9 states and 175 transitions.
[2024-06-20 18:58:29,798 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 276 transitions, 4077 flow
[2024-06-20 18:58:30,223 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 276 transitions, 3895 flow, removed 33 selfloop flow, removed 7 redundant places.
[2024-06-20 18:58:30,227 INFO  L231             Difference]: Finished difference. Result has 185 places, 235 transitions, 3127 flow
[2024-06-20 18:58:30,227 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2857, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3127, PETRI_PLACES=185, PETRI_TRANSITIONS=235}
[2024-06-20 18:58:30,227 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places.
[2024-06-20 18:58:30,227 INFO  L495      AbstractCegarLoop]: Abstraction has has 185 places, 235 transitions, 3127 flow
[2024-06-20 18:58:30,227 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:30,227 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:30,228 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:30,228 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-20 18:58:30,228 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:58:30,228 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:30,228 INFO  L85        PathProgramCache]: Analyzing trace with hash -2040477405, now seen corresponding path program 1 times
[2024-06-20 18:58:30,228 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:30,228 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298828226]
[2024-06-20 18:58:30,228 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:30,228 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:30,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:40,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:58:40,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:40,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298828226]
[2024-06-20 18:58:40,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298828226] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:40,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:40,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-20 18:58:40,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749475994]
[2024-06-20 18:58:40,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:40,443 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-20 18:58:40,443 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:40,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-20 18:58:40,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-20 18:58:40,557 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41
[2024-06-20 18:58:40,558 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 235 transitions, 3127 flow. Second operand  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:40,558 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:40,558 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41
[2024-06-20 18:58:40,558 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:42,374 INFO  L124   PetriNetUnfolderBase]: 3620/5487 cut-off events.
[2024-06-20 18:58:42,374 INFO  L125   PetriNetUnfolderBase]: For 377049/377051 co-relation queries the response was YES.
[2024-06-20 18:58:42,407 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47900 conditions, 5487 events. 3620/5487 cut-off events. For 377049/377051 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29526 event pairs, 895 based on Foata normal form. 6/5492 useless extension candidates. Maximal degree in co-relation 47808. Up to 5031 conditions per place. 
[2024-06-20 18:58:42,429 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 200 selfloop transitions, 63 changer transitions 0/266 dead transitions.
[2024-06-20 18:58:42,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 266 transitions, 4002 flow
[2024-06-20 18:58:42,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-20 18:58:42,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-20 18:58:42,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions.
[2024-06-20 18:58:42,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5447154471544715
[2024-06-20 18:58:42,430 INFO  L175             Difference]: Start difference. First operand has 185 places, 235 transitions, 3127 flow. Second operand 6 states and 134 transitions.
[2024-06-20 18:58:42,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 266 transitions, 4002 flow
[2024-06-20 18:58:42,793 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 266 transitions, 3768 flow, removed 35 selfloop flow, removed 7 redundant places.
[2024-06-20 18:58:42,796 INFO  L231             Difference]: Finished difference. Result has 184 places, 240 transitions, 3127 flow
[2024-06-20 18:58:42,796 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2901, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3127, PETRI_PLACES=184, PETRI_TRANSITIONS=240}
[2024-06-20 18:58:42,797 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 142 predicate places.
[2024-06-20 18:58:42,797 INFO  L495      AbstractCegarLoop]: Abstraction has has 184 places, 240 transitions, 3127 flow
[2024-06-20 18:58:42,797 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:42,797 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:42,797 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:42,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-20 18:58:42,797 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-20 18:58:42,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:42,798 INFO  L85        PathProgramCache]: Analyzing trace with hash 577238892, now seen corresponding path program 6 times
[2024-06-20 18:58:42,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:42,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209421884]
[2024-06-20 18:58:42,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:42,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:42,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:58:53,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:58:53,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:58:53,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209421884]
[2024-06-20 18:58:53,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209421884] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:58:53,824 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:58:53,824 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:58:53,824 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992889029]
[2024-06-20 18:58:53,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:58:53,824 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:58:53,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:58:53,825 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:58:53,825 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:58:54,054 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:58:54,054 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 240 transitions, 3127 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:54,054 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:58:54,054 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:58:54,054 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:58:56,406 INFO  L124   PetriNetUnfolderBase]: 3904/5955 cut-off events.
[2024-06-20 18:58:56,406 INFO  L125   PetriNetUnfolderBase]: For 444427/444429 co-relation queries the response was YES.
[2024-06-20 18:58:56,440 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52662 conditions, 5955 events. 3904/5955 cut-off events. For 444427/444429 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32928 event pairs, 840 based on Foata normal form. 24/5978 useless extension candidates. Maximal degree in co-relation 52570. Up to 4448 conditions per place. 
[2024-06-20 18:58:56,463 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 191 selfloop transitions, 107 changer transitions 0/301 dead transitions.
[2024-06-20 18:58:56,464 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 301 transitions, 4639 flow
[2024-06-20 18:58:56,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:58:56,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:58:56,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions.
[2024-06-20 18:58:56,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5067750677506775
[2024-06-20 18:58:56,465 INFO  L175             Difference]: Start difference. First operand has 184 places, 240 transitions, 3127 flow. Second operand 9 states and 187 transitions.
[2024-06-20 18:58:56,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 301 transitions, 4639 flow
[2024-06-20 18:58:56,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 301 transitions, 4526 flow, removed 13 selfloop flow, removed 3 redundant places.
[2024-06-20 18:58:56,914 INFO  L231             Difference]: Finished difference. Result has 192 places, 248 transitions, 3534 flow
[2024-06-20 18:58:56,915 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3014, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3534, PETRI_PLACES=192, PETRI_TRANSITIONS=248}
[2024-06-20 18:58:56,915 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places.
[2024-06-20 18:58:56,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 248 transitions, 3534 flow
[2024-06-20 18:58:56,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:58:56,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:58:56,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:58:56,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-20 18:58:56,915 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-20 18:58:56,916 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:58:56,916 INFO  L85        PathProgramCache]: Analyzing trace with hash 577242612, now seen corresponding path program 7 times
[2024-06-20 18:58:56,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:58:56,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455705931]
[2024-06-20 18:58:56,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:58:56,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:58:56,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:06,245 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:06,245 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:06,245 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455705931]
[2024-06-20 18:59:06,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455705931] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:06,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:06,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:59:06,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664488365]
[2024-06-20 18:59:06,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:06,246 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:59:06,247 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:06,247 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:59:06,247 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:59:06,447 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:59:06,447 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 248 transitions, 3534 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:06,447 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:06,447 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:59:06,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:09,119 INFO  L124   PetriNetUnfolderBase]: 4028/6159 cut-off events.
[2024-06-20 18:59:09,120 INFO  L125   PetriNetUnfolderBase]: For 488770/488772 co-relation queries the response was YES.
[2024-06-20 18:59:09,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 56334 conditions, 6159 events. 4028/6159 cut-off events. For 488770/488772 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 34480 event pairs, 1043 based on Foata normal form. 30/6188 useless extension candidates. Maximal degree in co-relation 56238. Up to 5252 conditions per place. 
[2024-06-20 18:59:09,180 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 190 selfloop transitions, 104 changer transitions 0/297 dead transitions.
[2024-06-20 18:59:09,181 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 297 transitions, 4660 flow
[2024-06-20 18:59:09,181 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 18:59:09,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 18:59:09,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions.
[2024-06-20 18:59:09,182 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4932249322493225
[2024-06-20 18:59:09,182 INFO  L175             Difference]: Start difference. First operand has 192 places, 248 transitions, 3534 flow. Second operand 9 states and 182 transitions.
[2024-06-20 18:59:09,182 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 297 transitions, 4660 flow
[2024-06-20 18:59:09,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 297 transitions, 4452 flow, removed 54 selfloop flow, removed 4 redundant places.
[2024-06-20 18:59:09,729 INFO  L231             Difference]: Finished difference. Result has 197 places, 250 transitions, 3648 flow
[2024-06-20 18:59:09,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3328, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3648, PETRI_PLACES=197, PETRI_TRANSITIONS=250}
[2024-06-20 18:59:09,730 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 155 predicate places.
[2024-06-20 18:59:09,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 250 transitions, 3648 flow
[2024-06-20 18:59:09,730 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:09,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:09,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:09,731 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-20 18:59:09,731 INFO  L420      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:09,731 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:09,731 INFO  L85        PathProgramCache]: Analyzing trace with hash 1248547958, now seen corresponding path program 1 times
[2024-06-20 18:59:09,731 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:09,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605028541]
[2024-06-20 18:59:09,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:09,731 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:09,787 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:20,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:20,242 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:20,242 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605028541]
[2024-06-20 18:59:20,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605028541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:20,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:20,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:59:20,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751391622]
[2024-06-20 18:59:20,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:20,242 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:59:20,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:20,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:59:20,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:59:20,480 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:59:20,480 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 250 transitions, 3648 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:20,480 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:20,480 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:59:20,480 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:22,818 INFO  L124   PetriNetUnfolderBase]: 4056/6203 cut-off events.
[2024-06-20 18:59:22,818 INFO  L125   PetriNetUnfolderBase]: For 483485/483487 co-relation queries the response was YES.
[2024-06-20 18:59:22,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57066 conditions, 6203 events. 4056/6203 cut-off events. For 483485/483487 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 34821 event pairs, 1038 based on Foata normal form. 8/6210 useless extension candidates. Maximal degree in co-relation 56968. Up to 5721 conditions per place. 
[2024-06-20 18:59:22,894 INFO  L140   encePairwiseOnDemand]: 28/41 looper letters, 218 selfloop transitions, 66 changer transitions 0/287 dead transitions.
[2024-06-20 18:59:22,894 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 287 transitions, 4615 flow
[2024-06-20 18:59:22,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:59:22,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:59:22,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions.
[2024-06-20 18:59:22,895 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4725609756097561
[2024-06-20 18:59:22,895 INFO  L175             Difference]: Start difference. First operand has 197 places, 250 transitions, 3648 flow. Second operand 8 states and 155 transitions.
[2024-06-20 18:59:22,895 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 287 transitions, 4615 flow
[2024-06-20 18:59:23,503 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 287 transitions, 4339 flow, removed 36 selfloop flow, removed 7 redundant places.
[2024-06-20 18:59:23,507 INFO  L231             Difference]: Finished difference. Result has 198 places, 253 transitions, 3631 flow
[2024-06-20 18:59:23,507 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3372, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3631, PETRI_PLACES=198, PETRI_TRANSITIONS=253}
[2024-06-20 18:59:23,507 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places.
[2024-06-20 18:59:23,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 253 transitions, 3631 flow
[2024-06-20 18:59:23,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:23,508 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:23,508 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:23,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-20 18:59:23,508 INFO  L420      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:23,508 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:23,508 INFO  L85        PathProgramCache]: Analyzing trace with hash 577386762, now seen corresponding path program 8 times
[2024-06-20 18:59:23,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:23,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539317736]
[2024-06-20 18:59:23,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:23,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:23,574 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:31,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:31,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:31,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539317736]
[2024-06-20 18:59:31,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539317736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:31,643 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:31,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 18:59:31,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936410234]
[2024-06-20 18:59:31,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:31,644 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 18:59:31,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:31,644 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 18:59:31,645 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 18:59:31,916 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 18:59:31,916 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 253 transitions, 3631 flow. Second operand  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:31,916 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:31,916 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 18:59:31,917 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:34,308 INFO  L124   PetriNetUnfolderBase]: 4180/6407 cut-off events.
[2024-06-20 18:59:34,308 INFO  L125   PetriNetUnfolderBase]: For 530459/530461 co-relation queries the response was YES.
[2024-06-20 18:59:34,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58552 conditions, 6407 events. 4180/6407 cut-off events. For 530459/530461 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 36340 event pairs, 1079 based on Foata normal form. 30/6436 useless extension candidates. Maximal degree in co-relation 58454. Up to 5685 conditions per place. 
[2024-06-20 18:59:34,376 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 210 selfloop transitions, 84 changer transitions 0/298 dead transitions.
[2024-06-20 18:59:34,376 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 298 transitions, 4663 flow
[2024-06-20 18:59:34,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:59:34,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:59:34,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions.
[2024-06-20 18:59:34,377 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5579268292682927
[2024-06-20 18:59:34,377 INFO  L175             Difference]: Start difference. First operand has 198 places, 253 transitions, 3631 flow. Second operand 8 states and 183 transitions.
[2024-06-20 18:59:34,377 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 298 transitions, 4663 flow
[2024-06-20 18:59:34,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 298 transitions, 4431 flow, removed 52 selfloop flow, removed 6 redundant places.
[2024-06-20 18:59:34,836 INFO  L231             Difference]: Finished difference. Result has 200 places, 255 transitions, 3685 flow
[2024-06-20 18:59:34,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3399, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3685, PETRI_PLACES=200, PETRI_TRANSITIONS=255}
[2024-06-20 18:59:34,837 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places.
[2024-06-20 18:59:34,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 255 transitions, 3685 flow
[2024-06-20 18:59:34,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:34,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:34,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:34,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-20 18:59:34,837 INFO  L420      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:34,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:34,838 INFO  L85        PathProgramCache]: Analyzing trace with hash 582956904, now seen corresponding path program 2 times
[2024-06-20 18:59:34,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:34,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650357309]
[2024-06-20 18:59:34,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:34,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:34,903 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:45,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:45,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:45,704 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650357309]
[2024-06-20 18:59:45,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650357309] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:45,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:45,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-20 18:59:45,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976538321]
[2024-06-20 18:59:45,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:45,705 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-20 18:59:45,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:45,705 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-20 18:59:45,705 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-20 18:59:45,891 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:59:45,892 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 255 transitions, 3685 flow. Second operand  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:45,892 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:45,892 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:59:45,892 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 18:59:48,176 INFO  L124   PetriNetUnfolderBase]: 4208/6451 cut-off events.
[2024-06-20 18:59:48,176 INFO  L125   PetriNetUnfolderBase]: For 527114/527116 co-relation queries the response was YES.
[2024-06-20 18:59:48,216 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59381 conditions, 6451 events. 4208/6451 cut-off events. For 527114/527116 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36669 event pairs, 1039 based on Foata normal form. 8/6458 useless extension candidates. Maximal degree in co-relation 59282. Up to 5969 conditions per place. 
[2024-06-20 18:59:48,243 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 223 selfloop transitions, 62 changer transitions 0/288 dead transitions.
[2024-06-20 18:59:48,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 288 transitions, 4558 flow
[2024-06-20 18:59:48,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 18:59:48,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 18:59:48,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 18:59:48,244 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573170731707317
[2024-06-20 18:59:48,244 INFO  L175             Difference]: Start difference. First operand has 200 places, 255 transitions, 3685 flow. Second operand 8 states and 150 transitions.
[2024-06-20 18:59:48,244 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 288 transitions, 4558 flow
[2024-06-20 18:59:48,761 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 288 transitions, 4316 flow, removed 39 selfloop flow, removed 6 redundant places.
[2024-06-20 18:59:48,765 INFO  L231             Difference]: Finished difference. Result has 202 places, 258 transitions, 3702 flow
[2024-06-20 18:59:48,765 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3702, PETRI_PLACES=202, PETRI_TRANSITIONS=258}
[2024-06-20 18:59:48,765 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places.
[2024-06-20 18:59:48,765 INFO  L495      AbstractCegarLoop]: Abstraction has has 202 places, 258 transitions, 3702 flow
[2024-06-20 18:59:48,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:48,765 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 18:59:48,766 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 18:59:48,766 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-20 18:59:48,766 INFO  L420      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 18:59:48,766 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 18:59:48,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 1254119588, now seen corresponding path program 3 times
[2024-06-20 18:59:48,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 18:59:48,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372248655]
[2024-06-20 18:59:48,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 18:59:48,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 18:59:48,819 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 18:59:58,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 18:59:58,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 18:59:58,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372248655]
[2024-06-20 18:59:58,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372248655] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 18:59:58,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 18:59:58,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 18:59:58,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196169802]
[2024-06-20 18:59:58,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 18:59:58,328 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 18:59:58,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 18:59:58,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 18:59:58,329 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 18:59:58,564 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 18:59:58,565 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 258 transitions, 3702 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 18:59:58,565 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 18:59:58,565 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 18:59:58,565 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:01,067 INFO  L124   PetriNetUnfolderBase]: 4236/6495 cut-off events.
[2024-06-20 19:00:01,067 INFO  L125   PetriNetUnfolderBase]: For 535097/535099 co-relation queries the response was YES.
[2024-06-20 19:00:01,107 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59521 conditions, 6495 events. 4236/6495 cut-off events. For 535097/535099 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 36994 event pairs, 1057 based on Foata normal form. 8/6502 useless extension candidates. Maximal degree in co-relation 59420. Up to 5859 conditions per place. 
[2024-06-20 19:00:01,137 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 215 selfloop transitions, 73 changer transitions 0/291 dead transitions.
[2024-06-20 19:00:01,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 291 transitions, 4587 flow
[2024-06-20 19:00:01,137 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:00:01,137 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:00:01,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-20 19:00:01,138 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573170731707317
[2024-06-20 19:00:01,138 INFO  L175             Difference]: Start difference. First operand has 202 places, 258 transitions, 3702 flow. Second operand 8 states and 150 transitions.
[2024-06-20 19:00:01,138 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 291 transitions, 4587 flow
[2024-06-20 19:00:01,755 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 291 transitions, 4355 flow, removed 56 selfloop flow, removed 6 redundant places.
[2024-06-20 19:00:01,758 INFO  L231             Difference]: Finished difference. Result has 204 places, 261 transitions, 3758 flow
[2024-06-20 19:00:01,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3470, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3758, PETRI_PLACES=204, PETRI_TRANSITIONS=261}
[2024-06-20 19:00:01,759 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 162 predicate places.
[2024-06-20 19:00:01,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 204 places, 261 transitions, 3758 flow
[2024-06-20 19:00:01,759 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:01,759 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:01,759 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:01,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-20 19:00:01,760 INFO  L420      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:01,760 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:01,760 INFO  L85        PathProgramCache]: Analyzing trace with hash 582749142, now seen corresponding path program 9 times
[2024-06-20 19:00:01,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:01,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701365737]
[2024-06-20 19:00:01,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:01,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:01,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:10,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:10,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:10,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701365737]
[2024-06-20 19:00:10,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701365737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:10,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:10,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:00:10,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553821479]
[2024-06-20 19:00:10,061 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:10,062 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:00:10,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:10,062 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:00:10,062 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:00:10,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41
[2024-06-20 19:00:10,220 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 261 transitions, 3758 flow. Second operand  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:10,220 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:10,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41
[2024-06-20 19:00:10,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:12,639 INFO  L124   PetriNetUnfolderBase]: 4360/6699 cut-off events.
[2024-06-20 19:00:12,639 INFO  L125   PetriNetUnfolderBase]: For 600703/600705 co-relation queries the response was YES.
[2024-06-20 19:00:12,683 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61914 conditions, 6699 events. 4360/6699 cut-off events. For 600703/600705 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38476 event pairs, 1095 based on Foata normal form. 30/6728 useless extension candidates. Maximal degree in co-relation 61813. Up to 5977 conditions per place. 
[2024-06-20 19:00:12,711 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 220 selfloop transitions, 78 changer transitions 0/302 dead transitions.
[2024-06-20 19:00:12,711 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 302 transitions, 4702 flow
[2024-06-20 19:00:12,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:00:12,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:00:12,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions.
[2024-06-20 19:00:12,712 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5426829268292683
[2024-06-20 19:00:12,713 INFO  L175             Difference]: Start difference. First operand has 204 places, 261 transitions, 3758 flow. Second operand 8 states and 178 transitions.
[2024-06-20 19:00:12,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 302 transitions, 4702 flow
[2024-06-20 19:00:13,553 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 302 transitions, 4443 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-20 19:00:13,557 INFO  L231             Difference]: Finished difference. Result has 206 places, 263 transitions, 3781 flow
[2024-06-20 19:00:13,557 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3499, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3781, PETRI_PLACES=206, PETRI_TRANSITIONS=263}
[2024-06-20 19:00:13,557 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places.
[2024-06-20 19:00:13,558 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 263 transitions, 3781 flow
[2024-06-20 19:00:13,558 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:13,558 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:13,558 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:13,558 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-20 19:00:13,558 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:13,558 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:13,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -190001003, now seen corresponding path program 1 times
[2024-06-20 19:00:13,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:13,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665259927]
[2024-06-20 19:00:13,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:13,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:13,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:25,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:25,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:25,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665259927]
[2024-06-20 19:00:25,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665259927] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:25,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:25,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:00:25,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663961594]
[2024-06-20 19:00:25,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:25,365 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:00:25,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:25,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:00:25,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:00:25,496 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:00:25,496 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 263 transitions, 3781 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:25,496 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:25,496 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:00:25,496 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:27,792 INFO  L124   PetriNetUnfolderBase]: 4391/6740 cut-off events.
[2024-06-20 19:00:27,792 INFO  L125   PetriNetUnfolderBase]: For 589350/589350 co-relation queries the response was YES.
[2024-06-20 19:00:27,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62632 conditions, 6740 events. 4391/6740 cut-off events. For 589350/589350 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 38719 event pairs, 1231 based on Foata normal form. 3/6742 useless extension candidates. Maximal degree in co-relation 62530. Up to 6676 conditions per place. 
[2024-06-20 19:00:27,880 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 265 selfloop transitions, 24 changer transitions 0/292 dead transitions.
[2024-06-20 19:00:27,881 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 292 transitions, 4625 flow
[2024-06-20 19:00:27,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:00:27,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:00:27,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions.
[2024-06-20 19:00:27,882 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4250871080139373
[2024-06-20 19:00:27,882 INFO  L175             Difference]: Start difference. First operand has 206 places, 263 transitions, 3781 flow. Second operand 7 states and 122 transitions.
[2024-06-20 19:00:27,882 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 292 transitions, 4625 flow
[2024-06-20 19:00:28,647 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 292 transitions, 4437 flow, removed 43 selfloop flow, removed 5 redundant places.
[2024-06-20 19:00:28,650 INFO  L231             Difference]: Finished difference. Result has 209 places, 272 transitions, 3778 flow
[2024-06-20 19:00:28,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3593, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3778, PETRI_PLACES=209, PETRI_TRANSITIONS=272}
[2024-06-20 19:00:28,651 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 167 predicate places.
[2024-06-20 19:00:28,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 272 transitions, 3778 flow
[2024-06-20 19:00:28,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:28,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:28,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:28,652 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-20 19:00:28,652 INFO  L420      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:28,652 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:28,652 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870794171, now seen corresponding path program 2 times
[2024-06-20 19:00:28,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:28,652 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710936336]
[2024-06-20 19:00:28,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:28,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:28,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:39,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:39,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:39,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710936336]
[2024-06-20 19:00:39,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710936336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:39,571 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:39,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:00:39,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155138135]
[2024-06-20 19:00:39,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:39,571 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:00:39,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:39,572 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:00:39,572 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:00:39,715 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:00:39,715 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 272 transitions, 3778 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:39,715 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:39,715 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:00:39,715 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:42,054 INFO  L124   PetriNetUnfolderBase]: 4457/6834 cut-off events.
[2024-06-20 19:00:42,054 INFO  L125   PetriNetUnfolderBase]: For 598424/598426 co-relation queries the response was YES.
[2024-06-20 19:00:42,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63177 conditions, 6834 events. 4457/6834 cut-off events. For 598424/598426 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 39224 event pairs, 1101 based on Foata normal form. 6/6839 useless extension candidates. Maximal degree in co-relation 63072. Up to 6332 conditions per place. 
[2024-06-20 19:00:42,131 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 231 selfloop transitions, 71 changer transitions 0/305 dead transitions.
[2024-06-20 19:00:42,131 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 305 transitions, 4894 flow
[2024-06-20 19:00:42,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:00:42,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:00:42,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions.
[2024-06-20 19:00:42,132 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4529616724738676
[2024-06-20 19:00:42,132 INFO  L175             Difference]: Start difference. First operand has 209 places, 272 transitions, 3778 flow. Second operand 7 states and 130 transitions.
[2024-06-20 19:00:42,132 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 305 transitions, 4894 flow
[2024-06-20 19:00:42,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 305 transitions, 4823 flow, removed 29 selfloop flow, removed 3 redundant places.
[2024-06-20 19:00:42,908 INFO  L231             Difference]: Finished difference. Result has 214 places, 285 transitions, 4137 flow
[2024-06-20 19:00:42,908 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3707, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4137, PETRI_PLACES=214, PETRI_TRANSITIONS=285}
[2024-06-20 19:00:42,908 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places.
[2024-06-20 19:00:42,908 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 285 transitions, 4137 flow
[2024-06-20 19:00:42,908 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:42,908 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:42,908 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:42,909 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-20 19:00:42,909 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-20 19:00:42,909 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:42,909 INFO  L85        PathProgramCache]: Analyzing trace with hash -962735428, now seen corresponding path program 4 times
[2024-06-20 19:00:42,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:42,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363404198]
[2024-06-20 19:00:42,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:42,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:42,959 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:00:52,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:00:52,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:00:52,253 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363404198]
[2024-06-20 19:00:52,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363404198] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:00:52,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:00:52,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:00:52,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390478238]
[2024-06-20 19:00:52,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:00:52,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:00:52,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:00:52,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:00:52,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:00:52,483 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:00:52,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 285 transitions, 4137 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:52,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:00:52,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:00:52,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:00:55,033 INFO  L124   PetriNetUnfolderBase]: 4482/6872 cut-off events.
[2024-06-20 19:00:55,033 INFO  L125   PetriNetUnfolderBase]: For 620698/620702 co-relation queries the response was YES.
[2024-06-20 19:00:55,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64194 conditions, 6872 events. 4482/6872 cut-off events. For 620698/620702 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 39521 event pairs, 1170 based on Foata normal form. 10/6881 useless extension candidates. Maximal degree in co-relation 64086. Up to 6721 conditions per place. 
[2024-06-20 19:00:55,110 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 277 selfloop transitions, 33 changer transitions 0/313 dead transitions.
[2024-06-20 19:00:55,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 313 transitions, 4943 flow
[2024-06-20 19:00:55,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:00:55,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:00:55,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions.
[2024-06-20 19:00:55,112 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4298780487804878
[2024-06-20 19:00:55,112 INFO  L175             Difference]: Start difference. First operand has 214 places, 285 transitions, 4137 flow. Second operand 8 states and 141 transitions.
[2024-06-20 19:00:55,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 313 transitions, 4943 flow
[2024-06-20 19:00:55,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 313 transitions, 4844 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-20 19:00:55,727 INFO  L231             Difference]: Finished difference. Result has 219 places, 288 transitions, 4242 flow
[2024-06-20 19:00:55,727 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4038, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4242, PETRI_PLACES=219, PETRI_TRANSITIONS=288}
[2024-06-20 19:00:55,728 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 177 predicate places.
[2024-06-20 19:00:55,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 288 transitions, 4242 flow
[2024-06-20 19:00:55,728 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:00:55,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:00:55,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:00:55,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-20 19:00:55,728 INFO  L420      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:00:55,728 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:00:55,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -971932198, now seen corresponding path program 5 times
[2024-06-20 19:00:55,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:00:55,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521662434]
[2024-06-20 19:00:55,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:00:55,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:00:55,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:05,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:05,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:05,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521662434]
[2024-06-20 19:01:05,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521662434] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:05,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:05,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:01:05,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236728079]
[2024-06-20 19:01:05,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:05,734 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:01:05,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:05,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:01:05,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:01:05,860 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:01:05,860 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 288 transitions, 4242 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:05,860 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:05,860 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:01:05,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:08,640 INFO  L124   PetriNetUnfolderBase]: 4558/6988 cut-off events.
[2024-06-20 19:01:08,641 INFO  L125   PetriNetUnfolderBase]: For 666455/666459 co-relation queries the response was YES.
[2024-06-20 19:01:08,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 66014 conditions, 6988 events. 4558/6988 cut-off events. For 666455/666459 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 40316 event pairs, 1228 based on Foata normal form. 16/7003 useless extension candidates. Maximal degree in co-relation 65905. Up to 6668 conditions per place. 
[2024-06-20 19:01:08,717 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 268 selfloop transitions, 52 changer transitions 0/323 dead transitions.
[2024-06-20 19:01:08,718 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 323 transitions, 5494 flow
[2024-06-20 19:01:08,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:01:08,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:01:08,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions.
[2024-06-20 19:01:08,719 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4451219512195122
[2024-06-20 19:01:08,719 INFO  L175             Difference]: Start difference. First operand has 219 places, 288 transitions, 4242 flow. Second operand 8 states and 146 transitions.
[2024-06-20 19:01:08,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 323 transitions, 5494 flow
[2024-06-20 19:01:09,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 323 transitions, 5314 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-20 19:01:09,458 INFO  L231             Difference]: Finished difference. Result has 221 places, 296 transitions, 4522 flow
[2024-06-20 19:01:09,458 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4062, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4522, PETRI_PLACES=221, PETRI_TRANSITIONS=296}
[2024-06-20 19:01:09,458 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places.
[2024-06-20 19:01:09,458 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 296 transitions, 4522 flow
[2024-06-20 19:01:09,458 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:09,458 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:09,458 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:09,458 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-20 19:01:09,459 INFO  L420      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:09,460 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:09,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -971939638, now seen corresponding path program 6 times
[2024-06-20 19:01:09,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:09,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834449260]
[2024-06-20 19:01:09,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:09,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:09,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:18,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:18,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:18,738 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834449260]
[2024-06-20 19:01:18,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834449260] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:18,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:18,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:01:18,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581558143]
[2024-06-20 19:01:18,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:18,739 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:01:18,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:18,739 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:01:18,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:01:18,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:01:18,939 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 296 transitions, 4522 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:18,939 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:18,939 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:01:18,939 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:21,602 INFO  L124   PetriNetUnfolderBase]: 4532/6950 cut-off events.
[2024-06-20 19:01:21,602 INFO  L125   PetriNetUnfolderBase]: For 670277/670281 co-relation queries the response was YES.
[2024-06-20 19:01:21,646 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 65506 conditions, 6950 events. 4532/6950 cut-off events. For 670277/670281 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 40072 event pairs, 1226 based on Foata normal form. 16/6965 useless extension candidates. Maximal degree in co-relation 65396. Up to 6758 conditions per place. 
[2024-06-20 19:01:21,673 INFO  L140   encePairwiseOnDemand]: 30/41 looper letters, 274 selfloop transitions, 44 changer transitions 0/321 dead transitions.
[2024-06-20 19:01:21,673 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 321 transitions, 5224 flow
[2024-06-20 19:01:21,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-20 19:01:21,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-20 19:01:21,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 143 transitions.
[2024-06-20 19:01:21,674 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43597560975609756
[2024-06-20 19:01:21,674 INFO  L175             Difference]: Start difference. First operand has 221 places, 296 transitions, 4522 flow. Second operand 8 states and 143 transitions.
[2024-06-20 19:01:21,674 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 321 transitions, 5224 flow
[2024-06-20 19:01:22,476 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 321 transitions, 4872 flow, removed 153 selfloop flow, removed 4 redundant places.
[2024-06-20 19:01:22,480 INFO  L231             Difference]: Finished difference. Result has 225 places, 296 transitions, 4268 flow
[2024-06-20 19:01:22,481 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4170, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4268, PETRI_PLACES=225, PETRI_TRANSITIONS=296}
[2024-06-20 19:01:22,481 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 183 predicate places.
[2024-06-20 19:01:22,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 296 transitions, 4268 flow
[2024-06-20 19:01:22,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:22,481 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:22,481 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:22,481 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-20 19:01:22,481 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-20 19:01:22,482 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:22,482 INFO  L85        PathProgramCache]: Analyzing trace with hash -1228647910, now seen corresponding path program 10 times
[2024-06-20 19:01:22,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:22,482 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065137024]
[2024-06-20 19:01:22,482 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:22,482 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:22,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:31,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:31,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:31,669 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065137024]
[2024-06-20 19:01:31,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065137024] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:31,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:31,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-20 19:01:31,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009563795]
[2024-06-20 19:01:31,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:31,669 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-20 19:01:31,669 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:31,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-20 19:01:31,670 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-20 19:01:31,824 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:01:31,824 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 296 transitions, 4268 flow. Second operand  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:31,824 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:31,824 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:01:31,824 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:34,532 INFO  L124   PetriNetUnfolderBase]: 4532/6950 cut-off events.
[2024-06-20 19:01:34,532 INFO  L125   PetriNetUnfolderBase]: For 701867/701871 co-relation queries the response was YES.
[2024-06-20 19:01:34,588 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62716 conditions, 6950 events. 4532/6950 cut-off events. For 701867/701871 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39978 event pairs, 1169 based on Foata normal form. 58/7007 useless extension candidates. Maximal degree in co-relation 62604. Up to 6477 conditions per place. 
[2024-06-20 19:01:34,622 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 280 selfloop transitions, 50 changer transitions 0/333 dead transitions.
[2024-06-20 19:01:34,622 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 333 transitions, 5193 flow
[2024-06-20 19:01:34,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-20 19:01:34,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-20 19:01:34,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions.
[2024-06-20 19:01:34,623 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44173441734417346
[2024-06-20 19:01:34,623 INFO  L175             Difference]: Start difference. First operand has 225 places, 296 transitions, 4268 flow. Second operand 9 states and 163 transitions.
[2024-06-20 19:01:34,623 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 333 transitions, 5193 flow
[2024-06-20 19:01:35,377 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 333 transitions, 5091 flow, removed 3 selfloop flow, removed 7 redundant places.
[2024-06-20 19:01:35,381 INFO  L231             Difference]: Finished difference. Result has 227 places, 299 transitions, 4434 flow
[2024-06-20 19:01:35,382 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4166, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4434, PETRI_PLACES=227, PETRI_TRANSITIONS=299}
[2024-06-20 19:01:35,382 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places.
[2024-06-20 19:01:35,382 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 299 transitions, 4434 flow
[2024-06-20 19:01:35,382 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:35,382 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:35,383 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:35,383 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-20 19:01:35,383 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:35,383 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:35,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -2019848743, now seen corresponding path program 2 times
[2024-06-20 19:01:35,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:35,384 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641566676]
[2024-06-20 19:01:35,384 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:35,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:35,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:46,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:46,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:46,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641566676]
[2024-06-20 19:01:46,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641566676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:46,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:46,001 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:46,001 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997206492]
[2024-06-20 19:01:46,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:46,001 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:46,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:46,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:46,002 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:46,172 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:01:46,173 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 299 transitions, 4434 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:46,173 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:46,173 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:01:46,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:01:48,643 INFO  L124   PetriNetUnfolderBase]: 4547/6970 cut-off events.
[2024-06-20 19:01:48,643 INFO  L125   PetriNetUnfolderBase]: For 636952/636952 co-relation queries the response was YES.
[2024-06-20 19:01:48,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63419 conditions, 6970 events. 4547/6970 cut-off events. For 636952/636952 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 40123 event pairs, 1200 based on Foata normal form. 3/6972 useless extension candidates. Maximal degree in co-relation 63306. Up to 6943 conditions per place. 
[2024-06-20 19:01:48,717 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 295 selfloop transitions, 15 changer transitions 0/313 dead transitions.
[2024-06-20 19:01:48,717 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 313 transitions, 5126 flow
[2024-06-20 19:01:48,718 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:01:48,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:01:48,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-20 19:01:48,718 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3797909407665505
[2024-06-20 19:01:48,719 INFO  L175             Difference]: Start difference. First operand has 227 places, 299 transitions, 4434 flow. Second operand 7 states and 109 transitions.
[2024-06-20 19:01:48,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 313 transitions, 5126 flow
[2024-06-20 19:01:49,469 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 313 transitions, 4929 flow, removed 52 selfloop flow, removed 7 redundant places.
[2024-06-20 19:01:49,473 INFO  L231             Difference]: Finished difference. Result has 227 places, 302 transitions, 4323 flow
[2024-06-20 19:01:49,474 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4237, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4323, PETRI_PLACES=227, PETRI_TRANSITIONS=302}
[2024-06-20 19:01:49,474 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places.
[2024-06-20 19:01:49,474 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 302 transitions, 4323 flow
[2024-06-20 19:01:49,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:49,475 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:01:49,475 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:01:49,475 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-20 19:01:49,475 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:01:49,475 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:01:49,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 885355941, now seen corresponding path program 3 times
[2024-06-20 19:01:49,475 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:01:49,476 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397396604]
[2024-06-20 19:01:49,476 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:01:49,476 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:01:49,529 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:01:59,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:01:59,714 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:01:59,714 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397396604]
[2024-06-20 19:01:59,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397396604] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:01:59,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:01:59,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:01:59,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738013778]
[2024-06-20 19:01:59,715 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:01:59,715 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:01:59,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:01:59,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:01:59,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:01:59,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:01:59,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 302 transitions, 4323 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:01:59,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:01:59,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:01:59,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:02,237 INFO  L124   PetriNetUnfolderBase]: 4541/6965 cut-off events.
[2024-06-20 19:02:02,237 INFO  L125   PetriNetUnfolderBase]: For 626085/626087 co-relation queries the response was YES.
[2024-06-20 19:02:02,284 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61636 conditions, 6965 events. 4541/6965 cut-off events. For 626085/626087 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 40099 event pairs, 1202 based on Foata normal form. 6/6970 useless extension candidates. Maximal degree in co-relation 61522. Up to 6869 conditions per place. 
[2024-06-20 19:02:02,310 INFO  L140   encePairwiseOnDemand]: 29/41 looper letters, 276 selfloop transitions, 35 changer transitions 0/314 dead transitions.
[2024-06-20 19:02:02,310 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 314 transitions, 5097 flow
[2024-06-20 19:02:02,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:02,311 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:02,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-20 19:02:02,311 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4181184668989547
[2024-06-20 19:02:02,312 INFO  L175             Difference]: Start difference. First operand has 227 places, 302 transitions, 4323 flow. Second operand 7 states and 120 transitions.
[2024-06-20 19:02:02,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 314 transitions, 5097 flow
[2024-06-20 19:02:02,980 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 314 transitions, 5020 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-20 19:02:02,985 INFO  L231             Difference]: Finished difference. Result has 229 places, 302 transitions, 4326 flow
[2024-06-20 19:02:02,985 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4246, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4326, PETRI_PLACES=229, PETRI_TRANSITIONS=302}
[2024-06-20 19:02:02,985 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places.
[2024-06-20 19:02:02,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 229 places, 302 transitions, 4326 flow
[2024-06-20 19:02:02,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:02,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:02,985 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:02,985 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-20 19:02:02,986 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:02,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:02,986 INFO  L85        PathProgramCache]: Analyzing trace with hash 885356313, now seen corresponding path program 3 times
[2024-06-20 19:02:02,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:02,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81905662]
[2024-06-20 19:02:02,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:02,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:03,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:14,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:14,497 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:14,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81905662]
[2024-06-20 19:02:14,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81905662] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:14,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:14,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:14,498 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826705564]
[2024-06-20 19:02:14,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:14,498 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:14,498 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:14,498 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:14,499 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:02:14,628 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:02:14,629 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 302 transitions, 4326 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:14,629 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:14,629 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:02:14,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:17,004 INFO  L124   PetriNetUnfolderBase]: 4532/6951 cut-off events.
[2024-06-20 19:02:17,005 INFO  L125   PetriNetUnfolderBase]: For 635996/635996 co-relation queries the response was YES.
[2024-06-20 19:02:17,051 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61674 conditions, 6951 events. 4532/6951 cut-off events. For 635996/635996 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 39995 event pairs, 1194 based on Foata normal form. 3/6953 useless extension candidates. Maximal degree in co-relation 61560. Up to 6912 conditions per place. 
[2024-06-20 19:02:17,079 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 292 selfloop transitions, 20 changer transitions 0/315 dead transitions.
[2024-06-20 19:02:17,079 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 315 transitions, 4984 flow
[2024-06-20 19:02:17,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:17,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:17,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions.
[2024-06-20 19:02:17,080 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39372822299651566
[2024-06-20 19:02:17,080 INFO  L175             Difference]: Start difference. First operand has 229 places, 302 transitions, 4326 flow. Second operand 7 states and 113 transitions.
[2024-06-20 19:02:17,080 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 315 transitions, 4984 flow
[2024-06-20 19:02:17,843 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 315 transitions, 4679 flow, removed 31 selfloop flow, removed 9 redundant places.
[2024-06-20 19:02:17,847 INFO  L231             Difference]: Finished difference. Result has 227 places, 302 transitions, 4067 flow
[2024-06-20 19:02:17,847 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4021, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4067, PETRI_PLACES=227, PETRI_TRANSITIONS=302}
[2024-06-20 19:02:17,847 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 185 predicate places.
[2024-06-20 19:02:17,847 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 302 transitions, 4067 flow
[2024-06-20 19:02:17,847 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:17,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:17,848 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:17,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-20 19:02:17,848 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:17,848 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:17,848 INFO  L85        PathProgramCache]: Analyzing trace with hash -1862862471, now seen corresponding path program 1 times
[2024-06-20 19:02:17,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:17,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473210980]
[2024-06-20 19:02:17,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:17,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:17,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:33,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:33,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:33,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473210980]
[2024-06-20 19:02:33,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473210980] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:33,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:33,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:33,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142803353]
[2024-06-20 19:02:33,098 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:33,098 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:33,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:33,098 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:33,098 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:02:33,228 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:02:33,228 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 302 transitions, 4067 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:33,228 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:33,229 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:02:33,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:35,715 INFO  L124   PetriNetUnfolderBase]: 4577/7014 cut-off events.
[2024-06-20 19:02:35,715 INFO  L125   PetriNetUnfolderBase]: For 661850/661850 co-relation queries the response was YES.
[2024-06-20 19:02:35,765 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61683 conditions, 7014 events. 4577/7014 cut-off events. For 661850/661850 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40412 event pairs, 1192 based on Foata normal form. 9/7022 useless extension candidates. Maximal degree in co-relation 61570. Up to 6836 conditions per place. 
[2024-06-20 19:02:35,794 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 294 selfloop transitions, 33 changer transitions 0/330 dead transitions.
[2024-06-20 19:02:35,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 330 transitions, 5023 flow
[2024-06-20 19:02:35,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:35,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:35,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions.
[2024-06-20 19:02:35,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4425087108013937
[2024-06-20 19:02:35,795 INFO  L175             Difference]: Start difference. First operand has 227 places, 302 transitions, 4067 flow. Second operand 7 states and 127 transitions.
[2024-06-20 19:02:35,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 330 transitions, 5023 flow
[2024-06-20 19:02:36,501 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 330 transitions, 4958 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-06-20 19:02:36,505 INFO  L231             Difference]: Finished difference. Result has 228 places, 309 transitions, 4178 flow
[2024-06-20 19:02:36,505 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4002, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4178, PETRI_PLACES=228, PETRI_TRANSITIONS=309}
[2024-06-20 19:02:36,506 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places.
[2024-06-20 19:02:36,506 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 309 transitions, 4178 flow
[2024-06-20 19:02:36,506 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:36,506 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:36,506 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:36,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-20 19:02:36,507 INFO  L420      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:36,507 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:36,507 INFO  L85        PathProgramCache]: Analyzing trace with hash -2051613451, now seen corresponding path program 2 times
[2024-06-20 19:02:36,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:36,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278619366]
[2024-06-20 19:02:36,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:36,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:36,539 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:02:52,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-20 19:02:52,307 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:02:52,307 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278619366]
[2024-06-20 19:02:52,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278619366] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:02:52,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:02:52,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:02:52,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969385449]
[2024-06-20 19:02:52,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:02:52,307 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:02:52,308 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:02:52,308 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:02:52,308 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:02:52,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:02:52,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 309 transitions, 4178 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:52,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:02:52,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:02:52,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:02:55,038 INFO  L124   PetriNetUnfolderBase]: 4592/7037 cut-off events.
[2024-06-20 19:02:55,038 INFO  L125   PetriNetUnfolderBase]: For 672379/672381 co-relation queries the response was YES.
[2024-06-20 19:02:55,093 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62761 conditions, 7037 events. 4592/7037 cut-off events. For 672379/672381 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40525 event pairs, 1208 based on Foata normal form. 3/7039 useless extension candidates. Maximal degree in co-relation 62647. Up to 6844 conditions per place. 
[2024-06-20 19:02:55,127 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 290 selfloop transitions, 41 changer transitions 0/334 dead transitions.
[2024-06-20 19:02:55,127 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 334 transitions, 5248 flow
[2024-06-20 19:02:55,127 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:02:55,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:02:55,128 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 19:02:55,128 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-20 19:02:55,128 INFO  L175             Difference]: Start difference. First operand has 228 places, 309 transitions, 4178 flow. Second operand 7 states and 126 transitions.
[2024-06-20 19:02:55,128 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 334 transitions, 5248 flow
[2024-06-20 19:02:55,882 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 334 transitions, 5162 flow, removed 32 selfloop flow, removed 3 redundant places.
[2024-06-20 19:02:55,886 INFO  L231             Difference]: Finished difference. Result has 232 places, 315 transitions, 4287 flow
[2024-06-20 19:02:55,887 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4096, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4287, PETRI_PLACES=232, PETRI_TRANSITIONS=315}
[2024-06-20 19:02:55,887 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 190 predicate places.
[2024-06-20 19:02:55,887 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 315 transitions, 4287 flow
[2024-06-20 19:02:55,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:02:55,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:02:55,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:02:55,888 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-20 19:02:55,888 INFO  L420      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:02:55,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:02:55,888 INFO  L85        PathProgramCache]: Analyzing trace with hash 885540825, now seen corresponding path program 3 times
[2024-06-20 19:02:55,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:02:55,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163590037]
[2024-06-20 19:02:55,889 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:02:55,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:02:55,935 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-20 19:03:11,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-20 19:03:11,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-20 19:03:11,442 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163590037]
[2024-06-20 19:03:11,442 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163590037] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-20 19:03:11,442 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-20 19:03:11,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-20 19:03:11,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925215097]
[2024-06-20 19:03:11,442 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-20 19:03:11,442 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-20 19:03:11,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-20 19:03:11,443 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-20 19:03:11,443 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2024-06-20 19:03:11,625 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41
[2024-06-20 19:03:11,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 315 transitions, 4287 flow. Second operand  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:03:11,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-20 19:03:11,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41
[2024-06-20 19:03:11,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-20 19:03:14,291 INFO  L124   PetriNetUnfolderBase]: 4583/7025 cut-off events.
[2024-06-20 19:03:14,291 INFO  L125   PetriNetUnfolderBase]: For 684769/684771 co-relation queries the response was YES.
[2024-06-20 19:03:14,339 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 62804 conditions, 7025 events. 4583/7025 cut-off events. For 684769/684771 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40442 event pairs, 1206 based on Foata normal form. 3/7027 useless extension candidates. Maximal degree in co-relation 62688. Up to 6840 conditions per place. 
[2024-06-20 19:03:14,368 INFO  L140   encePairwiseOnDemand]: 31/41 looper letters, 293 selfloop transitions, 39 changer transitions 0/335 dead transitions.
[2024-06-20 19:03:14,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 335 transitions, 5135 flow
[2024-06-20 19:03:14,368 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-20 19:03:14,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-20 19:03:14,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions.
[2024-06-20 19:03:14,369 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43902439024390244
[2024-06-20 19:03:14,369 INFO  L175             Difference]: Start difference. First operand has 232 places, 315 transitions, 4287 flow. Second operand 7 states and 126 transitions.
[2024-06-20 19:03:14,369 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 335 transitions, 5135 flow
[2024-06-20 19:03:15,287 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 335 transitions, 5027 flow, removed 38 selfloop flow, removed 3 redundant places.
[2024-06-20 19:03:15,291 INFO  L231             Difference]: Finished difference. Result has 236 places, 315 transitions, 4263 flow
[2024-06-20 19:03:15,291 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4179, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4263, PETRI_PLACES=236, PETRI_TRANSITIONS=315}
[2024-06-20 19:03:15,291 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 194 predicate places.
[2024-06-20 19:03:15,291 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 315 transitions, 4263 flow
[2024-06-20 19:03:15,292 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-20 19:03:15,292 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-20 19:03:15,292 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-20 19:03:15,292 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-20 19:03:15,292 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-20 19:03:15,292 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-20 19:03:15,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 1593641603, now seen corresponding path program 1 times
[2024-06-20 19:03:15,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-20 19:03:15,292 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525690737]
[2024-06-20 19:03:15,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-20 19:03:15,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-20 19:03:15,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
Killed by 15