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


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


Checking for ERROR reachability
Using default analysis
Version cde23df1
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/mix045_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix045_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-cde23df-m
[2024-06-14 15:19:47,079 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-06-14 15:19:47,145 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-06-14 15:19:47,148 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-06-14 15:19:47,149 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-06-14 15:19:47,165 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-06-14 15:19:47,166 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-06-14 15:19:47,166 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-06-14 15:19:47,166 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-06-14 15:19:47,169 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-06-14 15:19:47,170 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-06-14 15:19:47,170 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-06-14 15:19:47,171 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-06-14 15:19:47,171 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-06-14 15:19:47,172 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-06-14 15:19:47,172 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-06-14 15:19:47,172 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-06-14 15:19:47,172 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-06-14 15:19:47,172 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-06-14 15:19:47,173 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-06-14 15:19:47,173 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-06-14 15:19:47,173 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-06-14 15:19:47,173 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-06-14 15:19:47,174 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-06-14 15:19:47,174 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-06-14 15:19:47,174 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-06-14 15:19:47,174 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-06-14 15:19:47,174 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-06-14 15:19:47,175 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-06-14 15:19:47,175 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-06-14 15:19:47,176 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-06-14 15:19:47,176 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-06-14 15:19:47,176 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:19:47,176 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-06-14 15:19:47,176 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-06-14 15:19:47,177 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-06-14 15:19:47,177 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-06-14 15:19:47,177 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-06-14 15:19:47,177 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-06-14 15:19:47,178 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-06-14 15:19:47,178 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-06-14 15:19:47,178 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-06-14 15:19:47,178 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-06-14 15:19:47,178 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-14 15:19:47,408 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-06-14 15:19:47,428 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-06-14 15:19:47,430 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-06-14 15:19:47,431 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-06-14 15:19:47,431 INFO  L274        PluginConnector]: CDTParser initialized
[2024-06-14 15:19:47,432 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 15:19:48,400 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-06-14 15:19:48,632 INFO  L384              CDTParser]: Found 1 translation units.
[2024-06-14 15:19:48,632 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 15:19:48,648 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241724950/3b581041dec248fb99607a4360aabe31/FLAG100ce0eee
[2024-06-14 15:19:48,658 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/241724950/3b581041dec248fb99607a4360aabe31
[2024-06-14 15:19:48,660 INFO  L270        PluginConnector]: Initializing Witness Parser...
[2024-06-14 15:19:48,661 INFO  L274        PluginConnector]: Witness Parser initialized
[2024-06-14 15:19:48,661 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/mix045_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml
[2024-06-14 15:19:48,839 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-06-14 15:19:48,840 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-06-14 15:19:48,841 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-06-14 15:19:48,841 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-06-14 15:19:48,846 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-06-14 15:19:48,846 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:19:48" (1/2) ...
[2024-06-14 15:19:48,849 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6928ad6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:48, skipping insertion in model container
[2024-06-14 15:19:48,849 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:19:48" (1/2) ...
[2024-06-14 15:19:48,851 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ef31215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:19:48, skipping insertion in model container
[2024-06-14 15:19:48,851 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:48" (2/2) ...
[2024-06-14 15:19:48,851 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6928ad6b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:48, skipping insertion in model container
[2024-06-14 15:19:48,852 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:48" (2/2) ...
[2024-06-14 15:19:48,852 INFO  L83    nessWitnessExtractor]: Extracting all invariants from correctness witness
[2024-06-14 15:19:48,929 INFO  L95    edCorrectnessWitness]: Found the following entries in the witness:
[2024-06-14 15:19:48,930 INFO  L97    edCorrectnessWitness]: Location invariant before [L846-L846] (((((((((((((((((((! multithreaded || a$read_delayed_var == 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 <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )y + (long long )z >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))
[2024-06-14 15:19:48,931 INFO  L97    edCorrectnessWitness]: Location invariant before [L847-L847] (((((((((((((((((((! multithreaded || a$read_delayed_var == 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 <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )y + (long long )z >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))
[2024-06-14 15:19:48,932 INFO  L97    edCorrectnessWitness]: Location invariant before [L844-L844] (((((((((((((((((((! multithreaded || a$read_delayed_var == 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 <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || a$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )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 )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a$w_buff1 >= 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 )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )x >= 0LL) && (long long )a$r_buff0_thd3 + (long long )y >= 0LL) && (long long )a$r_buff0_thd3 + (long long )z >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )x >= 0LL) && (long long )a$r_buff1_thd3 + (long long )y >= 0LL) && (long long )a$r_buff1_thd3 + (long long )z >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (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 )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 )y + (long long )z >= 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 )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) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff0_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$r_buff1_thd3 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd3) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd3) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd3 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff0_thd3 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$r_buff1_thd3 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$read_delayed_var == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))
[2024-06-14 15:19:48,932 INFO  L103   edCorrectnessWitness]: ghost_variable multithreaded = 0
[2024-06-14 15:19:48,933 INFO  L106   edCorrectnessWitness]: ghost_update [L842-L842] multithreaded = 1;
[2024-06-14 15:19:48,971 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-06-14 15:19:49,275 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:19:49,283 INFO  L202         MainTranslator]: Completed pre-run
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
Start Parsing Local
[2024-06-14 15:19:49,583 INFO  L207          PostProcessor]: Analyzing one entry point: main
[2024-06-14 15:19:49,620 INFO  L206         MainTranslator]: Completed translation
[2024-06-14 15:19:49,621 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49 WrapperNode
[2024-06-14 15:19:49,621 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-06-14 15:19:49,622 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-06-14 15:19:49,622 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-06-14 15:19:49,622 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-06-14 15:19:49,627 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 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,674 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 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,804 INFO  L138                Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 126
[2024-06-14 15:19:49,805 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-06-14 15:19:49,805 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-06-14 15:19:49,805 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-06-14 15:19:49,806 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-06-14 15:19:49,814 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,815 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,842 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,897 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-14 15:19:49,897 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,898 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,938 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,941 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,959 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:49,966 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:50,002 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-06-14 15:19:50,003 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-06-14 15:19:50,004 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-06-14 15:19:50,004 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-06-14 15:19:50,005 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (1/1) ...
[2024-06-14 15:19:50,009 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-06-14 15:19:50,017 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-06-14 15:19:50,032 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-14 15:19:50,049 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-14 15:19:50,078 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-06-14 15:19:50,078 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-06-14 15:19:50,078 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-06-14 15:19:50,078 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-06-14 15:19:50,078 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-06-14 15:19:50,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-06-14 15:19:50,079 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-06-14 15:19:50,079 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-06-14 15:19:50,079 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-06-14 15:19:50,079 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-06-14 15:19:50,080 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-06-14 15:19:50,080 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-06-14 15:19:50,081 WARN  L214             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-06-14 15:19:50,212 INFO  L244             CfgBuilder]: Building ICFG
[2024-06-14 15:19:50,214 INFO  L270             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-06-14 15:19:51,469 INFO  L289             CfgBuilder]: Ommited future-live optimization because the input is a concurrent program.
[2024-06-14 15:19:51,469 INFO  L293             CfgBuilder]: Performing block encoding
[2024-06-14 15:19:51,771 INFO  L315             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-06-14 15:19:51,771 INFO  L320             CfgBuilder]: Removed 0 assume(true) statements.
[2024-06-14 15:19:51,772 INFO  L201        PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:19:51 BoogieIcfgContainer
[2024-06-14 15:19:51,773 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-06-14 15:19:51,775 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-06-14 15:19:51,775 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-06-14 15:19:51,778 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-06-14 15:19:51,779 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:19:48" (1/4) ...
[2024-06-14 15:19:51,780 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bdfce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:19:51, skipping insertion in model container
[2024-06-14 15:19:51,780 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:19:48" (2/4) ...
[2024-06-14 15:19:51,781 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bdfce4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:19:51, skipping insertion in model container
[2024-06-14 15:19:51,781 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:19:49" (3/4) ...
[2024-06-14 15:19:51,781 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30bdfce4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:19:51, skipping insertion in model container
[2024-06-14 15:19:51,782 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:19:51" (4/4) ...
[2024-06-14 15:19:51,783 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix045_power.oepc_pso.oepc_rmo.oepc.i
[2024-06-14 15:19:51,800 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-06-14 15:19:51,801 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-06-14 15:19:51,801 INFO  L522   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-06-14 15:19:51,924 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-06-14 15:19:51,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 43 transitions, 98 flow
[2024-06-14 15:19:52,029 INFO  L124   PetriNetUnfolderBase]: 0/40 cut-off events.
[2024-06-14 15:19:52,030 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:19:52,033 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. 
[2024-06-14 15:19:52,033 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 43 transitions, 98 flow
[2024-06-14 15:19:52,051 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow
[2024-06-14 15:19:52,086 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-06-14 15:19:52,108 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;@63c01e69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-06-14 15:19:52,108 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-06-14 15:19:52,117 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-06-14 15:19:52,117 INFO  L124   PetriNetUnfolderBase]: 0/6 cut-off events.
[2024-06-14 15:19:52,117 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-06-14 15:19:52,118 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:19:52,118 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2024-06-14 15:19:52,118 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-14 15:19:52,123 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:19:52,123 INFO  L85        PathProgramCache]: Analyzing trace with hash -1242904811, now seen corresponding path program 1 times
[2024-06-14 15:19:52,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:19:52,146 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622694924]
[2024-06-14 15:19:52,146 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:19:52,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:19:52,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:19:57,900 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-14 15:19:57,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:19:57,901 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622694924]
[2024-06-14 15:19:57,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622694924] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:19:57,901 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:19:57,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-06-14 15:19:57,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713766266]
[2024-06-14 15:19:57,903 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:19:57,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-06-14 15:19:57,913 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:19:57,929 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-06-14 15:19:57,930 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-06-14 15:19:58,017 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 15:19:58,019 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:19:58,019 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:19:58,020 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 15:19:58,020 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:19:59,106 INFO  L124   PetriNetUnfolderBase]: 1911/2898 cut-off events.
[2024-06-14 15:19:59,107 INFO  L125   PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES.
[2024-06-14 15:19:59,114 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5824 conditions, 2898 events. 1911/2898 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13775 event pairs, 1379 based on Foata normal form. 1/2815 useless extension candidates. Maximal degree in co-relation 5809. Up to 2825 conditions per place. 
[2024-06-14 15:19:59,124 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 36 selfloop transitions, 4 changer transitions 0/44 dead transitions.
[2024-06-14 15:19:59,124 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 183 flow
[2024-06-14 15:19:59,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-06-14 15:19:59,127 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-06-14 15:19:59,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions.
[2024-06-14 15:19:59,134 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5658914728682171
[2024-06-14 15:19:59,135 INFO  L175             Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 73 transitions.
[2024-06-14 15:19:59,136 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 183 flow
[2024-06-14 15:19:59,137 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-06-14 15:19:59,139 INFO  L231             Difference]: Finished difference. Result has 44 places, 37 transitions, 104 flow
[2024-06-14 15:19:59,140 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=37}
[2024-06-14 15:19:59,142 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places.
[2024-06-14 15:19:59,143 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 104 flow
[2024-06-14 15:19:59,143 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:19:59,143 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:19:59,143 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:19:59,143 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-06-14 15:19:59,144 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-14 15:19:59,144 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:19:59,144 INFO  L85        PathProgramCache]: Analyzing trace with hash -430571596, now seen corresponding path program 1 times
[2024-06-14 15:19:59,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:19:59,145 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738620640]
[2024-06-14 15:19:59,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:19:59,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:19:59,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:03,546 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-14 15:20:03,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:03,547 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738620640]
[2024-06-14 15:20:03,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738620640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:03,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:03,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-06-14 15:20:03,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753751470]
[2024-06-14 15:20:03,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:03,549 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-06-14 15:20:03,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:03,550 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-06-14 15:20:03,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-06-14 15:20:03,663 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 15:20:03,664 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 104 flow. Second operand  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:03,664 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:03,664 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 15:20:03,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:04,726 INFO  L124   PetriNetUnfolderBase]: 1905/2889 cut-off events.
[2024-06-14 15:20:04,726 INFO  L125   PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES.
[2024-06-14 15:20:04,733 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 2889 events. 1905/2889 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13747 event pairs, 1212 based on Foata normal form. 3/2848 useless extension candidates. Maximal degree in co-relation 6497. Up to 2801 conditions per place. 
[2024-06-14 15:20:04,743 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions.
[2024-06-14 15:20:04,744 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 250 flow
[2024-06-14 15:20:04,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-06-14 15:20:04,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-06-14 15:20:04,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions.
[2024-06-14 15:20:04,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5406976744186046
[2024-06-14 15:20:04,748 INFO  L175             Difference]: Start difference. First operand has 44 places, 37 transitions, 104 flow. Second operand 4 states and 93 transitions.
[2024-06-14 15:20:04,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 250 flow
[2024-06-14 15:20:04,754 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-06-14 15:20:04,756 INFO  L231             Difference]: Finished difference. Result has 47 places, 40 transitions, 140 flow
[2024-06-14 15:20:04,757 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=40}
[2024-06-14 15:20:04,757 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places.
[2024-06-14 15:20:04,758 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 140 flow
[2024-06-14 15:20:04,758 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:04,758 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:04,759 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:04,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-06-14 15:20:04,761 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-14 15:20:04,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:04,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -462816168, now seen corresponding path program 1 times
[2024-06-14 15:20:04,762 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:04,766 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793130313]
[2024-06-14 15:20:04,766 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:04,766 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:04,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:08,985 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-14 15:20:08,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:08,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793130313]
[2024-06-14 15:20:08,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793130313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:08,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:08,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-06-14 15:20:08,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668483232]
[2024-06-14 15:20:08,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:08,987 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-06-14 15:20:08,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:08,987 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-06-14 15:20:08,988 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-06-14 15:20:09,107 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 15:20:09,107 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 140 flow. Second operand  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:09,107 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:09,107 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 15:20:09,107 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:10,263 INFO  L124   PetriNetUnfolderBase]: 1913/2919 cut-off events.
[2024-06-14 15:20:10,263 INFO  L125   PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES.
[2024-06-14 15:20:10,266 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7251 conditions, 2919 events. 1913/2919 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13996 event pairs, 951 based on Foata normal form. 5/2891 useless extension candidates. Maximal degree in co-relation 7234. Up to 2747 conditions per place. 
[2024-06-14 15:20:10,275 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 56 selfloop transitions, 16 changer transitions 0/76 dead transitions.
[2024-06-14 15:20:10,276 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 404 flow
[2024-06-14 15:20:10,277 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:20:10,277 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:20:10,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions.
[2024-06-14 15:20:10,278 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5627906976744186
[2024-06-14 15:20:10,278 INFO  L175             Difference]: Start difference. First operand has 47 places, 40 transitions, 140 flow. Second operand 5 states and 121 transitions.
[2024-06-14 15:20:10,278 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 404 flow
[2024-06-14 15:20:10,280 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 390 flow, removed 2 selfloop flow, removed 2 redundant places.
[2024-06-14 15:20:10,281 INFO  L231             Difference]: Finished difference. Result has 52 places, 51 transitions, 239 flow
[2024-06-14 15:20:10,281 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=52, PETRI_TRANSITIONS=51}
[2024-06-14 15:20:10,281 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places.
[2024-06-14 15:20:10,282 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 239 flow
[2024-06-14 15:20:10,282 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:10,282 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:10,282 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:10,282 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-06-14 15:20:10,282 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-14 15:20:10,283 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:10,283 INFO  L85        PathProgramCache]: Analyzing trace with hash -1462397869, now seen corresponding path program 1 times
[2024-06-14 15:20:10,283 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:10,283 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108019138]
[2024-06-14 15:20:10,283 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:10,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:10,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:15,766 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-14 15:20:15,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:15,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108019138]
[2024-06-14 15:20:15,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108019138] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:15,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:15,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:20:15,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364169370]
[2024-06-14 15:20:15,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:15,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:20:15,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:15,773 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:20:15,774 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:20:15,905 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 15:20:15,906 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 239 flow. Second operand  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:15,906 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:15,906 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 15:20:15,906 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:17,098 INFO  L124   PetriNetUnfolderBase]: 1921/2931 cut-off events.
[2024-06-14 15:20:17,098 INFO  L125   PetriNetUnfolderBase]: For 3454/3456 co-relation queries the response was YES.
[2024-06-14 15:20:17,101 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8496 conditions, 2931 events. 1921/2931 cut-off events. For 3454/3456 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14022 event pairs, 784 based on Foata normal form. 7/2905 useless extension candidates. Maximal degree in co-relation 8476. Up to 2733 conditions per place. 
[2024-06-14 15:20:17,110 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 63 selfloop transitions, 20 changer transitions 0/87 dead transitions.
[2024-06-14 15:20:17,111 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 531 flow
[2024-06-14 15:20:17,111 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:20:17,111 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:20:17,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions.
[2024-06-14 15:20:17,112 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5503875968992248
[2024-06-14 15:20:17,112 INFO  L175             Difference]: Start difference. First operand has 52 places, 51 transitions, 239 flow. Second operand 6 states and 142 transitions.
[2024-06-14 15:20:17,112 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 531 flow
[2024-06-14 15:20:17,114 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 523 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-06-14 15:20:17,115 INFO  L231             Difference]: Finished difference. Result has 58 places, 55 transitions, 312 flow
[2024-06-14 15:20:17,116 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=58, PETRI_TRANSITIONS=55}
[2024-06-14 15:20:17,116 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places.
[2024-06-14 15:20:17,116 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 312 flow
[2024-06-14 15:20:17,117 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:17,117 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:17,117 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:17,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-06-14 15:20:17,117 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-14 15:20:17,117 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:17,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 1910307799, now seen corresponding path program 1 times
[2024-06-14 15:20:17,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:17,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835527490]
[2024-06-14 15:20:17,118 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:17,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:17,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:22,118 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-14 15:20:22,118 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:22,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835527490]
[2024-06-14 15:20:22,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835527490] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:22,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:22,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:20:22,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480514988]
[2024-06-14 15:20:22,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:22,120 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:20:22,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:22,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:20:22,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:20:22,313 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 15:20:22,314 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 312 flow. Second operand  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:22,314 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:22,314 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 15:20:22,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:23,582 INFO  L124   PetriNetUnfolderBase]: 1933/2951 cut-off events.
[2024-06-14 15:20:23,582 INFO  L125   PetriNetUnfolderBase]: For 5433/5435 co-relation queries the response was YES.
[2024-06-14 15:20:23,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9457 conditions, 2951 events. 1933/2951 cut-off events. For 5433/5435 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 14112 event pairs, 596 based on Foata normal form. 12/2930 useless extension candidates. Maximal degree in co-relation 9434. Up to 2701 conditions per place. 
[2024-06-14 15:20:23,595 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 67 selfloop transitions, 23 changer transitions 0/94 dead transitions.
[2024-06-14 15:20:23,596 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 632 flow
[2024-06-14 15:20:23,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:20:23,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:20:23,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions.
[2024-06-14 15:20:23,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5282392026578073
[2024-06-14 15:20:23,597 INFO  L175             Difference]: Start difference. First operand has 58 places, 55 transitions, 312 flow. Second operand 7 states and 159 transitions.
[2024-06-14 15:20:23,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 632 flow
[2024-06-14 15:20:23,600 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 583 flow, removed 7 selfloop flow, removed 4 redundant places.
[2024-06-14 15:20:23,601 INFO  L231             Difference]: Finished difference. Result has 60 places, 57 transitions, 339 flow
[2024-06-14 15:20:23,601 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=57}
[2024-06-14 15:20:23,602 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places.
[2024-06-14 15:20:23,602 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 339 flow
[2024-06-14 15:20:23,602 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:23,602 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:23,602 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:23,602 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-06-14 15:20:23,602 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-14 15:20:23,603 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:23,603 INFO  L85        PathProgramCache]: Analyzing trace with hash 1014615233, now seen corresponding path program 1 times
[2024-06-14 15:20:23,603 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:23,603 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833608451]
[2024-06-14 15:20:23,603 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:23,603 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:23,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:34,075 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-14 15:20:34,075 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:34,075 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833608451]
[2024-06-14 15:20:34,075 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833608451] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:34,076 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:34,076 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:20:34,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391030707]
[2024-06-14 15:20:34,076 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:34,076 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:20:34,077 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:34,077 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:20:34,077 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:20:34,202 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:20:34,203 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 339 flow. Second operand  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:34,203 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:34,203 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:20:34,203 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:35,372 INFO  L124   PetriNetUnfolderBase]: 1928/2940 cut-off events.
[2024-06-14 15:20:35,372 INFO  L125   PetriNetUnfolderBase]: For 7382/7382 co-relation queries the response was YES.
[2024-06-14 15:20:35,376 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10051 conditions, 2940 events. 1928/2940 cut-off events. For 7382/7382 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 14018 event pairs, 776 based on Foata normal form. 2/2906 useless extension candidates. Maximal degree in co-relation 10027. Up to 2844 conditions per place. 
[2024-06-14 15:20:35,386 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 56 selfloop transitions, 8 changer transitions 0/68 dead transitions.
[2024-06-14 15:20:35,386 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 68 transitions, 495 flow
[2024-06-14 15:20:35,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:20:35,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:20:35,387 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions.
[2024-06-14 15:20:35,387 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4325581395348837
[2024-06-14 15:20:35,387 INFO  L175             Difference]: Start difference. First operand has 60 places, 57 transitions, 339 flow. Second operand 5 states and 93 transitions.
[2024-06-14 15:20:35,387 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 68 transitions, 495 flow
[2024-06-14 15:20:35,391 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 431 flow, removed 11 selfloop flow, removed 5 redundant places.
[2024-06-14 15:20:35,392 INFO  L231             Difference]: Finished difference. Result has 60 places, 57 transitions, 299 flow
[2024-06-14 15:20:35,392 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=60, PETRI_TRANSITIONS=57}
[2024-06-14 15:20:35,392 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places.
[2024-06-14 15:20:35,393 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 299 flow
[2024-06-14 15:20:35,393 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:35,393 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:35,393 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:35,393 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-06-14 15:20:35,393 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-14 15:20:35,394 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:35,394 INFO  L85        PathProgramCache]: Analyzing trace with hash 1379970497, now seen corresponding path program 1 times
[2024-06-14 15:20:35,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:35,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622307765]
[2024-06-14 15:20:35,394 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:35,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:35,421 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:46,960 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-14 15:20:46,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:46,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622307765]
[2024-06-14 15:20:46,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622307765] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:46,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:46,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:20:46,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930180313]
[2024-06-14 15:20:46,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:46,961 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:20:46,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:46,962 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:20:46,962 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:20:47,141 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:20:47,141 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 299 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:47,142 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:47,142 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:20:47,142 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:48,316 INFO  L124   PetriNetUnfolderBase]: 1932/2970 cut-off events.
[2024-06-14 15:20:48,316 INFO  L125   PetriNetUnfolderBase]: For 8815/8815 co-relation queries the response was YES.
[2024-06-14 15:20:48,320 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10113 conditions, 2970 events. 1932/2970 cut-off events. For 8815/8815 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14275 event pairs, 727 based on Foata normal form. 6/2974 useless extension candidates. Maximal degree in co-relation 10087. Up to 2802 conditions per place. 
[2024-06-14 15:20:48,328 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 66 selfloop transitions, 17 changer transitions 0/87 dead transitions.
[2024-06-14 15:20:48,328 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 87 transitions, 595 flow
[2024-06-14 15:20:48,328 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:20:48,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:20:48,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions.
[2024-06-14 15:20:48,330 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45348837209302323
[2024-06-14 15:20:48,330 INFO  L175             Difference]: Start difference. First operand has 60 places, 57 transitions, 299 flow. Second operand 6 states and 117 transitions.
[2024-06-14 15:20:48,330 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 87 transitions, 595 flow
[2024-06-14 15:20:48,334 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 573 flow, removed 2 selfloop flow, removed 4 redundant places.
[2024-06-14 15:20:48,335 INFO  L231             Difference]: Finished difference. Result has 64 places, 68 transitions, 408 flow
[2024-06-14 15:20:48,335 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=64, PETRI_TRANSITIONS=68}
[2024-06-14 15:20:48,336 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 20 predicate places.
[2024-06-14 15:20:48,336 INFO  L495      AbstractCegarLoop]: Abstraction has has 64 places, 68 transitions, 408 flow
[2024-06-14 15:20:48,336 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:48,336 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:48,337 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:48,337 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-06-14 15:20:48,337 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-14 15:20:48,337 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:48,337 INFO  L85        PathProgramCache]: Analyzing trace with hash -176308162, now seen corresponding path program 1 times
[2024-06-14 15:20:48,337 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:48,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278720797]
[2024-06-14 15:20:48,338 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:48,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:48,380 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:20:56,698 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-14 15:20:56,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:20:56,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278720797]
[2024-06-14 15:20:56,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278720797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:20:56,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:20:56,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:20:56,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414299985]
[2024-06-14 15:20:56,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:20:56,699 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:20:56,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:20:56,700 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:20:56,700 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:20:56,864 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:20:56,865 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 68 transitions, 408 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:56,865 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:20:56,865 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:20:56,865 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:20:57,867 INFO  L124   PetriNetUnfolderBase]: 1938/2989 cut-off events.
[2024-06-14 15:20:57,868 INFO  L125   PetriNetUnfolderBase]: For 12342/12346 co-relation queries the response was YES.
[2024-06-14 15:20:57,872 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11225 conditions, 2989 events. 1938/2989 cut-off events. For 12342/12346 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14389 event pairs, 750 based on Foata normal form. 8/2994 useless extension candidates. Maximal degree in co-relation 11197. Up to 2784 conditions per place. 
[2024-06-14 15:20:57,882 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 68 selfloop transitions, 19 changer transitions 0/91 dead transitions.
[2024-06-14 15:20:57,882 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 682 flow
[2024-06-14 15:20:57,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:20:57,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:20:57,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions.
[2024-06-14 15:20:57,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4573643410852713
[2024-06-14 15:20:57,886 INFO  L175             Difference]: Start difference. First operand has 64 places, 68 transitions, 408 flow. Second operand 6 states and 118 transitions.
[2024-06-14 15:20:57,886 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 682 flow
[2024-06-14 15:20:57,893 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 91 transitions, 664 flow, removed 8 selfloop flow, removed 1 redundant places.
[2024-06-14 15:20:57,894 INFO  L231             Difference]: Finished difference. Result has 69 places, 71 transitions, 462 flow
[2024-06-14 15:20:57,894 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=462, PETRI_PLACES=69, PETRI_TRANSITIONS=71}
[2024-06-14 15:20:57,895 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places.
[2024-06-14 15:20:57,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 71 transitions, 462 flow
[2024-06-14 15:20:57,895 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:20:57,895 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:20:57,895 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:20:57,895 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-06-14 15:20:57,895 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-14 15:20:57,896 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:20:57,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 87693728, now seen corresponding path program 2 times
[2024-06-14 15:20:57,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:20:57,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951502296]
[2024-06-14 15:20:57,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:20:57,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:20:57,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:21:06,012 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-14 15:21:06,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:21:06,012 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951502296]
[2024-06-14 15:21:06,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951502296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:21:06,012 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:21:06,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:21:06,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063488727]
[2024-06-14 15:21:06,013 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:21:06,013 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:21:06,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:21:06,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:21:06,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:21:06,134 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:21:06,134 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 71 transitions, 462 flow. Second operand  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:21:06,135 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:21:06,135 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:21:06,135 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:21:07,233 INFO  L124   PetriNetUnfolderBase]: 1923/2963 cut-off events.
[2024-06-14 15:21:07,234 INFO  L125   PetriNetUnfolderBase]: For 13824/13824 co-relation queries the response was YES.
[2024-06-14 15:21:07,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11344 conditions, 2963 events. 1923/2963 cut-off events. For 13824/13824 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 14196 event pairs, 746 based on Foata normal form. 2/2962 useless extension candidates. Maximal degree in co-relation 11313. Up to 2825 conditions per place. 
[2024-06-14 15:21:07,248 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 71 selfloop transitions, 11 changer transitions 0/86 dead transitions.
[2024-06-14 15:21:07,248 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 86 transitions, 664 flow
[2024-06-14 15:21:07,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:21:07,249 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:21:07,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-14 15:21:07,249 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42248062015503873
[2024-06-14 15:21:07,249 INFO  L175             Difference]: Start difference. First operand has 69 places, 71 transitions, 462 flow. Second operand 6 states and 109 transitions.
[2024-06-14 15:21:07,250 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 86 transitions, 664 flow
[2024-06-14 15:21:07,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 635 flow, removed 4 selfloop flow, removed 3 redundant places.
[2024-06-14 15:21:07,259 INFO  L231             Difference]: Finished difference. Result has 72 places, 71 transitions, 463 flow
[2024-06-14 15:21:07,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=72, PETRI_TRANSITIONS=71}
[2024-06-14 15:21:07,260 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places.
[2024-06-14 15:21:07,260 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 71 transitions, 463 flow
[2024-06-14 15:21:07,260 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:21:07,260 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:21:07,260 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:21:07,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-06-14 15:21:07,261 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-14 15:21:07,261 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:21:07,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170584510, now seen corresponding path program 1 times
[2024-06-14 15:21:07,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:21:07,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478595541]
[2024-06-14 15:21:07,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:21:07,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:21:07,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:21:16,017 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-14 15:21:16,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:21:16,017 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478595541]
[2024-06-14 15:21:16,017 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478595541] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:21:16,017 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:21:16,017 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:21:16,017 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581576468]
[2024-06-14 15:21:16,017 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:21:16,018 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:21:16,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:21:16,018 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:21:16,018 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:21:16,186 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:21:16,187 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 71 transitions, 463 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-14 15:21:16,187 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:21:16,187 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:21:16,187 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:21:17,332 INFO  L124   PetriNetUnfolderBase]: 2091/3195 cut-off events.
[2024-06-14 15:21:17,332 INFO  L125   PetriNetUnfolderBase]: For 17186/17190 co-relation queries the response was YES.
[2024-06-14 15:21:17,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12469 conditions, 3195 events. 2091/3195 cut-off events. For 17186/17190 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 15314 event pairs, 649 based on Foata normal form. 13/3206 useless extension candidates. Maximal degree in co-relation 12437. Up to 2721 conditions per place. 
[2024-06-14 15:21:17,345 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 88 selfloop transitions, 31 changer transitions 0/123 dead transitions.
[2024-06-14 15:21:17,345 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 123 transitions, 991 flow
[2024-06-14 15:21:17,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:21:17,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:21:17,347 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions.
[2024-06-14 15:21:17,347 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-14 15:21:17,347 INFO  L175             Difference]: Start difference. First operand has 72 places, 71 transitions, 463 flow. Second operand 7 states and 147 transitions.
[2024-06-14 15:21:17,347 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 123 transitions, 991 flow
[2024-06-14 15:21:17,355 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 123 transitions, 944 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 15:21:17,357 INFO  L231             Difference]: Finished difference. Result has 76 places, 90 transitions, 664 flow
[2024-06-14 15:21:17,358 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=76, PETRI_TRANSITIONS=90}
[2024-06-14 15:21:17,360 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places.
[2024-06-14 15:21:17,361 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 664 flow
[2024-06-14 15:21:17,361 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-14 15:21:17,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:21:17,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:21:17,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-06-14 15:21:17,362 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-14 15:21:17,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:21:17,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -1576460512, now seen corresponding path program 2 times
[2024-06-14 15:21:17,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:21:17,363 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562521355]
[2024-06-14 15:21:17,363 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:21:17,363 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:21:17,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:21:26,294 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-14 15:21:26,294 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:21:26,294 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562521355]
[2024-06-14 15:21:26,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562521355] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:21:26,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:21:26,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:21:26,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259336808]
[2024-06-14 15:21:26,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:21:26,295 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:21:26,295 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:21:26,296 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:21:26,296 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:21:26,461 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:21:26,461 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 664 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-14 15:21:26,461 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:21:26,461 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:21:26,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:21:27,731 INFO  L124   PetriNetUnfolderBase]: 2127/3250 cut-off events.
[2024-06-14 15:21:27,731 INFO  L125   PetriNetUnfolderBase]: For 22973/22973 co-relation queries the response was YES.
[2024-06-14 15:21:27,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14613 conditions, 3250 events. 2127/3250 cut-off events. For 22973/22973 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15566 event pairs, 695 based on Foata normal form. 6/3254 useless extension candidates. Maximal degree in co-relation 14577. Up to 3007 conditions per place. 
[2024-06-14 15:21:27,748 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 98 selfloop transitions, 23 changer transitions 0/125 dead transitions.
[2024-06-14 15:21:27,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 125 transitions, 1148 flow
[2024-06-14 15:21:27,748 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:21:27,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:21:27,749 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 15:21:27,749 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45514950166112955
[2024-06-14 15:21:27,749 INFO  L175             Difference]: Start difference. First operand has 76 places, 90 transitions, 664 flow. Second operand 7 states and 137 transitions.
[2024-06-14 15:21:27,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 125 transitions, 1148 flow
[2024-06-14 15:21:27,765 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 1104 flow, removed 21 selfloop flow, removed 1 redundant places.
[2024-06-14 15:21:27,766 INFO  L231             Difference]: Finished difference. Result has 83 places, 98 transitions, 772 flow
[2024-06-14 15:21:27,767 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=772, PETRI_PLACES=83, PETRI_TRANSITIONS=98}
[2024-06-14 15:21:27,767 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places.
[2024-06-14 15:21:27,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 772 flow
[2024-06-14 15:21:27,768 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-14 15:21:27,768 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:21:27,768 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:21:27,768 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-06-14 15:21:27,768 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-14 15:21:27,768 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:21:27,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -993215840, now seen corresponding path program 3 times
[2024-06-14 15:21:27,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:21:27,769 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028213802]
[2024-06-14 15:21:27,769 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:21:27,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:21:27,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:21:36,812 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-14 15:21:36,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:21:36,813 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028213802]
[2024-06-14 15:21:36,813 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028213802] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:21:36,813 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:21:36,813 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:21:36,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949027047]
[2024-06-14 15:21:36,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:21:36,813 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:21:36,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:21:36,814 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:21:36,814 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:21:36,948 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:21:36,948 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 772 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-14 15:21:36,948 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:21:36,949 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:21:36,949 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:21:38,343 INFO  L124   PetriNetUnfolderBase]: 2131/3256 cut-off events.
[2024-06-14 15:21:38,343 INFO  L125   PetriNetUnfolderBase]: For 27428/27428 co-relation queries the response was YES.
[2024-06-14 15:21:38,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15261 conditions, 3256 events. 2131/3256 cut-off events. For 27428/27428 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15582 event pairs, 689 based on Foata normal form. 6/3260 useless extension candidates. Maximal degree in co-relation 15221. Up to 3076 conditions per place. 
[2024-06-14 15:21:38,358 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 101 selfloop transitions, 21 changer transitions 0/126 dead transitions.
[2024-06-14 15:21:38,358 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 1176 flow
[2024-06-14 15:21:38,358 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:21:38,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:21:38,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions.
[2024-06-14 15:21:38,359 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 15:21:38,359 INFO  L175             Difference]: Start difference. First operand has 83 places, 98 transitions, 772 flow. Second operand 7 states and 133 transitions.
[2024-06-14 15:21:38,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 1176 flow
[2024-06-14 15:21:38,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 126 transitions, 1127 flow, removed 15 selfloop flow, removed 3 redundant places.
[2024-06-14 15:21:38,376 INFO  L231             Difference]: Finished difference. Result has 88 places, 104 transitions, 850 flow
[2024-06-14 15:21:38,376 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=850, PETRI_PLACES=88, PETRI_TRANSITIONS=104}
[2024-06-14 15:21:38,377 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places.
[2024-06-14 15:21:38,377 INFO  L495      AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 850 flow
[2024-06-14 15:21:38,377 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-14 15:21:38,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:21:38,377 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:21:38,378 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-06-14 15:21:38,378 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-14 15:21:38,378 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:21:38,378 INFO  L85        PathProgramCache]: Analyzing trace with hash -993206912, now seen corresponding path program 1 times
[2024-06-14 15:21:38,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:21:38,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247008849]
[2024-06-14 15:21:38,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:21:38,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:21:38,408 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:21:50,368 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-14 15:21:50,368 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:21:50,368 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247008849]
[2024-06-14 15:21:50,368 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247008849] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:21:50,368 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:21:50,368 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:21:50,368 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086342538]
[2024-06-14 15:21:50,368 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:21:50,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:21:50,369 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:21:50,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:21:50,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:21:50,573 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:21:50,574 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 850 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:21:50,574 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:21:50,574 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:21:50,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:21:51,940 INFO  L124   PetriNetUnfolderBase]: 2134/3260 cut-off events.
[2024-06-14 15:21:51,940 INFO  L125   PetriNetUnfolderBase]: For 30079/30079 co-relation queries the response was YES.
[2024-06-14 15:21:51,949 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15631 conditions, 3260 events. 2134/3260 cut-off events. For 30079/30079 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15608 event pairs, 668 based on Foata normal form. 6/3264 useless extension candidates. Maximal degree in co-relation 15589. Up to 3061 conditions per place. 
[2024-06-14 15:21:51,959 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 100 selfloop transitions, 25 changer transitions 0/129 dead transitions.
[2024-06-14 15:21:51,959 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 129 transitions, 1234 flow
[2024-06-14 15:21:51,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:21:51,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:21:51,960 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-14 15:21:51,960 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44518272425249167
[2024-06-14 15:21:51,961 INFO  L175             Difference]: Start difference. First operand has 88 places, 104 transitions, 850 flow. Second operand 7 states and 134 transitions.
[2024-06-14 15:21:51,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 129 transitions, 1234 flow
[2024-06-14 15:21:51,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 1181 flow, removed 11 selfloop flow, removed 4 redundant places.
[2024-06-14 15:21:51,981 INFO  L231             Difference]: Finished difference. Result has 91 places, 107 transitions, 893 flow
[2024-06-14 15:21:51,982 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=893, PETRI_PLACES=91, PETRI_TRANSITIONS=107}
[2024-06-14 15:21:51,982 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places.
[2024-06-14 15:21:51,982 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 893 flow
[2024-06-14 15:21:51,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:21:51,983 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:21:51,983 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:21:51,983 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-06-14 15:21:51,983 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-14 15:21:51,983 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:21:51,984 INFO  L85        PathProgramCache]: Analyzing trace with hash -1695884517, now seen corresponding path program 1 times
[2024-06-14 15:21:51,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:21:51,984 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015856818]
[2024-06-14 15:21:51,984 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:21:51,984 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:21:52,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:22:05,113 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-14 15:22:05,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:22:05,113 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015856818]
[2024-06-14 15:22:05,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015856818] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:22:05,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:22:05,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-06-14 15:22:05,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911738570]
[2024-06-14 15:22:05,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:22:05,114 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-06-14 15:22:05,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:22:05,114 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-06-14 15:22:05,114 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2024-06-14 15:22:05,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:22:05,188 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 893 flow. Second operand  has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:05,188 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:22:05,188 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:22:05,188 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:22:06,477 INFO  L124   PetriNetUnfolderBase]: 2131/3256 cut-off events.
[2024-06-14 15:22:06,477 INFO  L125   PetriNetUnfolderBase]: For 32999/32999 co-relation queries the response was YES.
[2024-06-14 15:22:06,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16076 conditions, 3256 events. 2131/3256 cut-off events. For 32999/32999 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15610 event pairs, 692 based on Foata normal form. 1/3255 useless extension candidates. Maximal degree in co-relation 16033. Up to 3137 conditions per place. 
[2024-06-14 15:22:06,494 INFO  L140   encePairwiseOnDemand]: 36/43 looper letters, 103 selfloop transitions, 8 changer transitions 0/115 dead transitions.
[2024-06-14 15:22:06,494 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 115 transitions, 1135 flow
[2024-06-14 15:22:06,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-06-14 15:22:06,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-06-14 15:22:06,495 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions.
[2024-06-14 15:22:06,495 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.413953488372093
[2024-06-14 15:22:06,495 INFO  L175             Difference]: Start difference. First operand has 91 places, 107 transitions, 893 flow. Second operand 5 states and 89 transitions.
[2024-06-14 15:22:06,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 115 transitions, 1135 flow
[2024-06-14 15:22:06,513 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 115 transitions, 1055 flow, removed 17 selfloop flow, removed 5 redundant places.
[2024-06-14 15:22:06,515 INFO  L231             Difference]: Finished difference. Result has 91 places, 107 transitions, 835 flow
[2024-06-14 15:22:06,515 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=835, PETRI_PLACES=91, PETRI_TRANSITIONS=107}
[2024-06-14 15:22:06,515 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places.
[2024-06-14 15:22:06,516 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 107 transitions, 835 flow
[2024-06-14 15:22:06,516 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:06,516 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:22:06,516 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:22:06,516 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-06-14 15:22:06,516 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-14 15:22:06,517 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:22:06,517 INFO  L85        PathProgramCache]: Analyzing trace with hash -1932195427, now seen corresponding path program 1 times
[2024-06-14 15:22:06,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:22:06,517 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104902102]
[2024-06-14 15:22:06,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:22:06,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:22:06,562 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:22:16,383 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-14 15:22:16,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:22:16,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104902102]
[2024-06-14 15:22:16,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104902102] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:22:16,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:22:16,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:22:16,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661086343]
[2024-06-14 15:22:16,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:22:16,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:22:16,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:22:16,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:22:16,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:22:16,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:22:16,520 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 107 transitions, 835 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:16,520 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:22:16,520 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:22:16,520 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:22:17,847 INFO  L124   PetriNetUnfolderBase]: 2142/3273 cut-off events.
[2024-06-14 15:22:17,848 INFO  L125   PetriNetUnfolderBase]: For 36345/36351 co-relation queries the response was YES.
[2024-06-14 15:22:17,853 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16247 conditions, 3273 events. 2142/3273 cut-off events. For 36345/36351 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15692 event pairs, 675 based on Foata normal form. 8/3279 useless extension candidates. Maximal degree in co-relation 16203. Up to 3032 conditions per place. 
[2024-06-14 15:22:17,861 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 110 selfloop transitions, 26 changer transitions 0/140 dead transitions.
[2024-06-14 15:22:17,861 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 140 transitions, 1309 flow
[2024-06-14 15:22:17,861 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:22:17,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:22:17,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions.
[2024-06-14 15:22:17,863 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45514950166112955
[2024-06-14 15:22:17,863 INFO  L175             Difference]: Start difference. First operand has 91 places, 107 transitions, 835 flow. Second operand 7 states and 137 transitions.
[2024-06-14 15:22:17,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 140 transitions, 1309 flow
[2024-06-14 15:22:17,881 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 140 transitions, 1285 flow, removed 3 selfloop flow, removed 4 redundant places.
[2024-06-14 15:22:17,882 INFO  L231             Difference]: Finished difference. Result has 94 places, 113 transitions, 957 flow
[2024-06-14 15:22:17,882 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=957, PETRI_PLACES=94, PETRI_TRANSITIONS=113}
[2024-06-14 15:22:17,883 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places.
[2024-06-14 15:22:17,883 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 113 transitions, 957 flow
[2024-06-14 15:22:17,883 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:17,883 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:22:17,883 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:22:17,883 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-06-14 15:22:17,883 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-14 15:22:17,884 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:22:17,884 INFO  L85        PathProgramCache]: Analyzing trace with hash -1932105217, now seen corresponding path program 2 times
[2024-06-14 15:22:17,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:22:17,884 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434974344]
[2024-06-14 15:22:17,884 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:22:17,884 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:22:17,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:22:28,709 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-14 15:22:28,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:22:28,709 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434974344]
[2024-06-14 15:22:28,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434974344] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:22:28,709 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:22:28,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:22:28,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842562390]
[2024-06-14 15:22:28,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:22:28,710 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:22:28,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:22:28,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:22:28,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:22:28,828 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:22:28,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 113 transitions, 957 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:28,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:22:28,829 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:22:28,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:22:30,097 INFO  L124   PetriNetUnfolderBase]: 2137/3266 cut-off events.
[2024-06-14 15:22:30,098 INFO  L125   PetriNetUnfolderBase]: For 41193/41199 co-relation queries the response was YES.
[2024-06-14 15:22:30,104 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16877 conditions, 3266 events. 2137/3266 cut-off events. For 41193/41199 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 15658 event pairs, 675 based on Foata normal form. 8/3272 useless extension candidates. Maximal degree in co-relation 16833. Up to 3060 conditions per place. 
[2024-06-14 15:22:30,114 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 109 selfloop transitions, 22 changer transitions 0/135 dead transitions.
[2024-06-14 15:22:30,114 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 135 transitions, 1275 flow
[2024-06-14 15:22:30,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:22:30,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:22:30,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions.
[2024-06-14 15:22:30,115 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43853820598006643
[2024-06-14 15:22:30,115 INFO  L175             Difference]: Start difference. First operand has 94 places, 113 transitions, 957 flow. Second operand 7 states and 132 transitions.
[2024-06-14 15:22:30,115 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 135 transitions, 1275 flow
[2024-06-14 15:22:30,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 135 transitions, 1194 flow, removed 31 selfloop flow, removed 3 redundant places.
[2024-06-14 15:22:30,146 INFO  L231             Difference]: Finished difference. Result has 98 places, 113 transitions, 928 flow
[2024-06-14 15:22:30,147 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=928, PETRI_PLACES=98, PETRI_TRANSITIONS=113}
[2024-06-14 15:22:30,147 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places.
[2024-06-14 15:22:30,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 113 transitions, 928 flow
[2024-06-14 15:22:30,148 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:30,148 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:22:30,148 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:22:30,148 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-06-14 15:22:30,148 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-14 15:22:30,148 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:22:30,149 INFO  L85        PathProgramCache]: Analyzing trace with hash -1928385992, now seen corresponding path program 1 times
[2024-06-14 15:22:30,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:22:30,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270871525]
[2024-06-14 15:22:30,149 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:22:30,149 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:22:30,199 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:22:39,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:22:39,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:22:39,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270871525]
[2024-06-14 15:22:39,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270871525] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:22:39,330 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:22:39,330 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:22:39,330 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432721520]
[2024-06-14 15:22:39,330 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:22:39,331 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:22:39,331 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:22:39,331 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:22:39,331 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:22:39,503 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:22:39,504 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 113 transitions, 928 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:39,504 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:22:39,504 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:22:39,504 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:22:40,800 INFO  L124   PetriNetUnfolderBase]: 2173/3312 cut-off events.
[2024-06-14 15:22:40,800 INFO  L125   PetriNetUnfolderBase]: For 45843/45849 co-relation queries the response was YES.
[2024-06-14 15:22:40,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17390 conditions, 3312 events. 2173/3312 cut-off events. For 45843/45849 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15829 event pairs, 636 based on Foata normal form. 8/3318 useless extension candidates. Maximal degree in co-relation 17344. Up to 2785 conditions per place. 
[2024-06-14 15:22:40,818 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 103 selfloop transitions, 47 changer transitions 0/154 dead transitions.
[2024-06-14 15:22:40,818 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 154 transitions, 1558 flow
[2024-06-14 15:22:40,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:22:40,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:22:40,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions.
[2024-06-14 15:22:40,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4950166112956811
[2024-06-14 15:22:40,819 INFO  L175             Difference]: Start difference. First operand has 98 places, 113 transitions, 928 flow. Second operand 7 states and 149 transitions.
[2024-06-14 15:22:40,819 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 154 transitions, 1558 flow
[2024-06-14 15:22:40,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 154 transitions, 1503 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 15:22:40,850 INFO  L231             Difference]: Finished difference. Result has 101 places, 121 transitions, 1129 flow
[2024-06-14 15:22:40,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1129, PETRI_PLACES=101, PETRI_TRANSITIONS=121}
[2024-06-14 15:22:40,851 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places.
[2024-06-14 15:22:40,851 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 121 transitions, 1129 flow
[2024-06-14 15:22:40,851 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:40,851 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:22:40,851 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:22:40,851 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-06-14 15:22:40,851 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-14 15:22:40,852 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:22:40,852 INFO  L85        PathProgramCache]: Analyzing trace with hash 752876506, now seen corresponding path program 2 times
[2024-06-14 15:22:40,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:22:40,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112368722]
[2024-06-14 15:22:40,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:22:40,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:22:40,889 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:22:49,951 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-14 15:22:49,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:22:49,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112368722]
[2024-06-14 15:22:49,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112368722] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:22:49,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:22:49,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:22:49,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881724841]
[2024-06-14 15:22:49,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:22:49,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:22:49,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:22:49,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:22:49,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:22:50,123 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:22:50,124 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 121 transitions, 1129 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:50,124 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:22:50,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:22:50,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:22:51,337 INFO  L124   PetriNetUnfolderBase]: 2209/3364 cut-off events.
[2024-06-14 15:22:51,337 INFO  L125   PetriNetUnfolderBase]: For 53315/53321 co-relation queries the response was YES.
[2024-06-14 15:22:51,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18849 conditions, 3364 events. 2209/3364 cut-off events. For 53315/53321 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16094 event pairs, 634 based on Foata normal form. 8/3370 useless extension candidates. Maximal degree in co-relation 18800. Up to 2815 conditions per place. 
[2024-06-14 15:22:51,355 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 102 selfloop transitions, 48 changer transitions 0/154 dead transitions.
[2024-06-14 15:22:51,356 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 154 transitions, 1685 flow
[2024-06-14 15:22:51,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:22:51,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:22:51,357 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-14 15:22:51,357 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47840531561461797
[2024-06-14 15:22:51,357 INFO  L175             Difference]: Start difference. First operand has 101 places, 121 transitions, 1129 flow. Second operand 7 states and 144 transitions.
[2024-06-14 15:22:51,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 154 transitions, 1685 flow
[2024-06-14 15:22:51,395 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 154 transitions, 1598 flow, removed 22 selfloop flow, removed 3 redundant places.
[2024-06-14 15:22:51,397 INFO  L231             Difference]: Finished difference. Result has 105 places, 125 transitions, 1206 flow
[2024-06-14 15:22:51,397 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1206, PETRI_PLACES=105, PETRI_TRANSITIONS=125}
[2024-06-14 15:22:51,397 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places.
[2024-06-14 15:22:51,397 INFO  L495      AbstractCegarLoop]: Abstraction has has 105 places, 125 transitions, 1206 flow
[2024-06-14 15:22:51,398 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:22:51,398 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:22:51,398 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:22:51,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-06-14 15:22:51,398 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-14 15:22:51,398 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:22:51,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1618282936, now seen corresponding path program 3 times
[2024-06-14 15:22:51,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:22:51,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127161764]
[2024-06-14 15:22:51,399 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:22:51,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:22:51,436 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:23:00,153 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-14 15:23:00,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:23:00,153 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127161764]
[2024-06-14 15:23:00,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127161764] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:23:00,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:23:00,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:23:00,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825251964]
[2024-06-14 15:23:00,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:23:00,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:23:00,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:23:00,155 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:23:00,155 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:23:00,311 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:23:00,311 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 125 transitions, 1206 flow. Second operand  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:00,311 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:23:00,311 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:23:00,311 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:23:01,575 INFO  L124   PetriNetUnfolderBase]: 2213/3377 cut-off events.
[2024-06-14 15:23:01,575 INFO  L125   PetriNetUnfolderBase]: For 57764/57770 co-relation queries the response was YES.
[2024-06-14 15:23:01,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19053 conditions, 3377 events. 2213/3377 cut-off events. For 57764/57770 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 16273 event pairs, 678 based on Foata normal form. 12/3387 useless extension candidates. Maximal degree in co-relation 19003. Up to 3164 conditions per place. 
[2024-06-14 15:23:01,635 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 124 selfloop transitions, 23 changer transitions 0/151 dead transitions.
[2024-06-14 15:23:01,635 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 151 transitions, 1651 flow
[2024-06-14 15:23:01,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:23:01,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:23:01,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-14 15:23:01,637 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44518272425249167
[2024-06-14 15:23:01,637 INFO  L175             Difference]: Start difference. First operand has 105 places, 125 transitions, 1206 flow. Second operand 7 states and 134 transitions.
[2024-06-14 15:23:01,637 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 151 transitions, 1651 flow
[2024-06-14 15:23:01,669 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 151 transitions, 1560 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 15:23:01,671 INFO  L231             Difference]: Finished difference. Result has 108 places, 129 transitions, 1235 flow
[2024-06-14 15:23:01,671 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1235, PETRI_PLACES=108, PETRI_TRANSITIONS=129}
[2024-06-14 15:23:01,672 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 64 predicate places.
[2024-06-14 15:23:01,672 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 129 transitions, 1235 flow
[2024-06-14 15:23:01,672 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:01,672 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:23:01,672 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:23:01,672 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-06-14 15:23:01,672 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-14 15:23:01,673 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:23:01,673 INFO  L85        PathProgramCache]: Analyzing trace with hash -1618015809, now seen corresponding path program 1 times
[2024-06-14 15:23:01,673 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:23:01,673 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387135417]
[2024-06-14 15:23:01,673 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:23:01,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:23:01,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:23:11,183 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-14 15:23:11,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:23:11,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387135417]
[2024-06-14 15:23:11,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387135417] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:23:11,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:23:11,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:23:11,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496136098]
[2024-06-14 15:23:11,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:23:11,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:23:11,184 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:23:11,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:23:11,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:23:11,366 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:23:11,366 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 129 transitions, 1235 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-14 15:23:11,366 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:23:11,366 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:23:11,366 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:23:12,751 INFO  L124   PetriNetUnfolderBase]: 2215/3378 cut-off events.
[2024-06-14 15:23:12,751 INFO  L125   PetriNetUnfolderBase]: For 61709/61709 co-relation queries the response was YES.
[2024-06-14 15:23:12,758 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19163 conditions, 3378 events. 2215/3378 cut-off events. For 61709/61709 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 16236 event pairs, 665 based on Foata normal form. 3/3379 useless extension candidates. Maximal degree in co-relation 19112. Up to 3168 conditions per place. 
[2024-06-14 15:23:12,768 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 120 selfloop transitions, 30 changer transitions 0/154 dead transitions.
[2024-06-14 15:23:12,768 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 154 transitions, 1683 flow
[2024-06-14 15:23:12,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:23:12,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:23:12,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions.
[2024-06-14 15:23:12,769 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44518272425249167
[2024-06-14 15:23:12,769 INFO  L175             Difference]: Start difference. First operand has 108 places, 129 transitions, 1235 flow. Second operand 7 states and 134 transitions.
[2024-06-14 15:23:12,769 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 154 transitions, 1683 flow
[2024-06-14 15:23:12,808 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 154 transitions, 1614 flow, removed 14 selfloop flow, removed 5 redundant places.
[2024-06-14 15:23:12,810 INFO  L231             Difference]: Finished difference. Result has 110 places, 133 transitions, 1304 flow
[2024-06-14 15:23:12,810 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1304, PETRI_PLACES=110, PETRI_TRANSITIONS=133}
[2024-06-14 15:23:12,810 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places.
[2024-06-14 15:23:12,810 INFO  L495      AbstractCegarLoop]: Abstraction has has 110 places, 133 transitions, 1304 flow
[2024-06-14 15:23:12,810 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-14 15:23:12,810 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:23:12,811 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:23:12,811 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-06-14 15:23:12,811 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-14 15:23:12,811 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:23:12,811 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032810593, now seen corresponding path program 1 times
[2024-06-14 15:23:12,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:23:12,812 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662214683]
[2024-06-14 15:23:12,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:23:12,812 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:23:12,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:23:27,839 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-14 15:23:27,839 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:23:27,839 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662214683]
[2024-06-14 15:23:27,839 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662214683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:23:27,839 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:23:27,839 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:23:27,839 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285406331]
[2024-06-14 15:23:27,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:23:27,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:23:27,841 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:23:27,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:23:27,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:23:27,931 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-14 15:23:27,931 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 133 transitions, 1304 flow. Second operand  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:27,931 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:23:27,931 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-14 15:23:27,931 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:23:29,355 INFO  L124   PetriNetUnfolderBase]: 2464/3631 cut-off events.
[2024-06-14 15:23:29,355 INFO  L125   PetriNetUnfolderBase]: For 75508/75508 co-relation queries the response was YES.
[2024-06-14 15:23:29,364 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21697 conditions, 3631 events. 2464/3631 cut-off events. For 75508/75508 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16689 event pairs, 778 based on Foata normal form. 1/3630 useless extension candidates. Maximal degree in co-relation 21645. Up to 3612 conditions per place. 
[2024-06-14 15:23:29,375 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 131 selfloop transitions, 11 changer transitions 0/145 dead transitions.
[2024-06-14 15:23:29,375 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 145 transitions, 1636 flow
[2024-06-14 15:23:29,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:23:29,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:23:29,376 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions.
[2024-06-14 15:23:29,376 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.375968992248062
[2024-06-14 15:23:29,376 INFO  L175             Difference]: Start difference. First operand has 110 places, 133 transitions, 1304 flow. Second operand 6 states and 97 transitions.
[2024-06-14 15:23:29,376 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 145 transitions, 1636 flow
[2024-06-14 15:23:29,415 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 145 transitions, 1548 flow, removed 19 selfloop flow, removed 5 redundant places.
[2024-06-14 15:23:29,417 INFO  L231             Difference]: Finished difference. Result has 111 places, 136 transitions, 1276 flow
[2024-06-14 15:23:29,417 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1276, PETRI_PLACES=111, PETRI_TRANSITIONS=136}
[2024-06-14 15:23:29,418 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 67 predicate places.
[2024-06-14 15:23:29,418 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 136 transitions, 1276 flow
[2024-06-14 15:23:29,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:29,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:23:29,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:23:29,418 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-06-14 15:23:29,418 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-14 15:23:29,418 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:23:29,419 INFO  L85        PathProgramCache]: Analyzing trace with hash 1139518059, now seen corresponding path program 1 times
[2024-06-14 15:23:29,419 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:23:29,419 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667452828]
[2024-06-14 15:23:29,419 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:23:29,419 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:23:29,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:23:39,233 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-14 15:23:39,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:23:39,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667452828]
[2024-06-14 15:23:39,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667452828] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:23:39,234 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:23:39,234 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:23:39,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870139753]
[2024-06-14 15:23:39,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:23:39,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:23:39,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:23:39,235 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:23:39,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:23:39,464 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:23:39,464 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 136 transitions, 1276 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:39,464 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:23:39,464 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:23:39,464 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:23:40,864 INFO  L124   PetriNetUnfolderBase]: 2301/3479 cut-off events.
[2024-06-14 15:23:40,864 INFO  L125   PetriNetUnfolderBase]: For 82461/82467 co-relation queries the response was YES.
[2024-06-14 15:23:40,873 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21484 conditions, 3479 events. 2301/3479 cut-off events. For 82461/82467 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16745 event pairs, 533 based on Foata normal form. 10/3487 useless extension candidates. Maximal degree in co-relation 21431. Up to 3136 conditions per place. 
[2024-06-14 15:23:40,884 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 136 selfloop transitions, 32 changer transitions 0/173 dead transitions.
[2024-06-14 15:23:40,884 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 173 transitions, 1874 flow
[2024-06-14 15:23:40,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:23:40,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:23:40,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-06-14 15:23:40,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4476744186046512
[2024-06-14 15:23:40,885 INFO  L175             Difference]: Start difference. First operand has 111 places, 136 transitions, 1276 flow. Second operand 8 states and 154 transitions.
[2024-06-14 15:23:40,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 173 transitions, 1874 flow
[2024-06-14 15:23:40,935 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 173 transitions, 1836 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 15:23:40,943 INFO  L231             Difference]: Finished difference. Result has 115 places, 140 transitions, 1413 flow
[2024-06-14 15:23:40,944 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1413, PETRI_PLACES=115, PETRI_TRANSITIONS=140}
[2024-06-14 15:23:40,944 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 71 predicate places.
[2024-06-14 15:23:40,944 INFO  L495      AbstractCegarLoop]: Abstraction has has 115 places, 140 transitions, 1413 flow
[2024-06-14 15:23:40,944 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:40,945 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:23:40,945 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:23:40,945 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-06-14 15:23:40,945 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-14 15:23:40,945 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:23:40,946 INFO  L85        PathProgramCache]: Analyzing trace with hash 1139520849, now seen corresponding path program 2 times
[2024-06-14 15:23:40,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:23:40,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067646771]
[2024-06-14 15:23:40,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:23:40,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:23:41,016 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:23:49,623 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-14 15:23:49,623 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:23:49,623 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067646771]
[2024-06-14 15:23:49,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067646771] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:23:49,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:23:49,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:23:49,624 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006183728]
[2024-06-14 15:23:49,624 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:23:49,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:23:49,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:23:49,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:23:49,625 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:23:49,863 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:23:49,863 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 140 transitions, 1413 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:49,863 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:23:49,863 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:23:49,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:23:51,257 INFO  L124   PetriNetUnfolderBase]: 2318/3506 cut-off events.
[2024-06-14 15:23:51,257 INFO  L125   PetriNetUnfolderBase]: For 91072/91078 co-relation queries the response was YES.
[2024-06-14 15:23:51,267 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22292 conditions, 3506 events. 2318/3506 cut-off events. For 91072/91078 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16861 event pairs, 674 based on Foata normal form. 10/3514 useless extension candidates. Maximal degree in co-relation 22238. Up to 3245 conditions per place. 
[2024-06-14 15:23:51,281 INFO  L140   encePairwiseOnDemand]: 33/43 looper letters, 139 selfloop transitions, 28 changer transitions 0/172 dead transitions.
[2024-06-14 15:23:51,281 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 172 transitions, 1877 flow
[2024-06-14 15:23:51,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:23:51,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:23:51,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 15:23:51,284 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-14 15:23:51,284 INFO  L175             Difference]: Start difference. First operand has 115 places, 140 transitions, 1413 flow. Second operand 8 states and 151 transitions.
[2024-06-14 15:23:51,284 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 172 transitions, 1877 flow
[2024-06-14 15:23:51,341 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 172 transitions, 1769 flow, removed 39 selfloop flow, removed 4 redundant places.
[2024-06-14 15:23:51,343 INFO  L231             Difference]: Finished difference. Result has 119 places, 142 transitions, 1426 flow
[2024-06-14 15:23:51,343 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1321, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1426, PETRI_PLACES=119, PETRI_TRANSITIONS=142}
[2024-06-14 15:23:51,344 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 75 predicate places.
[2024-06-14 15:23:51,344 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 142 transitions, 1426 flow
[2024-06-14 15:23:51,344 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:23:51,344 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:23:51,344 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:23:51,344 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-06-14 15:23:51,344 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-14 15:23:51,344 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:23:51,345 INFO  L85        PathProgramCache]: Analyzing trace with hash 1139520973, now seen corresponding path program 1 times
[2024-06-14 15:23:51,345 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:23:51,345 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657108809]
[2024-06-14 15:23:51,345 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:23:51,345 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:23:51,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:24:02,352 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-14 15:24:02,353 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:24:02,353 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657108809]
[2024-06-14 15:24:02,353 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657108809] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:24:02,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:24:02,353 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:24:02,353 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336209859]
[2024-06-14 15:24:02,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:24:02,354 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:24:02,354 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:24:02,354 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:24:02,354 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:24:02,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:24:02,548 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 142 transitions, 1426 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:02,548 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:24:02,548 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:24:02,548 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:24:04,044 INFO  L124   PetriNetUnfolderBase]: 2385/3598 cut-off events.
[2024-06-14 15:24:04,044 INFO  L125   PetriNetUnfolderBase]: For 99126/99132 co-relation queries the response was YES.
[2024-06-14 15:24:04,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22949 conditions, 3598 events. 2385/3598 cut-off events. For 99126/99132 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17380 event pairs, 548 based on Foata normal form. 8/3604 useless extension candidates. Maximal degree in co-relation 22893. Up to 2744 conditions per place. 
[2024-06-14 15:24:04,071 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 130 selfloop transitions, 65 changer transitions 0/200 dead transitions.
[2024-06-14 15:24:04,072 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 200 transitions, 2456 flow
[2024-06-14 15:24:04,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:24:04,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:24:04,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions.
[2024-06-14 15:24:04,073 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49709302325581395
[2024-06-14 15:24:04,073 INFO  L175             Difference]: Start difference. First operand has 119 places, 142 transitions, 1426 flow. Second operand 8 states and 171 transitions.
[2024-06-14 15:24:04,073 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 200 transitions, 2456 flow
[2024-06-14 15:24:04,131 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 200 transitions, 2373 flow, removed 15 selfloop flow, removed 6 redundant places.
[2024-06-14 15:24:04,133 INFO  L231             Difference]: Finished difference. Result has 124 places, 157 transitions, 1729 flow
[2024-06-14 15:24:04,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1343, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1729, PETRI_PLACES=124, PETRI_TRANSITIONS=157}
[2024-06-14 15:24:04,134 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places.
[2024-06-14 15:24:04,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 157 transitions, 1729 flow
[2024-06-14 15:24:04,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:04,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:24:04,134 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:24:04,135 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-06-14 15:24:04,135 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-14 15:24:04,135 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:24:04,135 INFO  L85        PathProgramCache]: Analyzing trace with hash 1142322133, now seen corresponding path program 2 times
[2024-06-14 15:24:04,135 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:24:04,135 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394971112]
[2024-06-14 15:24:04,135 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:24:04,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:24:04,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:24:15,665 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-14 15:24:15,665 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:24:15,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394971112]
[2024-06-14 15:24:15,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394971112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:24:15,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:24:15,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:24:15,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498339280]
[2024-06-14 15:24:15,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:24:15,666 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:24:15,666 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:24:15,666 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:24:15,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:24:15,794 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43
[2024-06-14 15:24:15,794 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 157 transitions, 1729 flow. Second operand  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:15,794 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:24:15,794 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43
[2024-06-14 15:24:15,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:24:17,322 INFO  L124   PetriNetUnfolderBase]: 2426/3655 cut-off events.
[2024-06-14 15:24:17,322 INFO  L125   PetriNetUnfolderBase]: For 111370/111376 co-relation queries the response was YES.
[2024-06-14 15:24:17,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25011 conditions, 3655 events. 2426/3655 cut-off events. For 111370/111376 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 17677 event pairs, 586 based on Foata normal form. 8/3661 useless extension candidates. Maximal degree in co-relation 24951. Up to 3065 conditions per place. 
[2024-06-14 15:24:17,349 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 136 selfloop transitions, 53 changer transitions 0/194 dead transitions.
[2024-06-14 15:24:17,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 194 transitions, 2408 flow
[2024-06-14 15:24:17,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:24:17,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:24:17,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions.
[2024-06-14 15:24:17,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5
[2024-06-14 15:24:17,350 INFO  L175             Difference]: Start difference. First operand has 124 places, 157 transitions, 1729 flow. Second operand 8 states and 172 transitions.
[2024-06-14 15:24:17,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 194 transitions, 2408 flow
[2024-06-14 15:24:17,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 194 transitions, 2299 flow, removed 46 selfloop flow, removed 2 redundant places.
[2024-06-14 15:24:17,420 INFO  L231             Difference]: Finished difference. Result has 130 places, 161 transitions, 1812 flow
[2024-06-14 15:24:17,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1812, PETRI_PLACES=130, PETRI_TRANSITIONS=161}
[2024-06-14 15:24:17,421 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 86 predicate places.
[2024-06-14 15:24:17,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 161 transitions, 1812 flow
[2024-06-14 15:24:17,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:17,421 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:24:17,421 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:24:17,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-06-14 15:24:17,421 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-14 15:24:17,422 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:24:17,422 INFO  L85        PathProgramCache]: Analyzing trace with hash 1142317483, now seen corresponding path program 3 times
[2024-06-14 15:24:17,422 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:24:17,422 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225866954]
[2024-06-14 15:24:17,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:24:17,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:24:17,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:24:26,156 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-14 15:24:26,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:24:26,156 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225866954]
[2024-06-14 15:24:26,156 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225866954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:24:26,156 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:24:26,156 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:24:26,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565766465]
[2024-06-14 15:24:26,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:24:26,157 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:24:26,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:24:26,157 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:24:26,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:24:26,342 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:24:26,343 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 161 transitions, 1812 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:26,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:24:26,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:24:26,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:24:27,925 INFO  L124   PetriNetUnfolderBase]: 2486/3740 cut-off events.
[2024-06-14 15:24:27,925 INFO  L125   PetriNetUnfolderBase]: For 120982/120988 co-relation queries the response was YES.
[2024-06-14 15:24:27,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26181 conditions, 3740 events. 2486/3740 cut-off events. For 120982/120988 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18127 event pairs, 597 based on Foata normal form. 8/3746 useless extension candidates. Maximal degree in co-relation 26119. Up to 3087 conditions per place. 
[2024-06-14 15:24:27,948 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 139 selfloop transitions, 59 changer transitions 0/203 dead transitions.
[2024-06-14 15:24:27,948 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 203 transitions, 2620 flow
[2024-06-14 15:24:27,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:24:27,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:24:27,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions.
[2024-06-14 15:24:27,950 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4796511627906977
[2024-06-14 15:24:27,950 INFO  L175             Difference]: Start difference. First operand has 130 places, 161 transitions, 1812 flow. Second operand 8 states and 165 transitions.
[2024-06-14 15:24:27,950 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 203 transitions, 2620 flow
[2024-06-14 15:24:28,033 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 203 transitions, 2475 flow, removed 22 selfloop flow, removed 6 redundant places.
[2024-06-14 15:24:28,036 INFO  L231             Difference]: Finished difference. Result has 133 places, 169 transitions, 1940 flow
[2024-06-14 15:24:28,036 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1940, PETRI_PLACES=133, PETRI_TRANSITIONS=169}
[2024-06-14 15:24:28,036 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 89 predicate places.
[2024-06-14 15:24:28,037 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 169 transitions, 1940 flow
[2024-06-14 15:24:28,037 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:28,037 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:24:28,037 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:24:28,037 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-06-14 15:24:28,037 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-14 15:24:28,037 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:24:28,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1253139879, now seen corresponding path program 3 times
[2024-06-14 15:24:28,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:24:28,037 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462080047]
[2024-06-14 15:24:28,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:24:28,038 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:24:28,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:24:36,816 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-14 15:24:36,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:24:36,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462080047]
[2024-06-14 15:24:36,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462080047] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:24:36,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:24:36,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:24:36,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201682257]
[2024-06-14 15:24:36,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:24:36,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:24:36,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:24:36,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:24:36,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:24:36,955 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:24:36,955 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 169 transitions, 1940 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:36,955 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:24:36,955 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:24:36,956 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:24:38,607 INFO  L124   PetriNetUnfolderBase]: 2466/3716 cut-off events.
[2024-06-14 15:24:38,608 INFO  L125   PetriNetUnfolderBase]: For 128810/128816 co-relation queries the response was YES.
[2024-06-14 15:24:38,621 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26466 conditions, 3716 events. 2466/3716 cut-off events. For 128810/128816 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17987 event pairs, 666 based on Foata normal form. 10/3724 useless extension candidates. Maximal degree in co-relation 26402. Up to 3488 conditions per place. 
[2024-06-14 15:24:38,636 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 167 selfloop transitions, 24 changer transitions 0/196 dead transitions.
[2024-06-14 15:24:38,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 196 transitions, 2390 flow
[2024-06-14 15:24:38,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:24:38,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:24:38,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions.
[2024-06-14 15:24:38,639 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-14 15:24:38,639 INFO  L175             Difference]: Start difference. First operand has 133 places, 169 transitions, 1940 flow. Second operand 8 states and 148 transitions.
[2024-06-14 15:24:38,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 196 transitions, 2390 flow
[2024-06-14 15:24:38,747 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 196 transitions, 2241 flow, removed 45 selfloop flow, removed 4 redundant places.
[2024-06-14 15:24:38,749 INFO  L231             Difference]: Finished difference. Result has 137 places, 169 transitions, 1846 flow
[2024-06-14 15:24:38,749 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1846, PETRI_PLACES=137, PETRI_TRANSITIONS=169}
[2024-06-14 15:24:38,750 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 93 predicate places.
[2024-06-14 15:24:38,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 137 places, 169 transitions, 1846 flow
[2024-06-14 15:24:38,750 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:38,750 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:24:38,750 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:24:38,750 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-06-14 15:24:38,751 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-14 15:24:38,751 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:24:38,751 INFO  L85        PathProgramCache]: Analyzing trace with hash 1257608653, now seen corresponding path program 4 times
[2024-06-14 15:24:38,751 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:24:38,751 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455103467]
[2024-06-14 15:24:38,751 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:24:38,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:24:38,804 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:24:47,505 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-14 15:24:47,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:24:47,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455103467]
[2024-06-14 15:24:47,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455103467] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:24:47,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:24:47,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:24:47,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152922807]
[2024-06-14 15:24:47,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:24:47,506 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:24:47,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:24:47,507 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:24:47,507 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:24:47,646 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:24:47,647 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 169 transitions, 1846 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:47,647 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:24:47,647 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:24:47,647 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:24:49,421 INFO  L124   PetriNetUnfolderBase]: 2528/3804 cut-off events.
[2024-06-14 15:24:49,421 INFO  L125   PetriNetUnfolderBase]: For 136493/136499 co-relation queries the response was YES.
[2024-06-14 15:24:49,431 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27296 conditions, 3804 events. 2528/3804 cut-off events. For 136493/136499 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 18554 event pairs, 560 based on Foata normal form. 8/3810 useless extension candidates. Maximal degree in co-relation 27230. Up to 3094 conditions per place. 
[2024-06-14 15:24:49,444 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 152 selfloop transitions, 62 changer transitions 0/219 dead transitions.
[2024-06-14 15:24:49,444 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 219 transitions, 2826 flow
[2024-06-14 15:24:49,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:24:49,444 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:24:49,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions.
[2024-06-14 15:24:49,445 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.502906976744186
[2024-06-14 15:24:49,445 INFO  L175             Difference]: Start difference. First operand has 137 places, 169 transitions, 1846 flow. Second operand 8 states and 173 transitions.
[2024-06-14 15:24:49,445 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 219 transitions, 2826 flow
[2024-06-14 15:24:49,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 219 transitions, 2763 flow, removed 4 selfloop flow, removed 7 redundant places.
[2024-06-14 15:24:49,535 INFO  L231             Difference]: Finished difference. Result has 139 places, 177 transitions, 2079 flow
[2024-06-14 15:24:49,535 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1783, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2079, PETRI_PLACES=139, PETRI_TRANSITIONS=177}
[2024-06-14 15:24:49,535 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 95 predicate places.
[2024-06-14 15:24:49,536 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 177 transitions, 2079 flow
[2024-06-14 15:24:49,536 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:24:49,536 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:24:49,536 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:24:49,536 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-06-14 15:24:49,536 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-14 15:24:49,536 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:24:49,537 INFO  L85        PathProgramCache]: Analyzing trace with hash 349577453, now seen corresponding path program 5 times
[2024-06-14 15:24:49,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:24:49,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462144624]
[2024-06-14 15:24:49,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:24:49,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:24:49,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:25:01,025 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:25:01,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:25:01,026 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462144624]
[2024-06-14 15:25:01,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462144624] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:25:01,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:25:01,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:25:01,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650409972]
[2024-06-14 15:25:01,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:25:01,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:25:01,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:25:01,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:25:01,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:25:01,186 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:25:01,186 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 177 transitions, 2079 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:01,186 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:25:01,186 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:25:01,186 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:25:02,845 INFO  L124   PetriNetUnfolderBase]: 2563/3855 cut-off events.
[2024-06-14 15:25:02,845 INFO  L125   PetriNetUnfolderBase]: For 149186/149192 co-relation queries the response was YES.
[2024-06-14 15:25:02,856 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28659 conditions, 3855 events. 2563/3855 cut-off events. For 149186/149192 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 18829 event pairs, 561 based on Foata normal form. 8/3861 useless extension candidates. Maximal degree in co-relation 28591. Up to 3265 conditions per place. 
[2024-06-14 15:25:02,870 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 155 selfloop transitions, 57 changer transitions 0/217 dead transitions.
[2024-06-14 15:25:02,870 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 217 transitions, 2855 flow
[2024-06-14 15:25:02,872 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:25:02,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:25:02,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions.
[2024-06-14 15:25:02,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48255813953488375
[2024-06-14 15:25:02,873 INFO  L175             Difference]: Start difference. First operand has 139 places, 177 transitions, 2079 flow. Second operand 8 states and 166 transitions.
[2024-06-14 15:25:02,873 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 217 transitions, 2855 flow
[2024-06-14 15:25:02,987 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 217 transitions, 2704 flow, removed 42 selfloop flow, removed 4 redundant places.
[2024-06-14 15:25:02,990 INFO  L231             Difference]: Finished difference. Result has 143 places, 181 transitions, 2147 flow
[2024-06-14 15:25:02,990 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2147, PETRI_PLACES=143, PETRI_TRANSITIONS=181}
[2024-06-14 15:25:02,990 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 99 predicate places.
[2024-06-14 15:25:02,990 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 181 transitions, 2147 flow
[2024-06-14 15:25:02,991 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:02,991 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:25:02,991 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:25:02,991 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-06-14 15:25:02,991 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-14 15:25:02,991 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:25:02,991 INFO  L85        PathProgramCache]: Analyzing trace with hash 1257793227, now seen corresponding path program 1 times
[2024-06-14 15:25:02,992 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:25:02,992 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72945299]
[2024-06-14 15:25:02,992 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:25:02,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:25:03,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:25:12,015 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-14 15:25:12,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:25:12,015 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72945299]
[2024-06-14 15:25:12,015 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72945299] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:25:12,015 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:25:12,015 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:25:12,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903880008]
[2024-06-14 15:25:12,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:25:12,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:25:12,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:25:12,017 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:25:12,017 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:25:12,255 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:25:12,256 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 181 transitions, 2147 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:12,256 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:25:12,256 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:25:12,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:25:13,876 INFO  L124   PetriNetUnfolderBase]: 2630/3954 cut-off events.
[2024-06-14 15:25:13,876 INFO  L125   PetriNetUnfolderBase]: For 163567/163573 co-relation queries the response was YES.
[2024-06-14 15:25:13,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29773 conditions, 3954 events. 2630/3954 cut-off events. For 163567/163573 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 19372 event pairs, 580 based on Foata normal form. 14/3966 useless extension candidates. Maximal degree in co-relation 29703. Up to 3346 conditions per place. 
[2024-06-14 15:25:13,913 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 160 selfloop transitions, 53 changer transitions 0/218 dead transitions.
[2024-06-14 15:25:13,913 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 218 transitions, 2911 flow
[2024-06-14 15:25:13,914 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:25:13,914 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:25:13,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-14 15:25:13,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-14 15:25:13,914 INFO  L175             Difference]: Start difference. First operand has 143 places, 181 transitions, 2147 flow. Second operand 8 states and 164 transitions.
[2024-06-14 15:25:13,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 218 transitions, 2911 flow
[2024-06-14 15:25:14,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 218 transitions, 2746 flow, removed 28 selfloop flow, removed 6 redundant places.
[2024-06-14 15:25:14,034 INFO  L231             Difference]: Finished difference. Result has 145 places, 185 transitions, 2183 flow
[2024-06-14 15:25:14,034 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=1982, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2183, PETRI_PLACES=145, PETRI_TRANSITIONS=185}
[2024-06-14 15:25:14,034 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 101 predicate places.
[2024-06-14 15:25:14,034 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 185 transitions, 2183 flow
[2024-06-14 15:25:14,035 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:14,035 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:25:14,035 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:25:14,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-06-14 15:25:14,035 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-14 15:25:14,035 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:25:14,035 INFO  L85        PathProgramCache]: Analyzing trace with hash 1257786283, now seen corresponding path program 6 times
[2024-06-14 15:25:14,035 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:25:14,035 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642700720]
[2024-06-14 15:25:14,035 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:25:14,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:25:14,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:25:23,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:25:23,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:25:23,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642700720]
[2024-06-14 15:25:23,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642700720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:25:23,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:25:23,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:25:23,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405651780]
[2024-06-14 15:25:23,312 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:25:23,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:25:23,312 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:25:23,312 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:25:23,313 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:25:23,591 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:25:23,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 185 transitions, 2183 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:23,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:25:23,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:25:23,598 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:25:25,325 INFO  L124   PetriNetUnfolderBase]: 2654/3994 cut-off events.
[2024-06-14 15:25:25,325 INFO  L125   PetriNetUnfolderBase]: For 170794/170800 co-relation queries the response was YES.
[2024-06-14 15:25:25,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30650 conditions, 3994 events. 2654/3994 cut-off events. For 170794/170800 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19666 event pairs, 548 based on Foata normal form. 8/4000 useless extension candidates. Maximal degree in co-relation 30579. Up to 3342 conditions per place. 
[2024-06-14 15:25:25,352 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 155 selfloop transitions, 64 changer transitions 0/224 dead transitions.
[2024-06-14 15:25:25,352 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 224 transitions, 3039 flow
[2024-06-14 15:25:25,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:25:25,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:25:25,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions.
[2024-06-14 15:25:25,354 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4738372093023256
[2024-06-14 15:25:25,354 INFO  L175             Difference]: Start difference. First operand has 145 places, 185 transitions, 2183 flow. Second operand 8 states and 163 transitions.
[2024-06-14 15:25:25,354 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 224 transitions, 3039 flow
[2024-06-14 15:25:25,475 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 224 transitions, 2868 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-14 15:25:25,479 INFO  L231             Difference]: Finished difference. Result has 147 places, 189 transitions, 2249 flow
[2024-06-14 15:25:25,479 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2249, PETRI_PLACES=147, PETRI_TRANSITIONS=189}
[2024-06-14 15:25:25,479 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places.
[2024-06-14 15:25:25,479 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 189 transitions, 2249 flow
[2024-06-14 15:25:25,479 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:25,480 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:25:25,480 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:25:25,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-06-14 15:25:25,480 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-14 15:25:25,480 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:25:25,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 1243500760, now seen corresponding path program 1 times
[2024-06-14 15:25:25,480 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:25:25,480 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385936952]
[2024-06-14 15:25:25,480 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:25:25,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:25:25,521 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:25:37,284 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-14 15:25:37,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:25:37,285 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385936952]
[2024-06-14 15:25:37,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385936952] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:25:37,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:25:37,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:25:37,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889997079]
[2024-06-14 15:25:37,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:25:37,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:25:37,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:25:37,285 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:25:37,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:25:37,414 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:25:37,414 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 189 transitions, 2249 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-14 15:25:37,414 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:25:37,414 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:25:37,414 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:25:38,795 INFO  L124   PetriNetUnfolderBase]: 2663/4004 cut-off events.
[2024-06-14 15:25:38,795 INFO  L125   PetriNetUnfolderBase]: For 177264/177264 co-relation queries the response was YES.
[2024-06-14 15:25:38,807 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30878 conditions, 4004 events. 2663/4004 cut-off events. For 177264/177264 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 19656 event pairs, 683 based on Foata normal form. 1/4003 useless extension candidates. Maximal degree in co-relation 30806. Up to 3859 conditions per place. 
[2024-06-14 15:25:38,822 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 187 selfloop transitions, 16 changer transitions 0/208 dead transitions.
[2024-06-14 15:25:38,822 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 208 transitions, 2808 flow
[2024-06-14 15:25:38,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:25:38,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:25:38,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions.
[2024-06-14 15:25:38,823 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43023255813953487
[2024-06-14 15:25:38,823 INFO  L175             Difference]: Start difference. First operand has 147 places, 189 transitions, 2249 flow. Second operand 6 states and 111 transitions.
[2024-06-14 15:25:38,823 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 208 transitions, 2808 flow
[2024-06-14 15:25:38,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 208 transitions, 2616 flow, removed 33 selfloop flow, removed 6 redundant places.
[2024-06-14 15:25:38,945 INFO  L231             Difference]: Finished difference. Result has 147 places, 192 transitions, 2146 flow
[2024-06-14 15:25:38,945 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2146, PETRI_PLACES=147, PETRI_TRANSITIONS=192}
[2024-06-14 15:25:38,945 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 103 predicate places.
[2024-06-14 15:25:38,945 INFO  L495      AbstractCegarLoop]: Abstraction has has 147 places, 192 transitions, 2146 flow
[2024-06-14 15:25:38,946 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-14 15:25:38,946 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:25:38,946 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:25:38,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-06-14 15:25:38,946 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-14 15:25:38,946 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:25:38,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -989368383, now seen corresponding path program 2 times
[2024-06-14 15:25:38,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:25:38,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248984791]
[2024-06-14 15:25:38,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:25:38,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:25:38,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:25:47,991 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-14 15:25:47,992 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:25:47,992 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248984791]
[2024-06-14 15:25:47,992 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248984791] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:25:47,992 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:25:47,992 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:25:47,992 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414142699]
[2024-06-14 15:25:47,992 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:25:47,992 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:25:47,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:25:47,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:25:47,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:25:48,181 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:25:48,181 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 192 transitions, 2146 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:48,181 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:25:48,181 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:25:48,181 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:25:49,922 INFO  L124   PetriNetUnfolderBase]: 2692/4049 cut-off events.
[2024-06-14 15:25:49,922 INFO  L125   PetriNetUnfolderBase]: For 186916/186916 co-relation queries the response was YES.
[2024-06-14 15:25:49,938 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30908 conditions, 4049 events. 2692/4049 cut-off events. For 186916/186916 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19944 event pairs, 675 based on Foata normal form. 6/4053 useless extension candidates. Maximal degree in co-relation 30835. Up to 3801 conditions per place. 
[2024-06-14 15:25:49,953 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 183 selfloop transitions, 33 changer transitions 0/221 dead transitions.
[2024-06-14 15:25:49,954 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 221 transitions, 2786 flow
[2024-06-14 15:25:49,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:25:49,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:25:49,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 15:25:49,955 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-14 15:25:49,955 INFO  L175             Difference]: Start difference. First operand has 147 places, 192 transitions, 2146 flow. Second operand 8 states and 151 transitions.
[2024-06-14 15:25:49,955 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 221 transitions, 2786 flow
[2024-06-14 15:25:50,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 221 transitions, 2668 flow, removed 16 selfloop flow, removed 5 redundant places.
[2024-06-14 15:25:50,088 INFO  L231             Difference]: Finished difference. Result has 150 places, 195 transitions, 2187 flow
[2024-06-14 15:25:50,089 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2028, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2187, PETRI_PLACES=150, PETRI_TRANSITIONS=195}
[2024-06-14 15:25:50,089 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 106 predicate places.
[2024-06-14 15:25:50,089 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 195 transitions, 2187 flow
[2024-06-14 15:25:50,089 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:25:50,089 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:25:50,089 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:25:50,089 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-06-14 15:25:50,089 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-14 15:25:50,090 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:25:50,090 INFO  L85        PathProgramCache]: Analyzing trace with hash -997649537, now seen corresponding path program 7 times
[2024-06-14 15:25:50,090 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:25:50,090 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012595304]
[2024-06-14 15:25:50,090 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:25:50,090 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:25:50,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:26:01,676 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-14 15:26:01,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:26:01,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012595304]
[2024-06-14 15:26:01,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012595304] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:26:01,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:26:01,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:26:01,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405946772]
[2024-06-14 15:26:01,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:26:01,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:26:01,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:26:01,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:26:01,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:26:01,880 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:26:01,880 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 195 transitions, 2187 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:01,880 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:26:01,880 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:26:01,880 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:26:03,567 INFO  L124   PetriNetUnfolderBase]: 2695/4055 cut-off events.
[2024-06-14 15:26:03,567 INFO  L125   PetriNetUnfolderBase]: For 195260/195266 co-relation queries the response was YES.
[2024-06-14 15:26:03,580 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31377 conditions, 4055 events. 2695/4055 cut-off events. For 195260/195266 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19950 event pairs, 672 based on Foata normal form. 12/4065 useless extension candidates. Maximal degree in co-relation 31303. Up to 3805 conditions per place. 
[2024-06-14 15:26:03,595 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 194 selfloop transitions, 27 changer transitions 0/226 dead transitions.
[2024-06-14 15:26:03,596 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 226 transitions, 2869 flow
[2024-06-14 15:26:03,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:26:03,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:26:03,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 15:26:03,597 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 15:26:03,597 INFO  L175             Difference]: Start difference. First operand has 150 places, 195 transitions, 2187 flow. Second operand 8 states and 152 transitions.
[2024-06-14 15:26:03,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 226 transitions, 2869 flow
[2024-06-14 15:26:03,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 226 transitions, 2736 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-06-14 15:26:03,740 INFO  L231             Difference]: Finished difference. Result has 152 places, 199 transitions, 2227 flow
[2024-06-14 15:26:03,741 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2054, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2227, PETRI_PLACES=152, PETRI_TRANSITIONS=199}
[2024-06-14 15:26:03,741 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 108 predicate places.
[2024-06-14 15:26:03,741 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 199 transitions, 2227 flow
[2024-06-14 15:26:03,741 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:03,741 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:26:03,741 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:26:03,741 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-06-14 15:26:03,741 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-14 15:26:03,742 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:26:03,742 INFO  L85        PathProgramCache]: Analyzing trace with hash 530068363, now seen corresponding path program 3 times
[2024-06-14 15:26:03,742 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:26:03,742 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493518223]
[2024-06-14 15:26:03,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:26:03,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:26:03,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:26:13,250 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:26:13,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:26:13,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493518223]
[2024-06-14 15:26:13,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493518223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:26:13,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:26:13,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:26:13,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153059890]
[2024-06-14 15:26:13,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:26:13,251 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:26:13,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:26:13,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:26:13,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:26:13,552 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:26:13,552 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 199 transitions, 2227 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:13,552 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:26:13,552 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:26:13,552 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:26:15,128 INFO  L124   PetriNetUnfolderBase]: 2723/4098 cut-off events.
[2024-06-14 15:26:15,129 INFO  L125   PetriNetUnfolderBase]: For 206034/206034 co-relation queries the response was YES.
[2024-06-14 15:26:15,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31916 conditions, 4098 events. 2723/4098 cut-off events. For 206034/206034 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20195 event pairs, 679 based on Foata normal form. 6/4102 useless extension candidates. Maximal degree in co-relation 31841. Up to 3831 conditions per place. 
[2024-06-14 15:26:15,158 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 195 selfloop transitions, 30 changer transitions 0/230 dead transitions.
[2024-06-14 15:26:15,158 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 230 transitions, 2971 flow
[2024-06-14 15:26:15,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:26:15,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:26:15,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 15:26:15,160 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 15:26:15,160 INFO  L175             Difference]: Start difference. First operand has 152 places, 199 transitions, 2227 flow. Second operand 8 states and 152 transitions.
[2024-06-14 15:26:15,160 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 230 transitions, 2971 flow
[2024-06-14 15:26:15,298 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 230 transitions, 2846 flow, removed 38 selfloop flow, removed 6 redundant places.
[2024-06-14 15:26:15,301 INFO  L231             Difference]: Finished difference. Result has 154 places, 202 transitions, 2262 flow
[2024-06-14 15:26:15,301 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2262, PETRI_PLACES=154, PETRI_TRANSITIONS=202}
[2024-06-14 15:26:15,302 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 110 predicate places.
[2024-06-14 15:26:15,302 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 202 transitions, 2262 flow
[2024-06-14 15:26:15,302 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:15,302 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:26:15,302 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:26:15,302 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-06-14 15:26:15,302 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-14 15:26:15,302 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:26:15,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -989368631, now seen corresponding path program 1 times
[2024-06-14 15:26:15,303 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:26:15,303 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798546994]
[2024-06-14 15:26:15,303 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:26:15,303 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:26:15,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:26:24,220 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-14 15:26:24,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:26:24,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798546994]
[2024-06-14 15:26:24,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798546994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:26:24,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:26:24,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:26:24,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109889775]
[2024-06-14 15:26:24,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:26:24,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:26:24,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:26:24,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:26:24,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:26:24,408 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:26:24,408 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 202 transitions, 2262 flow. Second operand  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:24,408 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:26:24,408 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:26:24,408 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:26:25,942 INFO  L124   PetriNetUnfolderBase]: 2726/4103 cut-off events.
[2024-06-14 15:26:25,942 INFO  L125   PetriNetUnfolderBase]: For 213501/213507 co-relation queries the response was YES.
[2024-06-14 15:26:25,959 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32202 conditions, 4103 events. 2726/4103 cut-off events. For 213501/213507 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20264 event pairs, 669 based on Foata normal form. 9/4110 useless extension candidates. Maximal degree in co-relation 32126. Up to 3841 conditions per place. 
[2024-06-14 15:26:25,979 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 187 selfloop transitions, 36 changer transitions 0/228 dead transitions.
[2024-06-14 15:26:25,980 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 228 transitions, 2920 flow
[2024-06-14 15:26:25,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:26:25,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:26:25,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions.
[2024-06-14 15:26:25,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.45182724252491696
[2024-06-14 15:26:25,981 INFO  L175             Difference]: Start difference. First operand has 154 places, 202 transitions, 2262 flow. Second operand 7 states and 136 transitions.
[2024-06-14 15:26:25,981 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 228 transitions, 2920 flow
[2024-06-14 15:26:26,155 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 228 transitions, 2782 flow, removed 41 selfloop flow, removed 6 redundant places.
[2024-06-14 15:26:26,158 INFO  L231             Difference]: Finished difference. Result has 155 places, 206 transitions, 2302 flow
[2024-06-14 15:26:26,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2302, PETRI_PLACES=155, PETRI_TRANSITIONS=206}
[2024-06-14 15:26:26,158 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 111 predicate places.
[2024-06-14 15:26:26,158 INFO  L495      AbstractCegarLoop]: Abstraction has has 155 places, 206 transitions, 2302 flow
[2024-06-14 15:26:26,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:26,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:26:26,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:26:26,159 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-06-14 15:26:26,159 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-14 15:26:26,159 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:26:26,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 1381415421, now seen corresponding path program 4 times
[2024-06-14 15:26:26,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:26:26,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283521199]
[2024-06-14 15:26:26,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:26:26,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:26:26,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:26:35,983 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-14 15:26:35,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:26:35,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283521199]
[2024-06-14 15:26:35,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283521199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:26:35,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:26:35,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:26:35,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036180161]
[2024-06-14 15:26:35,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:26:35,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:26:35,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:26:35,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:26:35,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:26:36,253 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:26:36,253 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 206 transitions, 2302 flow. Second operand  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:36,253 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:26:36,253 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:26:36,254 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:26:37,990 INFO  L124   PetriNetUnfolderBase]: 2729/4107 cut-off events.
[2024-06-14 15:26:37,990 INFO  L125   PetriNetUnfolderBase]: For 221720/221720 co-relation queries the response was YES.
[2024-06-14 15:26:38,007 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32239 conditions, 4107 events. 2729/4107 cut-off events. For 221720/221720 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20303 event pairs, 655 based on Foata normal form. 6/4111 useless extension candidates. Maximal degree in co-relation 32162. Up to 3872 conditions per place. 
[2024-06-14 15:26:38,025 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 202 selfloop transitions, 28 changer transitions 0/235 dead transitions.
[2024-06-14 15:26:38,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 235 transitions, 2992 flow
[2024-06-14 15:26:38,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:26:38,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:26:38,027 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 15:26:38,027 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.436046511627907
[2024-06-14 15:26:38,027 INFO  L175             Difference]: Start difference. First operand has 155 places, 206 transitions, 2302 flow. Second operand 8 states and 150 transitions.
[2024-06-14 15:26:38,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 235 transitions, 2992 flow
[2024-06-14 15:26:38,237 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 235 transitions, 2872 flow, removed 29 selfloop flow, removed 5 redundant places.
[2024-06-14 15:26:38,240 INFO  L231             Difference]: Finished difference. Result has 158 places, 209 transitions, 2346 flow
[2024-06-14 15:26:38,240 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2182, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2346, PETRI_PLACES=158, PETRI_TRANSITIONS=209}
[2024-06-14 15:26:38,240 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places.
[2024-06-14 15:26:38,240 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 2346 flow
[2024-06-14 15:26:38,241 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:26:38,241 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:26:38,241 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:26:38,241 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-06-14 15:26:38,241 INFO  L420      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:26:38,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:26:38,241 INFO  L85        PathProgramCache]: Analyzing trace with hash -1952369286, now seen corresponding path program 2 times
[2024-06-14 15:26:38,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:26:38,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267931702]
[2024-06-14 15:26:38,242 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:26:38,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:26:38,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:26:50,405 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-14 15:26:50,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:26:50,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267931702]
[2024-06-14 15:26:50,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267931702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:26:50,405 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:26:50,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:26:50,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551855231]
[2024-06-14 15:26:50,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:26:50,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:26:50,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:26:50,406 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:26:50,406 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:26:50,553 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:26:50,554 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 2346 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-14 15:26:50,554 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:26:50,554 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:26:50,554 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:26:52,202 INFO  L124   PetriNetUnfolderBase]: 2725/4102 cut-off events.
[2024-06-14 15:26:52,202 INFO  L125   PetriNetUnfolderBase]: For 229244/229244 co-relation queries the response was YES.
[2024-06-14 15:26:52,224 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32587 conditions, 4102 events. 2725/4102 cut-off events. For 229244/229244 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20270 event pairs, 683 based on Foata normal form. 1/4101 useless extension candidates. Maximal degree in co-relation 32509. Up to 3976 conditions per place. 
[2024-06-14 15:26:52,246 INFO  L140   encePairwiseOnDemand]: 35/43 looper letters, 202 selfloop transitions, 11 changer transitions 0/218 dead transitions.
[2024-06-14 15:26:52,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 218 transitions, 2794 flow
[2024-06-14 15:26:52,247 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:26:52,247 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:26:52,247 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions.
[2024-06-14 15:26:52,248 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3953488372093023
[2024-06-14 15:26:52,248 INFO  L175             Difference]: Start difference. First operand has 158 places, 209 transitions, 2346 flow. Second operand 6 states and 102 transitions.
[2024-06-14 15:26:52,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 218 transitions, 2794 flow
[2024-06-14 15:26:52,479 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 218 transitions, 2644 flow, removed 49 selfloop flow, removed 6 redundant places.
[2024-06-14 15:26:52,483 INFO  L231             Difference]: Finished difference. Result has 158 places, 209 transitions, 2224 flow
[2024-06-14 15:26:52,483 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2196, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2224, PETRI_PLACES=158, PETRI_TRANSITIONS=209}
[2024-06-14 15:26:52,483 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 114 predicate places.
[2024-06-14 15:26:52,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 209 transitions, 2224 flow
[2024-06-14 15:26:52,484 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-14 15:26:52,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:26:52,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:26:52,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-06-14 15:26:52,484 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-14 15:26:52,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:26:52,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 1249220632, now seen corresponding path program 1 times
[2024-06-14 15:26:52,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:26:52,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142601661]
[2024-06-14 15:26:52,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:26:52,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:26:52,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:27:07,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:27:07,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:27:07,851 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142601661]
[2024-06-14 15:27:07,851 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142601661] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:27:07,851 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:27:07,851 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:27:07,851 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22600078]
[2024-06-14 15:27:07,851 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:27:07,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:27:07,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:27:07,852 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:27:07,852 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:27:08,002 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:27:08,002 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 209 transitions, 2224 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-14 15:27:08,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:27:08,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:27:08,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:27:09,592 INFO  L124   PetriNetUnfolderBase]: 2725/4102 cut-off events.
[2024-06-14 15:27:09,593 INFO  L125   PetriNetUnfolderBase]: For 237066/237066 co-relation queries the response was YES.
[2024-06-14 15:27:09,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32403 conditions, 4102 events. 2725/4102 cut-off events. For 237066/237066 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20212 event pairs, 681 based on Foata normal form. 3/4103 useless extension candidates. Maximal degree in co-relation 32324. Up to 3927 conditions per place. 
[2024-06-14 15:27:09,624 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 196 selfloop transitions, 24 changer transitions 0/225 dead transitions.
[2024-06-14 15:27:09,624 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 225 transitions, 2817 flow
[2024-06-14 15:27:09,625 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:27:09,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:27:09,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions.
[2024-06-14 15:27:09,625 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43410852713178294
[2024-06-14 15:27:09,625 INFO  L175             Difference]: Start difference. First operand has 158 places, 209 transitions, 2224 flow. Second operand 6 states and 112 transitions.
[2024-06-14 15:27:09,625 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 225 transitions, 2817 flow
[2024-06-14 15:27:09,789 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 225 transitions, 2785 flow, removed 3 selfloop flow, removed 5 redundant places.
[2024-06-14 15:27:09,792 INFO  L231             Difference]: Finished difference. Result has 159 places, 212 transitions, 2298 flow
[2024-06-14 15:27:09,792 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2192, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2298, PETRI_PLACES=159, PETRI_TRANSITIONS=212}
[2024-06-14 15:27:09,793 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 115 predicate places.
[2024-06-14 15:27:09,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 159 places, 212 transitions, 2298 flow
[2024-06-14 15:27:09,793 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-14 15:27:09,793 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:27:09,793 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:27:09,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-06-14 15:27:09,793 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-14 15:27:09,793 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:27:09,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -1952363334, now seen corresponding path program 2 times
[2024-06-14 15:27:09,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:27:09,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763645276]
[2024-06-14 15:27:09,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:27:09,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:27:09,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:27:24,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:27:24,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:27:24,528 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763645276]
[2024-06-14 15:27:24,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763645276] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:27:24,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:27:24,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-06-14 15:27:24,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365165110]
[2024-06-14 15:27:24,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:27:24,529 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-06-14 15:27:24,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:27:24,529 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-06-14 15:27:24,529 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-06-14 15:27:24,681 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:27:24,681 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 212 transitions, 2298 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-14 15:27:24,682 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:27:24,682 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:27:24,682 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:27:26,259 INFO  L124   PetriNetUnfolderBase]: 2693/4054 cut-off events.
[2024-06-14 15:27:26,260 INFO  L125   PetriNetUnfolderBase]: For 245348/245354 co-relation queries the response was YES.
[2024-06-14 15:27:26,275 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32372 conditions, 4054 events. 2693/4054 cut-off events. For 245348/245354 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19956 event pairs, 691 based on Foata normal form. 3/4055 useless extension candidates. Maximal degree in co-relation 32292. Up to 3881 conditions per place. 
[2024-06-14 15:27:26,291 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 191 selfloop transitions, 25 changer transitions 0/221 dead transitions.
[2024-06-14 15:27:26,291 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 221 transitions, 2752 flow
[2024-06-14 15:27:26,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-06-14 15:27:26,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-06-14 15:27:26,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions.
[2024-06-14 15:27:26,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42248062015503873
[2024-06-14 15:27:26,292 INFO  L175             Difference]: Start difference. First operand has 159 places, 212 transitions, 2298 flow. Second operand 6 states and 109 transitions.
[2024-06-14 15:27:26,292 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 221 transitions, 2752 flow
[2024-06-14 15:27:26,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 221 transitions, 2692 flow, removed 10 selfloop flow, removed 4 redundant places.
[2024-06-14 15:27:26,483 INFO  L231             Difference]: Finished difference. Result has 161 places, 212 transitions, 2294 flow
[2024-06-14 15:27:26,483 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2294, PETRI_PLACES=161, PETRI_TRANSITIONS=212}
[2024-06-14 15:27:26,484 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 117 predicate places.
[2024-06-14 15:27:26,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 161 places, 212 transitions, 2294 flow
[2024-06-14 15:27:26,484 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-14 15:27:26,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:27:26,484 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:27:26,484 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-06-14 15:27:26,484 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-14 15:27:26,485 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:27:26,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -1987210868, now seen corresponding path program 1 times
[2024-06-14 15:27:26,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:27:26,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426264389]
[2024-06-14 15:27:26,485 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:27:26,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:27:26,516 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:27:43,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:27:43,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:27:43,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426264389]
[2024-06-14 15:27:43,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426264389] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:27:43,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:27:43,417 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:27:43,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086504888]
[2024-06-14 15:27:43,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:27:43,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:27:43,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:27:43,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:27:43,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:27:43,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-14 15:27:43,595 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 212 transitions, 2294 flow. Second operand  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:27:43,595 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:27:43,595 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-14 15:27:43,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:27:45,194 INFO  L124   PetriNetUnfolderBase]: 2859/4216 cut-off events.
[2024-06-14 15:27:45,194 INFO  L125   PetriNetUnfolderBase]: For 255894/255894 co-relation queries the response was YES.
[2024-06-14 15:27:45,212 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33486 conditions, 4216 events. 2859/4216 cut-off events. For 255894/255894 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19921 event pairs, 731 based on Foata normal form. 3/4217 useless extension candidates. Maximal degree in co-relation 33405. Up to 4188 conditions per place. 
[2024-06-14 15:27:45,228 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 210 selfloop transitions, 14 changer transitions 0/227 dead transitions.
[2024-06-14 15:27:45,228 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 227 transitions, 2802 flow
[2024-06-14 15:27:45,229 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:27:45,229 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:27:45,229 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions.
[2024-06-14 15:27:45,229 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3687707641196013
[2024-06-14 15:27:45,229 INFO  L175             Difference]: Start difference. First operand has 161 places, 212 transitions, 2294 flow. Second operand 7 states and 111 transitions.
[2024-06-14 15:27:45,230 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 227 transitions, 2802 flow
[2024-06-14 15:27:45,412 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 227 transitions, 2730 flow, removed 3 selfloop flow, removed 6 redundant places.
[2024-06-14 15:27:45,415 INFO  L231             Difference]: Finished difference. Result has 162 places, 215 transitions, 2294 flow
[2024-06-14 15:27:45,415 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2222, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2294, PETRI_PLACES=162, PETRI_TRANSITIONS=215}
[2024-06-14 15:27:45,416 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 118 predicate places.
[2024-06-14 15:27:45,416 INFO  L495      AbstractCegarLoop]: Abstraction has has 162 places, 215 transitions, 2294 flow
[2024-06-14 15:27:45,416 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:27:45,416 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:27:45,416 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:27:45,417 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-06-14 15:27:45,417 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-14 15:27:45,417 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:27:45,417 INFO  L85        PathProgramCache]: Analyzing trace with hash 963535217, now seen corresponding path program 1 times
[2024-06-14 15:27:45,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:27:45,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526252524]
[2024-06-14 15:27:45,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:27:45,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:27:45,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:27:55,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:27:55,942 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:27:55,942 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526252524]
[2024-06-14 15:27:55,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526252524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:27:55,943 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:27:55,943 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:27:55,943 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172699828]
[2024-06-14 15:27:55,943 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:27:55,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:27:55,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:27:55,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:27:55,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:27:56,216 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:27:56,216 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 215 transitions, 2294 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:27:56,216 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:27:56,216 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:27:56,216 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:27:58,135 INFO  L124   PetriNetUnfolderBase]: 2954/4460 cut-off events.
[2024-06-14 15:27:58,135 INFO  L125   PetriNetUnfolderBase]: For 304478/304484 co-relation queries the response was YES.
[2024-06-14 15:27:58,154 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36849 conditions, 4460 events. 2954/4460 cut-off events. For 304478/304484 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22676 event pairs, 432 based on Foata normal form. 26/4475 useless extension candidates. Maximal degree in co-relation 36768. Up to 2644 conditions per place. 
[2024-06-14 15:27:58,172 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 176 selfloop transitions, 98 changer transitions 0/279 dead transitions.
[2024-06-14 15:27:58,172 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 279 transitions, 3802 flow
[2024-06-14 15:27:58,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:27:58,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:27:58,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 195 transitions.
[2024-06-14 15:27:58,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5038759689922481
[2024-06-14 15:27:58,173 INFO  L175             Difference]: Start difference. First operand has 162 places, 215 transitions, 2294 flow. Second operand 9 states and 195 transitions.
[2024-06-14 15:27:58,173 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 279 transitions, 3802 flow
[2024-06-14 15:27:58,472 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 279 transitions, 3752 flow, removed 13 selfloop flow, removed 5 redundant places.
[2024-06-14 15:27:58,475 INFO  L231             Difference]: Finished difference. Result has 168 places, 221 transitions, 2656 flow
[2024-06-14 15:27:58,476 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2656, PETRI_PLACES=168, PETRI_TRANSITIONS=221}
[2024-06-14 15:27:58,476 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 124 predicate places.
[2024-06-14 15:27:58,476 INFO  L495      AbstractCegarLoop]: Abstraction has has 168 places, 221 transitions, 2656 flow
[2024-06-14 15:27:58,476 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:27:58,476 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:27:58,477 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:27:58,477 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-06-14 15:27:58,477 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-14 15:27:58,477 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:27:58,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 965412887, now seen corresponding path program 2 times
[2024-06-14 15:27:58,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:27:58,478 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581517947]
[2024-06-14 15:27:58,478 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:27:58,478 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:27:58,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:28:08,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:28:08,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:28:08,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581517947]
[2024-06-14 15:28:08,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581517947] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:28:08,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:28:08,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:28:08,445 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35929092]
[2024-06-14 15:28:08,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:28:08,446 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:28:08,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:28:08,447 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:28:08,447 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:28:08,610 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:28:08,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 221 transitions, 2656 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:08,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:28:08,611 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:28:08,611 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:28:10,549 INFO  L124   PetriNetUnfolderBase]: 3063/4655 cut-off events.
[2024-06-14 15:28:10,550 INFO  L125   PetriNetUnfolderBase]: For 338116/338122 co-relation queries the response was YES.
[2024-06-14 15:28:10,570 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39701 conditions, 4655 events. 3063/4655 cut-off events. For 338116/338122 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 24070 event pairs, 698 based on Foata normal form. 32/4685 useless extension candidates. Maximal degree in co-relation 39617. Up to 3507 conditions per place. 
[2024-06-14 15:28:10,590 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 169 selfloop transitions, 97 changer transitions 0/271 dead transitions.
[2024-06-14 15:28:10,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 271 transitions, 3809 flow
[2024-06-14 15:28:10,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:28:10,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:28:10,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions.
[2024-06-14 15:28:10,591 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4883720930232558
[2024-06-14 15:28:10,591 INFO  L175             Difference]: Start difference. First operand has 168 places, 221 transitions, 2656 flow. Second operand 9 states and 189 transitions.
[2024-06-14 15:28:10,591 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 271 transitions, 3809 flow
[2024-06-14 15:28:10,897 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 271 transitions, 3612 flow, removed 44 selfloop flow, removed 4 redundant places.
[2024-06-14 15:28:10,901 INFO  L231             Difference]: Finished difference. Result has 173 places, 223 transitions, 2748 flow
[2024-06-14 15:28:10,902 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2748, PETRI_PLACES=173, PETRI_TRANSITIONS=223}
[2024-06-14 15:28:10,903 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 129 predicate places.
[2024-06-14 15:28:10,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 173 places, 223 transitions, 2748 flow
[2024-06-14 15:28:10,903 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:10,903 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:28:10,903 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:28:10,903 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-06-14 15:28:10,903 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-14 15:28:10,904 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:28:10,904 INFO  L85        PathProgramCache]: Analyzing trace with hash -1413898407, now seen corresponding path program 3 times
[2024-06-14 15:28:10,904 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:28:10,904 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746058659]
[2024-06-14 15:28:10,904 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:28:10,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:28:10,948 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:28:21,663 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-14 15:28:21,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:28:21,663 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746058659]
[2024-06-14 15:28:21,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746058659] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:28:21,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:28:21,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:28:21,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711533326]
[2024-06-14 15:28:21,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:28:21,663 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:28:21,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:28:21,664 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:28:21,664 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:28:21,818 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:28:21,819 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 223 transitions, 2748 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:21,819 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:28:21,819 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:28:21,819 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:28:23,907 INFO  L124   PetriNetUnfolderBase]: 3233/4923 cut-off events.
[2024-06-14 15:28:23,907 INFO  L125   PetriNetUnfolderBase]: For 359884/359890 co-relation queries the response was YES.
[2024-06-14 15:28:23,927 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 42607 conditions, 4923 events. 3233/4923 cut-off events. For 359884/359890 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 25967 event pairs, 702 based on Foata normal form. 26/4944 useless extension candidates. Maximal degree in co-relation 42521. Up to 3505 conditions per place. 
[2024-06-14 15:28:23,947 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 176 selfloop transitions, 98 changer transitions 0/279 dead transitions.
[2024-06-14 15:28:23,947 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 279 transitions, 4086 flow
[2024-06-14 15:28:23,947 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:28:23,947 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:28:23,948 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions.
[2024-06-14 15:28:23,948 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49612403100775193
[2024-06-14 15:28:23,948 INFO  L175             Difference]: Start difference. First operand has 173 places, 223 transitions, 2748 flow. Second operand 9 states and 192 transitions.
[2024-06-14 15:28:23,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 279 transitions, 4086 flow
[2024-06-14 15:28:24,293 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 279 transitions, 3834 flow, removed 31 selfloop flow, removed 7 redundant places.
[2024-06-14 15:28:24,297 INFO  L231             Difference]: Finished difference. Result has 176 places, 227 transitions, 2856 flow
[2024-06-14 15:28:24,297 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2496, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2856, PETRI_PLACES=176, PETRI_TRANSITIONS=227}
[2024-06-14 15:28:24,297 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 132 predicate places.
[2024-06-14 15:28:24,297 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 227 transitions, 2856 flow
[2024-06-14 15:28:24,297 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:24,298 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:28:24,298 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:28:24,298 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-06-14 15:28:24,298 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-14 15:28:24,298 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:28:24,298 INFO  L85        PathProgramCache]: Analyzing trace with hash 1052248847, now seen corresponding path program 4 times
[2024-06-14 15:28:24,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:28:24,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463698204]
[2024-06-14 15:28:24,299 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:28:24,299 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:28:24,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:28:34,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:28:34,356 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:28:34,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463698204]
[2024-06-14 15:28:34,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463698204] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:28:34,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:28:34,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:28:34,356 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228624175]
[2024-06-14 15:28:34,356 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:28:34,356 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:28:34,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:28:34,357 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:28:34,357 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:28:34,659 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:28:34,660 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 227 transitions, 2856 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:34,660 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:28:34,660 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:28:34,660 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:28:36,677 INFO  L124   PetriNetUnfolderBase]: 3361/5133 cut-off events.
[2024-06-14 15:28:36,678 INFO  L125   PetriNetUnfolderBase]: For 390854/390860 co-relation queries the response was YES.
[2024-06-14 15:28:36,702 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44293 conditions, 5133 events. 3361/5133 cut-off events. For 390854/390860 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 27479 event pairs, 810 based on Foata normal form. 32/5163 useless extension candidates. Maximal degree in co-relation 44205. Up to 4314 conditions per place. 
[2024-06-14 15:28:36,725 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 195 selfloop transitions, 71 changer transitions 0/271 dead transitions.
[2024-06-14 15:28:36,726 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 271 transitions, 3799 flow
[2024-06-14 15:28:36,727 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:28:36,727 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:28:36,727 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-14 15:28:36,727 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-14 15:28:36,727 INFO  L175             Difference]: Start difference. First operand has 176 places, 227 transitions, 2856 flow. Second operand 9 states and 184 transitions.
[2024-06-14 15:28:36,727 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 271 transitions, 3799 flow
[2024-06-14 15:28:37,198 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 271 transitions, 3598 flow, removed 44 selfloop flow, removed 5 redundant places.
[2024-06-14 15:28:37,202 INFO  L231             Difference]: Finished difference. Result has 180 places, 229 transitions, 2900 flow
[2024-06-14 15:28:37,202 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2900, PETRI_PLACES=180, PETRI_TRANSITIONS=229}
[2024-06-14 15:28:37,202 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 136 predicate places.
[2024-06-14 15:28:37,202 INFO  L495      AbstractCegarLoop]: Abstraction has has 180 places, 229 transitions, 2900 flow
[2024-06-14 15:28:37,203 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:37,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:28:37,203 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:28:37,203 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-06-14 15:28:37,203 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-14 15:28:37,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:28:37,204 INFO  L85        PathProgramCache]: Analyzing trace with hash 2108295243, now seen corresponding path program 5 times
[2024-06-14 15:28:37,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:28:37,204 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713097736]
[2024-06-14 15:28:37,204 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:28:37,204 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:28:37,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:28:48,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-14 15:28:48,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:28:48,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713097736]
[2024-06-14 15:28:48,328 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713097736] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:28:48,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:28:48,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:28:48,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067607371]
[2024-06-14 15:28:48,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:28:48,328 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:28:48,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:28:48,328 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:28:48,329 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:28:48,554 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:28:48,555 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 229 transitions, 2900 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:48,555 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:28:48,555 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:28:48,555 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:28:50,717 INFO  L124   PetriNetUnfolderBase]: 3485/5337 cut-off events.
[2024-06-14 15:28:50,717 INFO  L125   PetriNetUnfolderBase]: For 409780/409786 co-relation queries the response was YES.
[2024-06-14 15:28:50,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46069 conditions, 5337 events. 3485/5337 cut-off events. For 409780/409786 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 28883 event pairs, 837 based on Foata normal form. 32/5367 useless extension candidates. Maximal degree in co-relation 45979. Up to 4509 conditions per place. 
[2024-06-14 15:28:50,766 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 203 selfloop transitions, 65 changer transitions 0/273 dead transitions.
[2024-06-14 15:28:50,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 273 transitions, 3925 flow
[2024-06-14 15:28:50,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:28:50,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:28:50,767 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 184 transitions.
[2024-06-14 15:28:50,767 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4754521963824289
[2024-06-14 15:28:50,767 INFO  L175             Difference]: Start difference. First operand has 180 places, 229 transitions, 2900 flow. Second operand 9 states and 184 transitions.
[2024-06-14 15:28:50,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 273 transitions, 3925 flow
[2024-06-14 15:28:51,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 273 transitions, 3762 flow, removed 35 selfloop flow, removed 6 redundant places.
[2024-06-14 15:28:51,191 INFO  L231             Difference]: Finished difference. Result has 183 places, 231 transitions, 2974 flow
[2024-06-14 15:28:51,191 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2974, PETRI_PLACES=183, PETRI_TRANSITIONS=231}
[2024-06-14 15:28:51,192 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 139 predicate places.
[2024-06-14 15:28:51,192 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 231 transitions, 2974 flow
[2024-06-14 15:28:51,192 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:28:51,192 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:28:51,192 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:28:51,192 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-06-14 15:28:51,192 INFO  L420      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:28:51,192 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:28:51,192 INFO  L85        PathProgramCache]: Analyzing trace with hash 2108291523, now seen corresponding path program 6 times
[2024-06-14 15:28:51,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:28:51,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742040668]
[2024-06-14 15:28:51,193 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:28:51,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:28:51,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:29:03,265 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-14 15:29:03,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:29:03,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742040668]
[2024-06-14 15:29:03,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742040668] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:29:03,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:29:03,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:29:03,266 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559849305]
[2024-06-14 15:29:03,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:29:03,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:29:03,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:29:03,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:29:03,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:29:03,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:29:03,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 231 transitions, 2974 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:03,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:29:03,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:29:03,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:29:05,790 INFO  L124   PetriNetUnfolderBase]: 3785/5809 cut-off events.
[2024-06-14 15:29:05,790 INFO  L125   PetriNetUnfolderBase]: For 458204/458210 co-relation queries the response was YES.
[2024-06-14 15:29:05,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51157 conditions, 5809 events. 3785/5809 cut-off events. For 458204/458210 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 32074 event pairs, 951 based on Foata normal form. 26/5827 useless extension candidates. Maximal degree in co-relation 51066. Up to 4277 conditions per place. 
[2024-06-14 15:29:05,841 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 210 selfloop transitions, 71 changer transitions 0/286 dead transitions.
[2024-06-14 15:29:05,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 286 transitions, 4406 flow
[2024-06-14 15:29:05,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:29:05,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:29:05,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions.
[2024-06-14 15:29:05,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4909560723514212
[2024-06-14 15:29:05,842 INFO  L175             Difference]: Start difference. First operand has 183 places, 231 transitions, 2974 flow. Second operand 9 states and 190 transitions.
[2024-06-14 15:29:05,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 286 transitions, 4406 flow
[2024-06-14 15:29:06,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 286 transitions, 4206 flow, removed 37 selfloop flow, removed 7 redundant places.
[2024-06-14 15:29:06,346 INFO  L231             Difference]: Finished difference. Result has 186 places, 237 transitions, 3157 flow
[2024-06-14 15:29:06,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2774, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3157, PETRI_PLACES=186, PETRI_TRANSITIONS=237}
[2024-06-14 15:29:06,346 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 142 predicate places.
[2024-06-14 15:29:06,346 INFO  L495      AbstractCegarLoop]: Abstraction has has 186 places, 237 transitions, 3157 flow
[2024-06-14 15:29:06,346 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:06,346 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:29:06,346 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:29:06,347 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-06-14 15:29:06,347 INFO  L420      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:29:06,347 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:29:06,347 INFO  L85        PathProgramCache]: Analyzing trace with hash -106479124, now seen corresponding path program 1 times
[2024-06-14 15:29:06,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:29:06,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649825584]
[2024-06-14 15:29:06,347 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:29:06,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:29:06,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:29:18,414 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-14 15:29:18,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:29:18,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649825584]
[2024-06-14 15:29:18,415 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649825584] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:29:18,415 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:29:18,415 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:29:18,415 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314273046]
[2024-06-14 15:29:18,415 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:29:18,415 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:29:18,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:29:18,416 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:29:18,416 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:29:18,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:29:18,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 237 transitions, 3157 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:18,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:29:18,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:29:18,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:29:20,698 INFO  L124   PetriNetUnfolderBase]: 3794/5826 cut-off events.
[2024-06-14 15:29:20,698 INFO  L125   PetriNetUnfolderBase]: For 446955/446961 co-relation queries the response was YES.
[2024-06-14 15:29:20,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 51572 conditions, 5826 events. 3794/5826 cut-off events. For 446955/446961 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 32263 event pairs, 1003 based on Foata normal form. 6/5830 useless extension candidates. Maximal degree in co-relation 51479. Up to 5263 conditions per place. 
[2024-06-14 15:29:20,746 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 201 selfloop transitions, 63 changer transitions 0/269 dead transitions.
[2024-06-14 15:29:20,747 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 269 transitions, 4041 flow
[2024-06-14 15:29:20,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:29:20,747 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:29:20,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions.
[2024-06-14 15:29:20,748 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47840531561461797
[2024-06-14 15:29:20,748 INFO  L175             Difference]: Start difference. First operand has 186 places, 237 transitions, 3157 flow. Second operand 7 states and 144 transitions.
[2024-06-14 15:29:20,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 269 transitions, 4041 flow
[2024-06-14 15:29:21,266 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 269 transitions, 3850 flow, removed 54 selfloop flow, removed 5 redundant places.
[2024-06-14 15:29:21,270 INFO  L231             Difference]: Finished difference. Result has 188 places, 242 transitions, 3201 flow
[2024-06-14 15:29:21,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=2971, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3201, PETRI_PLACES=188, PETRI_TRANSITIONS=242}
[2024-06-14 15:29:21,271 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 144 predicate places.
[2024-06-14 15:29:21,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 242 transitions, 3201 flow
[2024-06-14 15:29:21,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:21,271 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:29:21,271 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:29:21,271 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2024-06-14 15:29:21,271 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-14 15:29:21,272 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:29:21,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -2048147623, now seen corresponding path program 7 times
[2024-06-14 15:29:21,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:29:21,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385998566]
[2024-06-14 15:29:21,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:29:21,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:29:21,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:29:32,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-14 15:29:32,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:29:32,096 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385998566]
[2024-06-14 15:29:32,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385998566] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:29:32,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:29:32,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:29:32,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133408542]
[2024-06-14 15:29:32,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:29:32,097 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:29:32,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:29:32,097 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:29:32,097 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:29:32,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:29:32,343 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 242 transitions, 3201 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:32,343 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:29:32,343 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:29:32,343 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:29:34,826 INFO  L124   PetriNetUnfolderBase]: 3891/5987 cut-off events.
[2024-06-14 15:29:34,826 INFO  L125   PetriNetUnfolderBase]: For 483170/483176 co-relation queries the response was YES.
[2024-06-14 15:29:34,860 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52762 conditions, 5987 events. 3891/5987 cut-off events. For 483170/483176 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 33482 event pairs, 828 based on Foata normal form. 26/6011 useless extension candidates. Maximal degree in co-relation 52667. Up to 4559 conditions per place. 
[2024-06-14 15:29:34,884 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 197 selfloop transitions, 102 changer transitions 0/304 dead transitions.
[2024-06-14 15:29:34,884 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 304 transitions, 4832 flow
[2024-06-14 15:29:34,884 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:29:34,884 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:29:34,885 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions.
[2024-06-14 15:29:34,885 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5116279069767442
[2024-06-14 15:29:34,885 INFO  L175             Difference]: Start difference. First operand has 188 places, 242 transitions, 3201 flow. Second operand 9 states and 198 transitions.
[2024-06-14 15:29:34,885 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 304 transitions, 4832 flow
[2024-06-14 15:29:35,405 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 304 transitions, 4719 flow, removed 13 selfloop flow, removed 4 redundant places.
[2024-06-14 15:29:35,409 INFO  L231             Difference]: Finished difference. Result has 195 places, 248 transitions, 3556 flow
[2024-06-14 15:29:35,409 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3088, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3556, PETRI_PLACES=195, PETRI_TRANSITIONS=248}
[2024-06-14 15:29:35,410 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 151 predicate places.
[2024-06-14 15:29:35,410 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 248 transitions, 3556 flow
[2024-06-14 15:29:35,410 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:35,410 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:29:35,410 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:29:35,410 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2024-06-14 15:29:35,410 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-14 15:29:35,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:29:35,411 INFO  L85        PathProgramCache]: Analyzing trace with hash -2048143903, now seen corresponding path program 8 times
[2024-06-14 15:29:35,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:29:35,411 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524373045]
[2024-06-14 15:29:35,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:29:35,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:29:35,450 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:29:46,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:29:46,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:29:46,391 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524373045]
[2024-06-14 15:29:46,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524373045] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:29:46,391 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:29:46,391 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:29:46,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91245337]
[2024-06-14 15:29:46,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:29:46,391 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:29:46,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:29:46,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:29:46,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:29:46,561 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:29:46,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 248 transitions, 3556 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:46,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:29:46,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:29:46,562 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:29:49,189 INFO  L124   PetriNetUnfolderBase]: 4014/6190 cut-off events.
[2024-06-14 15:29:49,190 INFO  L125   PetriNetUnfolderBase]: For 528763/528769 co-relation queries the response was YES.
[2024-06-14 15:29:49,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55938 conditions, 6190 events. 4014/6190 cut-off events. For 528763/528769 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 34936 event pairs, 1027 based on Foata normal form. 32/6220 useless extension candidates. Maximal degree in co-relation 55840. Up to 5174 conditions per place. 
[2024-06-14 15:29:49,245 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 195 selfloop transitions, 100 changer transitions 0/300 dead transitions.
[2024-06-14 15:29:49,245 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 300 transitions, 4844 flow
[2024-06-14 15:29:49,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:29:49,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:29:49,246 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions.
[2024-06-14 15:29:49,246 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49870801033591733
[2024-06-14 15:29:49,246 INFO  L175             Difference]: Start difference. First operand has 195 places, 248 transitions, 3556 flow. Second operand 9 states and 193 transitions.
[2024-06-14 15:29:49,246 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 300 transitions, 4844 flow
[2024-06-14 15:29:49,851 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 300 transitions, 4442 flow, removed 62 selfloop flow, removed 7 redundant places.
[2024-06-14 15:29:49,855 INFO  L231             Difference]: Finished difference. Result has 197 places, 250 transitions, 3474 flow
[2024-06-14 15:29:49,855 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3159, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3474, PETRI_PLACES=197, PETRI_TRANSITIONS=250}
[2024-06-14 15:29:49,855 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 153 predicate places.
[2024-06-14 15:29:49,856 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 250 transitions, 3474 flow
[2024-06-14 15:29:49,856 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:29:49,856 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:29:49,856 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:29:49,856 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2024-06-14 15:29:49,856 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-14 15:29:49,856 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:29:49,856 INFO  L85        PathProgramCache]: Analyzing trace with hash 1960058283, now seen corresponding path program 1 times
[2024-06-14 15:29:49,856 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:29:49,856 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126393639]
[2024-06-14 15:29:49,856 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:29:49,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:29:49,897 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:30:00,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:30:00,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:30:00,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126393639]
[2024-06-14 15:30:00,130 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126393639] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:30:00,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:30:00,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:30:00,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761567072]
[2024-06-14 15:30:00,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:30:00,131 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:30:00,131 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:30:00,131 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:30:00,131 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:30:00,262 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:30:00,262 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 250 transitions, 3474 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:00,262 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:30:00,262 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:30:00,262 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:30:02,800 INFO  L124   PetriNetUnfolderBase]: 4042/6234 cut-off events.
[2024-06-14 15:30:02,800 INFO  L125   PetriNetUnfolderBase]: For 519936/519942 co-relation queries the response was YES.
[2024-06-14 15:30:02,827 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 54575 conditions, 6234 events. 4042/6234 cut-off events. For 519936/519942 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 35302 event pairs, 1030 based on Foata normal form. 8/6240 useless extension candidates. Maximal degree in co-relation 54479. Up to 5645 conditions per place. 
[2024-06-14 15:30:02,855 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 218 selfloop transitions, 61 changer transitions 0/284 dead transitions.
[2024-06-14 15:30:02,855 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 284 transitions, 4322 flow
[2024-06-14 15:30:02,856 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:30:02,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:30:02,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-06-14 15:30:02,856 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4622093023255814
[2024-06-14 15:30:02,856 INFO  L175             Difference]: Start difference. First operand has 197 places, 250 transitions, 3474 flow. Second operand 8 states and 159 transitions.
[2024-06-14 15:30:02,856 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 284 transitions, 4322 flow
[2024-06-14 15:30:03,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 284 transitions, 4046 flow, removed 40 selfloop flow, removed 7 redundant places.
[2024-06-14 15:30:03,487 INFO  L231             Difference]: Finished difference. Result has 198 places, 253 transitions, 3442 flow
[2024-06-14 15:30:03,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3198, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3442, PETRI_PLACES=198, PETRI_TRANSITIONS=253}
[2024-06-14 15:30:03,487 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 154 predicate places.
[2024-06-14 15:30:03,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 253 transitions, 3442 flow
[2024-06-14 15:30:03,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:03,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:30:03,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:30:03,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2024-06-14 15:30:03,488 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-14 15:30:03,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:30:03,488 INFO  L85        PathProgramCache]: Analyzing trace with hash 336885403, now seen corresponding path program 2 times
[2024-06-14 15:30:03,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:30:03,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41752134]
[2024-06-14 15:30:03,488 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:30:03,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:30:03,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:30:12,979 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-14 15:30:12,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:30:12,979 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41752134]
[2024-06-14 15:30:12,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41752134] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:30:12,979 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:30:12,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:30:12,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91989578]
[2024-06-14 15:30:12,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:30:12,980 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:30:12,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:30:12,980 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:30:12,980 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:30:13,218 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:30:13,219 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 253 transitions, 3442 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:13,219 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:30:13,219 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:30:13,219 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:30:15,623 INFO  L124   PetriNetUnfolderBase]: 4096/6324 cut-off events.
[2024-06-14 15:30:15,623 INFO  L125   PetriNetUnfolderBase]: For 540292/540298 co-relation queries the response was YES.
[2024-06-14 15:30:15,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 55126 conditions, 6324 events. 4096/6324 cut-off events. For 540292/540298 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 35990 event pairs, 995 based on Foata normal form. 8/6330 useless extension candidates. Maximal degree in co-relation 55029. Up to 5573 conditions per place. 
[2024-06-14 15:30:15,676 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 215 selfloop transitions, 72 changer transitions 0/292 dead transitions.
[2024-06-14 15:30:15,676 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 292 transitions, 4618 flow
[2024-06-14 15:30:15,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:30:15,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:30:15,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-06-14 15:30:15,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4680232558139535
[2024-06-14 15:30:15,677 INFO  L175             Difference]: Start difference. First operand has 198 places, 253 transitions, 3442 flow. Second operand 8 states and 161 transitions.
[2024-06-14 15:30:15,677 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 292 transitions, 4618 flow
[2024-06-14 15:30:16,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 292 transitions, 4398 flow, removed 51 selfloop flow, removed 6 redundant places.
[2024-06-14 15:30:16,266 INFO  L231             Difference]: Finished difference. Result has 200 places, 259 transitions, 3609 flow
[2024-06-14 15:30:16,266 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3222, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3609, PETRI_PLACES=200, PETRI_TRANSITIONS=259}
[2024-06-14 15:30:16,267 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 156 predicate places.
[2024-06-14 15:30:16,267 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 259 transitions, 3609 flow
[2024-06-14 15:30:16,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:16,267 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:30:16,267 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:30:16,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2024-06-14 15:30:16,267 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-14 15:30:16,268 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:30:16,268 INFO  L85        PathProgramCache]: Analyzing trace with hash 336670201, now seen corresponding path program 9 times
[2024-06-14 15:30:16,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:30:16,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527958313]
[2024-06-14 15:30:16,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:30:16,268 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:30:16,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:30:27,984 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-14 15:30:27,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:30:27,984 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527958313]
[2024-06-14 15:30:27,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527958313] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:30:27,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:30:27,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:30:27,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672362318]
[2024-06-14 15:30:27,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:30:27,985 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:30:27,985 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:30:27,985 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:30:27,985 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:30:28,199 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:30:28,200 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 259 transitions, 3609 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:28,200 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:30:28,200 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:30:28,200 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:30:30,738 INFO  L124   PetriNetUnfolderBase]: 4220/6528 cut-off events.
[2024-06-14 15:30:30,738 INFO  L125   PetriNetUnfolderBase]: For 605587/605591 co-relation queries the response was YES.
[2024-06-14 15:30:30,767 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57379 conditions, 6528 events. 4220/6528 cut-off events. For 605587/605591 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 37506 event pairs, 1029 based on Foata normal form. 31/6557 useless extension candidates. Maximal degree in co-relation 57281. Up to 5753 conditions per place. 
[2024-06-14 15:30:30,794 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 232 selfloop transitions, 64 changer transitions 0/301 dead transitions.
[2024-06-14 15:30:30,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 301 transitions, 4536 flow
[2024-06-14 15:30:30,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:30:30,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:30:30,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions.
[2024-06-14 15:30:30,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46511627906976744
[2024-06-14 15:30:30,795 INFO  L175             Difference]: Start difference. First operand has 200 places, 259 transitions, 3609 flow. Second operand 9 states and 180 transitions.
[2024-06-14 15:30:30,795 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 301 transitions, 4536 flow
[2024-06-14 15:30:31,313 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 301 transitions, 4334 flow, removed 64 selfloop flow, removed 4 redundant places.
[2024-06-14 15:30:31,316 INFO  L231             Difference]: Finished difference. Result has 205 places, 261 transitions, 3658 flow
[2024-06-14 15:30:31,316 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3407, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3658, PETRI_PLACES=205, PETRI_TRANSITIONS=261}
[2024-06-14 15:30:31,317 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 161 predicate places.
[2024-06-14 15:30:31,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 205 places, 261 transitions, 3658 flow
[2024-06-14 15:30:31,317 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:31,317 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:30:31,317 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:30:31,317 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2024-06-14 15:30:31,317 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-14 15:30:31,317 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:30:31,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 331313773, now seen corresponding path program 3 times
[2024-06-14 15:30:31,318 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:30:31,318 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890769328]
[2024-06-14 15:30:31,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:30:31,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:30:31,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:30:41,171 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-14 15:30:41,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:30:41,172 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890769328]
[2024-06-14 15:30:41,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890769328] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:30:41,172 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:30:41,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:30:41,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818683667]
[2024-06-14 15:30:41,172 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:30:41,172 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:30:41,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:30:41,173 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:30:41,173 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:30:41,329 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:30:41,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 261 transitions, 3658 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:41,332 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:30:41,332 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:30:41,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:30:43,831 INFO  L124   PetriNetUnfolderBase]: 4222/6526 cut-off events.
[2024-06-14 15:30:43,832 INFO  L125   PetriNetUnfolderBase]: For 586112/586116 co-relation queries the response was YES.
[2024-06-14 15:30:43,870 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57616 conditions, 6526 events. 4222/6526 cut-off events. For 586112/586116 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 37419 event pairs, 1055 based on Foata normal form. 7/6531 useless extension candidates. Maximal degree in co-relation 57516. Up to 5937 conditions per place. 
[2024-06-14 15:30:43,902 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 226 selfloop transitions, 65 changer transitions 0/296 dead transitions.
[2024-06-14 15:30:43,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 296 transitions, 4544 flow
[2024-06-14 15:30:43,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:30:43,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:30:43,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions.
[2024-06-14 15:30:43,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47674418604651164
[2024-06-14 15:30:43,903 INFO  L175             Difference]: Start difference. First operand has 205 places, 261 transitions, 3658 flow. Second operand 8 states and 164 transitions.
[2024-06-14 15:30:43,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 296 transitions, 4544 flow
[2024-06-14 15:30:44,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 296 transitions, 4262 flow, removed 79 selfloop flow, removed 7 redundant places.
[2024-06-14 15:30:44,683 INFO  L231             Difference]: Finished difference. Result has 206 places, 261 transitions, 3514 flow
[2024-06-14 15:30:44,683 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3376, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3514, PETRI_PLACES=206, PETRI_TRANSITIONS=261}
[2024-06-14 15:30:44,684 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 162 predicate places.
[2024-06-14 15:30:44,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 261 transitions, 3514 flow
[2024-06-14 15:30:44,684 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:44,684 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:30:44,685 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:30:44,685 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2024-06-14 15:30:44,685 INFO  L420      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:30:44,685 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:30:44,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 331307821, now seen corresponding path program 10 times
[2024-06-14 15:30:44,685 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:30:44,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747905079]
[2024-06-14 15:30:44,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:30:44,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:30:44,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:30:56,229 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-14 15:30:56,229 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:30:56,229 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747905079]
[2024-06-14 15:30:56,229 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747905079] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:30:56,229 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:30:56,229 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:30:56,229 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951875501]
[2024-06-14 15:30:56,229 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:30:56,230 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:30:56,230 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:30:56,230 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:30:56,230 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:30:56,421 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:30:56,421 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 261 transitions, 3514 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:30:56,421 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:30:56,421 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:30:56,421 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:30:59,368 INFO  L124   PetriNetUnfolderBase]: 4346/6730 cut-off events.
[2024-06-14 15:30:59,368 INFO  L125   PetriNetUnfolderBase]: For 634045/634049 co-relation queries the response was YES.
[2024-06-14 15:30:59,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58719 conditions, 6730 events. 4346/6730 cut-off events. For 634045/634049 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 38965 event pairs, 1071 based on Foata normal form. 31/6759 useless extension candidates. Maximal degree in co-relation 58618. Up to 5955 conditions per place. 
[2024-06-14 15:30:59,429 INFO  L140   encePairwiseOnDemand]: 29/43 looper letters, 234 selfloop transitions, 68 changer transitions 0/307 dead transitions.
[2024-06-14 15:30:59,429 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 307 transitions, 4579 flow
[2024-06-14 15:30:59,429 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:30:59,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:30:59,430 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions.
[2024-06-14 15:30:59,430 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4780361757105943
[2024-06-14 15:30:59,430 INFO  L175             Difference]: Start difference. First operand has 206 places, 261 transitions, 3514 flow. Second operand 9 states and 185 transitions.
[2024-06-14 15:30:59,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 307 transitions, 4579 flow
[2024-06-14 15:31:00,145 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 307 transitions, 4448 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-06-14 15:31:00,149 INFO  L231             Difference]: Finished difference. Result has 209 places, 263 transitions, 3646 flow
[2024-06-14 15:31:00,149 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3646, PETRI_PLACES=209, PETRI_TRANSITIONS=263}
[2024-06-14 15:31:00,149 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 165 predicate places.
[2024-06-14 15:31:00,150 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 263 transitions, 3646 flow
[2024-06-14 15:31:00,150 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:00,150 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:31:00,150 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:31:00,150 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2024-06-14 15:31:00,150 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-14 15:31:00,150 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:31:00,150 INFO  L85        PathProgramCache]: Analyzing trace with hash -106180222, now seen corresponding path program 1 times
[2024-06-14 15:31:00,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:31:00,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247070327]
[2024-06-14 15:31:00,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:31:00,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:31:00,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:31:12,449 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-14 15:31:12,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:31:12,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247070327]
[2024-06-14 15:31:12,450 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247070327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:31:12,450 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:31:12,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:31:12,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105130790]
[2024-06-14 15:31:12,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:31:12,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:31:12,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:31:12,450 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:31:12,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:31:12,593 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-14 15:31:12,593 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 263 transitions, 3646 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:12,593 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:31:12,593 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-14 15:31:12,593 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:31:14,931 INFO  L124   PetriNetUnfolderBase]: 4513/6898 cut-off events.
[2024-06-14 15:31:14,931 INFO  L125   PetriNetUnfolderBase]: For 619862/619862 co-relation queries the response was YES.
[2024-06-14 15:31:14,963 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60387 conditions, 6898 events. 4513/6898 cut-off events. For 619862/619862 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 39155 event pairs, 1277 based on Foata normal form. 1/6897 useless extension candidates. Maximal degree in co-relation 60285. Up to 6849 conditions per place. 
[2024-06-14 15:31:14,994 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 260 selfloop transitions, 23 changer transitions 0/286 dead transitions.
[2024-06-14 15:31:14,994 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 286 transitions, 4468 flow
[2024-06-14 15:31:14,996 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:31:14,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:31:14,996 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions.
[2024-06-14 15:31:14,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.39867109634551495
[2024-06-14 15:31:14,997 INFO  L175             Difference]: Start difference. First operand has 209 places, 263 transitions, 3646 flow. Second operand 7 states and 120 transitions.
[2024-06-14 15:31:14,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 286 transitions, 4468 flow
[2024-06-14 15:31:15,848 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 286 transitions, 4244 flow, removed 46 selfloop flow, removed 7 redundant places.
[2024-06-14 15:31:15,851 INFO  L231             Difference]: Finished difference. Result has 209 places, 269 transitions, 3584 flow
[2024-06-14 15:31:15,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3584, PETRI_PLACES=209, PETRI_TRANSITIONS=269}
[2024-06-14 15:31:15,852 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 165 predicate places.
[2024-06-14 15:31:15,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 269 transitions, 3584 flow
[2024-06-14 15:31:15,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:15,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:31:15,852 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:31:15,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2024-06-14 15:31:15,852 INFO  L420      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:31:15,852 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:31:15,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -106180594, now seen corresponding path program 2 times
[2024-06-14 15:31:15,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:31:15,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059474716]
[2024-06-14 15:31:15,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:31:15,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:31:15,893 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:31:28,091 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-14 15:31:28,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:31:28,092 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059474716]
[2024-06-14 15:31:28,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059474716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:31:28,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:31:28,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:31:28,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155822057]
[2024-06-14 15:31:28,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:31:28,092 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:31:28,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:31:28,093 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:31:28,093 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:31:28,300 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:31:28,300 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 269 transitions, 3584 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:28,300 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:31:28,300 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:31:28,300 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:31:30,764 INFO  L124   PetriNetUnfolderBase]: 4431/6843 cut-off events.
[2024-06-14 15:31:30,764 INFO  L125   PetriNetUnfolderBase]: For 632158/632162 co-relation queries the response was YES.
[2024-06-14 15:31:30,796 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59881 conditions, 6843 events. 4431/6843 cut-off events. For 632158/632162 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 39586 event pairs, 1084 based on Foata normal form. 5/6846 useless extension candidates. Maximal degree in co-relation 59778. Up to 6232 conditions per place. 
[2024-06-14 15:31:30,824 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 226 selfloop transitions, 70 changer transitions 0/303 dead transitions.
[2024-06-14 15:31:30,824 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 303 transitions, 4699 flow
[2024-06-14 15:31:30,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:31:30,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:31:30,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions.
[2024-06-14 15:31:30,825 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4584717607973422
[2024-06-14 15:31:30,825 INFO  L175             Difference]: Start difference. First operand has 209 places, 269 transitions, 3584 flow. Second operand 7 states and 138 transitions.
[2024-06-14 15:31:30,825 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 303 transitions, 4699 flow
[2024-06-14 15:31:31,454 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 303 transitions, 4619 flow, removed 30 selfloop flow, removed 4 redundant places.
[2024-06-14 15:31:31,458 INFO  L231             Difference]: Finished difference. Result has 213 places, 282 transitions, 3935 flow
[2024-06-14 15:31:31,458 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3504, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3935, PETRI_PLACES=213, PETRI_TRANSITIONS=282}
[2024-06-14 15:31:31,459 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 169 predicate places.
[2024-06-14 15:31:31,459 INFO  L495      AbstractCegarLoop]: Abstraction has has 213 places, 282 transitions, 3935 flow
[2024-06-14 15:31:31,459 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:31,459 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:31:31,459 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:31:31,459 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2024-06-14 15:31:31,459 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-14 15:31:31,459 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:31:31,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -391498599, now seen corresponding path program 4 times
[2024-06-14 15:31:31,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:31:31,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484227496]
[2024-06-14 15:31:31,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:31:31,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:31:31,502 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:31:41,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-14 15:31:41,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:31:41,448 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484227496]
[2024-06-14 15:31:41,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484227496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:31:41,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:31:41,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:31:41,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920229843]
[2024-06-14 15:31:41,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:31:41,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:31:41,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:31:41,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:31:41,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:31:41,595 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:31:41,596 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 282 transitions, 3935 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:41,596 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:31:41,596 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:31:41,596 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:31:44,142 INFO  L124   PetriNetUnfolderBase]: 4456/6882 cut-off events.
[2024-06-14 15:31:44,143 INFO  L125   PetriNetUnfolderBase]: For 657146/657150 co-relation queries the response was YES.
[2024-06-14 15:31:44,181 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61009 conditions, 6882 events. 4456/6882 cut-off events. For 657146/657150 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 39839 event pairs, 1224 based on Foata normal form. 10/6890 useless extension candidates. Maximal degree in co-relation 60904. Up to 6645 conditions per place. 
[2024-06-14 15:31:44,212 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 275 selfloop transitions, 29 changer transitions 0/311 dead transitions.
[2024-06-14 15:31:44,212 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 311 transitions, 4735 flow
[2024-06-14 15:31:44,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:31:44,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:31:44,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 15:31:44,213 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.436046511627907
[2024-06-14 15:31:44,213 INFO  L175             Difference]: Start difference. First operand has 213 places, 282 transitions, 3935 flow. Second operand 8 states and 150 transitions.
[2024-06-14 15:31:44,213 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 311 transitions, 4735 flow
[2024-06-14 15:31:45,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 311 transitions, 4637 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-06-14 15:31:45,043 INFO  L231             Difference]: Finished difference. Result has 218 places, 285 transitions, 4033 flow
[2024-06-14 15:31:45,043 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3837, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4033, PETRI_PLACES=218, PETRI_TRANSITIONS=285}
[2024-06-14 15:31:45,043 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 174 predicate places.
[2024-06-14 15:31:45,043 INFO  L495      AbstractCegarLoop]: Abstraction has has 218 places, 285 transitions, 4033 flow
[2024-06-14 15:31:45,044 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:45,044 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:31:45,044 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:31:45,044 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2024-06-14 15:31:45,044 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-14 15:31:45,044 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:31:45,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -553809491, now seen corresponding path program 5 times
[2024-06-14 15:31:45,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:31:45,045 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47164643]
[2024-06-14 15:31:45,045 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:31:45,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:31:45,098 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:31:54,540 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-14 15:31:54,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:31:54,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47164643]
[2024-06-14 15:31:54,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47164643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:31:54,540 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:31:54,540 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:31:54,540 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480543253]
[2024-06-14 15:31:54,540 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:31:54,540 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:31:54,541 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:31:54,541 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:31:54,541 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:31:54,753 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:31:54,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 285 transitions, 4033 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:54,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:31:54,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:31:54,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:31:57,439 INFO  L124   PetriNetUnfolderBase]: 4506/6960 cut-off events.
[2024-06-14 15:31:57,439 INFO  L125   PetriNetUnfolderBase]: For 683785/683789 co-relation queries the response was YES.
[2024-06-14 15:31:57,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61840 conditions, 6960 events. 4506/6960 cut-off events. For 683785/683789 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 40404 event pairs, 1226 based on Foata normal form. 10/6968 useless extension candidates. Maximal degree in co-relation 61734. Up to 6668 conditions per place. 
[2024-06-14 15:31:57,502 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 276 selfloop transitions, 34 changer transitions 0/317 dead transitions.
[2024-06-14 15:31:57,502 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 317 transitions, 4861 flow
[2024-06-14 15:31:57,503 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:31:57,503 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:31:57,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions.
[2024-06-14 15:31:57,503 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.438953488372093
[2024-06-14 15:31:57,503 INFO  L175             Difference]: Start difference. First operand has 218 places, 285 transitions, 4033 flow. Second operand 8 states and 151 transitions.
[2024-06-14 15:31:57,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 317 transitions, 4861 flow
[2024-06-14 15:31:58,429 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 317 transitions, 4689 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-06-14 15:31:58,433 INFO  L231             Difference]: Finished difference. Result has 221 places, 291 transitions, 4099 flow
[2024-06-14 15:31:58,433 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3861, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4099, PETRI_PLACES=221, PETRI_TRANSITIONS=291}
[2024-06-14 15:31:58,433 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 177 predicate places.
[2024-06-14 15:31:58,433 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 291 transitions, 4099 flow
[2024-06-14 15:31:58,433 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:31:58,433 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:31:58,434 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:31:58,434 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2024-06-14 15:31:58,434 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-14 15:31:58,434 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:31:58,434 INFO  L85        PathProgramCache]: Analyzing trace with hash -554024693, now seen corresponding path program 11 times
[2024-06-14 15:31:58,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:31:58,434 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719609201]
[2024-06-14 15:31:58,434 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:31:58,434 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:31:58,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:32:07,396 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-14 15:32:07,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:32:07,396 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719609201]
[2024-06-14 15:32:07,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719609201] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:32:07,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:32:07,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:32:07,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165852805]
[2024-06-14 15:32:07,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:32:07,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:32:07,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:32:07,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:32:07,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:32:07,553 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:32:07,553 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 291 transitions, 4099 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:07,553 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:32:07,553 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:32:07,553 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:32:10,342 INFO  L124   PetriNetUnfolderBase]: 4592/7102 cut-off events.
[2024-06-14 15:32:10,342 INFO  L125   PetriNetUnfolderBase]: For 751546/751550 co-relation queries the response was YES.
[2024-06-14 15:32:10,378 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63395 conditions, 7102 events. 4592/7102 cut-off events. For 751546/751550 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 41453 event pairs, 1228 based on Foata normal form. 34/7134 useless extension candidates. Maximal degree in co-relation 63287. Up to 6696 conditions per place. 
[2024-06-14 15:32:10,409 INFO  L140   encePairwiseOnDemand]: 30/43 looper letters, 289 selfloop transitions, 32 changer transitions 0/328 dead transitions.
[2024-06-14 15:32:10,409 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 328 transitions, 4970 flow
[2024-06-14 15:32:10,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-06-14 15:32:10,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-06-14 15:32:10,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions.
[2024-06-14 15:32:10,410 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 15:32:10,410 INFO  L175             Difference]: Start difference. First operand has 221 places, 291 transitions, 4099 flow. Second operand 9 states and 171 transitions.
[2024-06-14 15:32:10,410 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 328 transitions, 4970 flow
[2024-06-14 15:32:11,502 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 328 transitions, 4790 flow, removed 62 selfloop flow, removed 5 redundant places.
[2024-06-14 15:32:11,506 INFO  L231             Difference]: Finished difference. Result has 225 places, 293 transitions, 4118 flow
[2024-06-14 15:32:11,507 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3919, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4118, PETRI_PLACES=225, PETRI_TRANSITIONS=293}
[2024-06-14 15:32:11,507 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 181 predicate places.
[2024-06-14 15:32:11,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 225 places, 293 transitions, 4118 flow
[2024-06-14 15:32:11,507 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:11,507 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:32:11,507 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:32:11,507 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2024-06-14 15:32:11,507 INFO  L420      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:32:11,508 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:32:11,508 INFO  L85        PathProgramCache]: Analyzing trace with hash -134998089, now seen corresponding path program 6 times
[2024-06-14 15:32:11,508 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:32:11,508 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467663990]
[2024-06-14 15:32:11,508 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:32:11,508 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:32:11,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:32:21,839 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-14 15:32:21,840 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:32:21,840 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467663990]
[2024-06-14 15:32:21,840 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467663990] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:32:21,840 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:32:21,840 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:32:21,840 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000691404]
[2024-06-14 15:32:21,840 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:32:21,840 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:32:21,840 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:32:21,841 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:32:21,841 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:32:22,076 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:32:22,077 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 293 transitions, 4118 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:22,077 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:32:22,077 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:32:22,077 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:32:24,831 INFO  L124   PetriNetUnfolderBase]: 4617/7141 cut-off events.
[2024-06-14 15:32:24,831 INFO  L125   PetriNetUnfolderBase]: For 738770/738774 co-relation queries the response was YES.
[2024-06-14 15:32:24,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64059 conditions, 7141 events. 4617/7141 cut-off events. For 738770/738774 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 41764 event pairs, 1245 based on Foata normal form. 10/7149 useless extension candidates. Maximal degree in co-relation 63950. Up to 6839 conditions per place. 
[2024-06-14 15:32:24,902 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 270 selfloop transitions, 45 changer transitions 0/322 dead transitions.
[2024-06-14 15:32:24,902 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 322 transitions, 4954 flow
[2024-06-14 15:32:24,902 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:32:24,902 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:32:24,903 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions.
[2024-06-14 15:32:24,903 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4418604651162791
[2024-06-14 15:32:24,903 INFO  L175             Difference]: Start difference. First operand has 225 places, 293 transitions, 4118 flow. Second operand 8 states and 152 transitions.
[2024-06-14 15:32:24,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 322 transitions, 4954 flow
[2024-06-14 15:32:25,828 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 322 transitions, 4794 flow, removed 50 selfloop flow, removed 7 redundant places.
[2024-06-14 15:32:25,832 INFO  L231             Difference]: Finished difference. Result has 226 places, 296 transitions, 4204 flow
[2024-06-14 15:32:25,832 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3958, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4204, PETRI_PLACES=226, PETRI_TRANSITIONS=296}
[2024-06-14 15:32:25,833 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 182 predicate places.
[2024-06-14 15:32:25,833 INFO  L495      AbstractCegarLoop]: Abstraction has has 226 places, 296 transitions, 4204 flow
[2024-06-14 15:32:25,833 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:25,833 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:32:25,833 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:32:25,833 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2024-06-14 15:32:25,833 INFO  L420      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:32:25,834 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:32:25,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -134998306, now seen corresponding path program 1 times
[2024-06-14 15:32:25,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:32:25,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233068291]
[2024-06-14 15:32:25,834 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:32:25,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:32:25,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:32:35,786 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-14 15:32:35,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:32:35,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233068291]
[2024-06-14 15:32:35,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233068291] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:32:35,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:32:35,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-06-14 15:32:35,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731876244]
[2024-06-14 15:32:35,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:32:35,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-06-14 15:32:35,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:32:35,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-06-14 15:32:35,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-06-14 15:32:35,953 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:32:35,953 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 296 transitions, 4204 flow. Second operand  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:35,953 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:32:35,953 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:32:35,953 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:32:38,723 INFO  L124   PetriNetUnfolderBase]: 4617/7141 cut-off events.
[2024-06-14 15:32:38,724 INFO  L125   PetriNetUnfolderBase]: For 733342/733346 co-relation queries the response was YES.
[2024-06-14 15:32:38,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63593 conditions, 7141 events. 4617/7141 cut-off events. For 733342/733346 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 41727 event pairs, 1236 based on Foata normal form. 7/7146 useless extension candidates. Maximal degree in co-relation 63483. Up to 6844 conditions per place. 
[2024-06-14 15:32:38,792 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 272 selfloop transitions, 47 changer transitions 0/326 dead transitions.
[2024-06-14 15:32:38,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 326 transitions, 5048 flow
[2024-06-14 15:32:38,793 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:32:38,793 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:32:38,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 15:32:38,793 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44476744186046513
[2024-06-14 15:32:38,793 INFO  L175             Difference]: Start difference. First operand has 226 places, 296 transitions, 4204 flow. Second operand 8 states and 153 transitions.
[2024-06-14 15:32:38,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 326 transitions, 5048 flow
[2024-06-14 15:32:39,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 326 transitions, 4828 flow, removed 69 selfloop flow, removed 6 redundant places.
[2024-06-14 15:32:39,685 INFO  L231             Difference]: Finished difference. Result has 228 places, 300 transitions, 4236 flow
[2024-06-14 15:32:39,685 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=3986, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4236, PETRI_PLACES=228, PETRI_TRANSITIONS=300}
[2024-06-14 15:32:39,685 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 184 predicate places.
[2024-06-14 15:32:39,686 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 300 transitions, 4236 flow
[2024-06-14 15:32:39,686 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:39,686 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:32:39,686 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:32:39,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2024-06-14 15:32:39,686 INFO  L420      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:32:39,686 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:32:39,686 INFO  L85        PathProgramCache]: Analyzing trace with hash 1334597033, now seen corresponding path program 7 times
[2024-06-14 15:32:39,686 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:32:39,686 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464543190]
[2024-06-14 15:32:39,686 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:32:39,686 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:32:39,729 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:32:49,957 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-14 15:32:49,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:32:49,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464543190]
[2024-06-14 15:32:49,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464543190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:32:49,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:32:49,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:32:49,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730350532]
[2024-06-14 15:32:49,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:32:49,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:32:49,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:32:49,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:32:49,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:32:50,175 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:32:50,176 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 300 transitions, 4236 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:50,176 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:32:50,176 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:32:50,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:32:52,930 INFO  L124   PetriNetUnfolderBase]: 4642/7180 cut-off events.
[2024-06-14 15:32:52,930 INFO  L125   PetriNetUnfolderBase]: For 737323/737327 co-relation queries the response was YES.
[2024-06-14 15:32:52,966 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63617 conditions, 7180 events. 4642/7180 cut-off events. For 737323/737327 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42041 event pairs, 1243 based on Foata normal form. 10/7188 useless extension candidates. Maximal degree in co-relation 63506. Up to 6768 conditions per place. 
[2024-06-14 15:32:52,994 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 267 selfloop transitions, 55 changer transitions 0/329 dead transitions.
[2024-06-14 15:32:52,994 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 329 transitions, 5086 flow
[2024-06-14 15:32:52,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:32:52,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:32:52,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions.
[2024-06-14 15:32:52,995 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44476744186046513
[2024-06-14 15:32:52,995 INFO  L175             Difference]: Start difference. First operand has 228 places, 300 transitions, 4236 flow. Second operand 8 states and 153 transitions.
[2024-06-14 15:32:52,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 329 transitions, 5086 flow
[2024-06-14 15:32:53,934 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 329 transitions, 4902 flow, removed 50 selfloop flow, removed 6 redundant places.
[2024-06-14 15:32:53,938 INFO  L231             Difference]: Finished difference. Result has 230 places, 303 transitions, 4320 flow
[2024-06-14 15:32:53,938 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4320, PETRI_PLACES=230, PETRI_TRANSITIONS=303}
[2024-06-14 15:32:53,938 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 186 predicate places.
[2024-06-14 15:32:53,938 INFO  L495      AbstractCegarLoop]: Abstraction has has 230 places, 303 transitions, 4320 flow
[2024-06-14 15:32:53,939 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:32:53,939 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:32:53,939 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:32:53,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2024-06-14 15:32:53,939 INFO  L420      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:32:53,939 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:32:53,939 INFO  L85        PathProgramCache]: Analyzing trace with hash -394190831, now seen corresponding path program 8 times
[2024-06-14 15:32:53,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:32:53,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291941704]
[2024-06-14 15:32:53,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:32:53,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:32:53,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:33:03,142 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-14 15:33:03,142 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:33:03,142 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291941704]
[2024-06-14 15:33:03,142 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291941704] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:33:03,142 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:33:03,142 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-06-14 15:33:03,142 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617132570]
[2024-06-14 15:33:03,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:33:03,143 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-06-14 15:33:03,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:33:03,143 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-06-14 15:33:03,143 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2024-06-14 15:33:03,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:33:03,318 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 303 transitions, 4320 flow. Second operand  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:03,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:33:03,318 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:33:03,318 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:33:06,124 INFO  L124   PetriNetUnfolderBase]: 4642/7180 cut-off events.
[2024-06-14 15:33:06,124 INFO  L125   PetriNetUnfolderBase]: For 755857/755861 co-relation queries the response was YES.
[2024-06-14 15:33:06,160 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63947 conditions, 7180 events. 4642/7180 cut-off events. For 755857/755861 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 41970 event pairs, 1229 based on Foata normal form. 10/7188 useless extension candidates. Maximal degree in co-relation 63835. Up to 6919 conditions per place. 
[2024-06-14 15:33:06,193 INFO  L140   encePairwiseOnDemand]: 32/43 looper letters, 293 selfloop transitions, 32 changer transitions 0/332 dead transitions.
[2024-06-14 15:33:06,193 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 332 transitions, 5180 flow
[2024-06-14 15:33:06,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-06-14 15:33:06,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-06-14 15:33:06,194 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-06-14 15:33:06,194 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.436046511627907
[2024-06-14 15:33:06,195 INFO  L175             Difference]: Start difference. First operand has 230 places, 303 transitions, 4320 flow. Second operand 8 states and 150 transitions.
[2024-06-14 15:33:06,195 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 332 transitions, 5180 flow
[2024-06-14 15:33:07,200 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 332 transitions, 4934 flow, removed 72 selfloop flow, removed 6 redundant places.
[2024-06-14 15:33:07,204 INFO  L231             Difference]: Finished difference. Result has 232 places, 306 transitions, 4298 flow
[2024-06-14 15:33:07,205 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4080, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4298, PETRI_PLACES=232, PETRI_TRANSITIONS=306}
[2024-06-14 15:33:07,205 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 188 predicate places.
[2024-06-14 15:33:07,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 232 places, 306 transitions, 4298 flow
[2024-06-14 15:33:07,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:07,206 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:33:07,206 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:33:07,206 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2024-06-14 15:33:07,206 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-14 15:33:07,206 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:33:07,206 INFO  L85        PathProgramCache]: Analyzing trace with hash -393488130, now seen corresponding path program 2 times
[2024-06-14 15:33:07,206 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:33:07,207 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186735415]
[2024-06-14 15:33:07,207 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:33:07,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:33:07,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:33:19,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-06-14 15:33:19,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:33:19,752 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186735415]
[2024-06-14 15:33:19,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186735415] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:33:19,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:33:19,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:33:19,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659505957]
[2024-06-14 15:33:19,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:33:19,752 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:33:19,752 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:33:19,753 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:33:19,753 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:33:19,832 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-14 15:33:19,832 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 306 transitions, 4298 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:19,832 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:33:19,832 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-14 15:33:19,832 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:33:22,425 INFO  L124   PetriNetUnfolderBase]: 4795/7334 cut-off events.
[2024-06-14 15:33:22,425 INFO  L125   PetriNetUnfolderBase]: For 742412/742412 co-relation queries the response was YES.
[2024-06-14 15:33:22,463 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 64461 conditions, 7334 events. 4795/7334 cut-off events. For 742412/742412 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42192 event pairs, 1310 based on Foata normal form. 1/7333 useless extension candidates. Maximal degree in co-relation 64348. Up to 7312 conditions per place. 
[2024-06-14 15:33:22,493 INFO  L140   encePairwiseOnDemand]: 34/43 looper letters, 302 selfloop transitions, 14 changer transitions 0/319 dead transitions.
[2024-06-14 15:33:22,493 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 319 transitions, 5000 flow
[2024-06-14 15:33:22,493 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:33:22,493 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:33:22,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions.
[2024-06-14 15:33:22,494 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36212624584717606
[2024-06-14 15:33:22,494 INFO  L175             Difference]: Start difference. First operand has 232 places, 306 transitions, 4298 flow. Second operand 7 states and 109 transitions.
[2024-06-14 15:33:22,494 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 319 transitions, 5000 flow
[2024-06-14 15:33:23,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 319 transitions, 4806 flow, removed 67 selfloop flow, removed 6 redundant places.
[2024-06-14 15:33:23,498 INFO  L231             Difference]: Finished difference. Result has 233 places, 309 transitions, 4190 flow
[2024-06-14 15:33:23,498 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4190, PETRI_PLACES=233, PETRI_TRANSITIONS=309}
[2024-06-14 15:33:23,499 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 189 predicate places.
[2024-06-14 15:33:23,499 INFO  L495      AbstractCegarLoop]: Abstraction has has 233 places, 309 transitions, 4190 flow
[2024-06-14 15:33:23,499 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:23,499 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:33:23,499 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:33:23,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2024-06-14 15:33:23,499 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-14 15:33:23,499 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:33:23,500 INFO  L85        PathProgramCache]: Analyzing trace with hash 248082446, now seen corresponding path program 3 times
[2024-06-14 15:33:23,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:33:23,500 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630080510]
[2024-06-14 15:33:23,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:33:23,500 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:33:23,541 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:33:35,051 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-14 15:33:35,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:33:35,051 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630080510]
[2024-06-14 15:33:35,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630080510] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:33:35,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:33:35,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:33:35,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231177809]
[2024-06-14 15:33:35,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:33:35,052 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:33:35,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:33:35,052 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:33:35,052 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:33:35,209 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43
[2024-06-14 15:33:35,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 309 transitions, 4190 flow. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:35,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:33:35,209 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43
[2024-06-14 15:33:35,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-06-14 15:33:37,850 INFO  L124   PetriNetUnfolderBase]: 4641/7180 cut-off events.
[2024-06-14 15:33:37,851 INFO  L125   PetriNetUnfolderBase]: For 755382/755386 co-relation queries the response was YES.
[2024-06-14 15:33:37,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 63178 conditions, 7180 events. 4641/7180 cut-off events. For 755382/755386 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42031 event pairs, 1257 based on Foata normal form. 5/7183 useless extension candidates. Maximal degree in co-relation 63064. Up to 6973 conditions per place. 
[2024-06-14 15:33:37,915 INFO  L140   encePairwiseOnDemand]: 31/43 looper letters, 280 selfloop transitions, 34 changer transitions 0/322 dead transitions.
[2024-06-14 15:33:37,915 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 322 transitions, 4978 flow
[2024-06-14 15:33:37,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-06-14 15:33:37,916 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-06-14 15:33:37,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions.
[2024-06-14 15:33:37,916 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.42524916943521596
[2024-06-14 15:33:37,916 INFO  L175             Difference]: Start difference. First operand has 233 places, 309 transitions, 4190 flow. Second operand 7 states and 128 transitions.
[2024-06-14 15:33:37,917 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 322 transitions, 4978 flow
[2024-06-14 15:33:38,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 322 transitions, 4908 flow, removed 23 selfloop flow, removed 5 redundant places.
[2024-06-14 15:33:38,878 INFO  L231             Difference]: Finished difference. Result has 235 places, 309 transitions, 4198 flow
[2024-06-14 15:33:38,878 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=4120, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4198, PETRI_PLACES=235, PETRI_TRANSITIONS=309}
[2024-06-14 15:33:38,879 INFO  L281   CegarLoopForPetriNet]: 44 programPoint places, 191 predicate places.
[2024-06-14 15:33:38,879 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 309 transitions, 4198 flow
[2024-06-14 15:33:38,879 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:38,879 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-06-14 15:33:38,879 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-14 15:33:38,879 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2024-06-14 15:33:38,879 INFO  L420      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] ===
[2024-06-14 15:33:38,879 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-06-14 15:33:38,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -1474423410, now seen corresponding path program 3 times
[2024-06-14 15:33:38,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-06-14 15:33:38,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333880108]
[2024-06-14 15:33:38,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-06-14 15:33:38,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-06-14 15:33:38,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-06-14 15:33:50,723 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-14 15:33:50,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-06-14 15:33:50,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333880108]
[2024-06-14 15:33:50,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333880108] provided 1 perfect and 0 imperfect interpolant sequences
[2024-06-14 15:33:50,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-06-14 15:33:50,724 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-06-14 15:33:50,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912402044]
[2024-06-14 15:33:50,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-06-14 15:33:50,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-06-14 15:33:50,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-06-14 15:33:50,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-06-14 15:33:50,725 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-06-14 15:33:50,872 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43
[2024-06-14 15:33:50,872 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 309 transitions, 4198 flow. Second operand  has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-06-14 15:33:50,872 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-06-14 15:33:50,872 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43
[2024-06-14 15:33:50,872 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15